luigidisotto/n-queens

Implementation of a sequential algorithm to solve the n-queens puzzle with bit-masks to recursively compute valid chess configurations. Refactored into a parallel Divide-and-Conquer implementation with C++ threads almost 10x faster than the sequential implementation. The parallel code has been also translated into using parallel patterns by FastFlow.

C++