Skip to content
#

nqueens

Here are 8 public repositories matching this topic...

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.

  • Updated Dec 10, 2022
  • C

Improve this page

Add a description, image, and links to the nqueens topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the nqueens topic, visit your repo's landing page and select "manage topics."

Learn more