The N-Queens problem is to place N-Queens on an NxN chessboard such that no queens attack each other.
This project visualizes the recursive solution algorithm.
You can access it here: https://bhushan-srivastava.github.io/N-Queens-Visualizer/
-
Notifications
You must be signed in to change notification settings - Fork 0
The N-Queens problem is to place N-Queens on an NxN chessboard such that no queens attack each other. This project visualizes the recursive solution algorithm. You can access it here: https://bhushan-srivastava.github.io/N-Queens-Visualizer/
bhushan-srivastava/N-Queens-Visualizer
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The N-Queens problem is to place N-Queens on an NxN chessboard such that no queens attack each other. This project visualizes the recursive solution algorithm. You can access it here: https://bhushan-srivastava.github.io/N-Queens-Visualizer/
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published