An Optimized MPI-based Approach for Solving the N-Queens Problem

The brute-force solution of n-queens problem is computationally expensive due to the large number of possible positioning of n number of queens on an n×n chessboard. In order to meet this challenge, the number of possibilities can be reduced by applying some rules, and the time needed to examine the remaining ones can become shorter by processing them with parallelism. We have introduced an optimized recursive parallel implementation of the n-queens problem using MPI which shows significant improvement in speed compared to the previous MPI version.