We report on COOL-MC, a model checking tool for fix- point logics that is parametric in the branching type of models (non- deterministic, game-based, probabilistic etc.) and in the next-step modal- ities used in formulae. The tool implements generic model checking algo- rithms developed in coalgebraic logic that are easily adapted to concrete instance logics. Apart from the standard modal µ-calculus, COOL-MC currently supports alternating-time, graded, probabilistic and monotone variants of the µ-calculus, but is also effortlessly extensible with new instance logics. The model checking process is realized by polynomial reductions to parity game solving, or, alternatively, by a local model checking algo- rithm that directly computes the extensions of formulae in a lazy fashion, thereby avoiding the construction of the full parity game. We evaluate COOL-MC on informative benchmark sets.