Skip to content
#

queens-problem

Here are 55 public repositories matching this topic...

The N Queens problem is a classic computer science problem that asks how to place N chess queens on an NxN chessboard such that no two queens threaten each other. It's used to study algorithms and artificial intelligence as it requires finding a solution that satisfies multiple constraints and making choices based on previous decisions.

  • Updated Feb 13, 2023
  • Kotlin

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 queens-problem 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 queens-problem topic, visit your repo's landing page and select "manage topics."

Learn more