In this paper, we describe the design and implementation of a parallel model checking algorithm for the alternation free fragment of the μ-calculus. It exploits a characterisation of the model checking problem for this fragment in terms of two-person games. Our algorithm determines the corresponding winner in parallel. It is designed to run on a network of workstations. An implementation within the verification tool Truth shows promising results.