Logic to calculate and visualize all the solutions of the N Queens Problems
-
Updated
Dec 25, 2021 - C
Logic to calculate and visualize all the solutions of the N Queens Problems
In the game of chess, the queen can attack any piece that lies on the same row, on the same column, or along a diagonal. The eight-queens is a classic logic puzzle. The task is to place eight queens on a chessboard in such a fashion that no queen can attack any other queen.
NQueens puzzle implemented with OpenMP and OpenMPI
This is a promising implementation of the n-Queens problem in C. It uses a recursive backtracking algorithm to find all solutions to the n-Queens problem. It is a promising implementation because it uses a heuristic to prune the search tree. The heuristic is to only place a queen in a column if it is not in check with any other queens.
♟️ A program that displays all possible locations of ten queens on a chessboard
Add a description, image, and links to the queens-problem topic page so that developers can more easily learn about it.
To associate your repository with the queens-problem topic, visit your repo's landing page and select "manage topics."