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.
-
Notifications
You must be signed in to change notification settings - Fork 0
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.
darian-catalin-cucer/n-queens-problem
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
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.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published