We present a parallel solver for the propositional satisfiability problem called PICHAFF. The algorithm is an adaption of the state-of-the-art solver CHAFF optimised for a scalable, dynamically reconfigurable multiprocessor system based on Microchip PIC microcontrollers. PICHAFF includes lazy clause evaluation, conflict driven learning, non-chronological backtracking, clause deletion, and early conflict detection, all of them adapted to the environment considered. For the parallel execution Dynamic Search Space Partitioning is incorporated to divide the search space into disjoint portions to be treated in parallel. We demonstrate the feasibility of our approach by a set of experiments on a multiprocessor system containing 9 Microchip PIC17C43 microcontrollers.