This project is for educational purposes only. Live deploy
The problem is to place n queens in such a manner on an n x n chessboard that no queens attack each other by being in the same row, column or diagonal.
Until now only 2 algorithms have been implemented:
- Backtracking
- QS1 based on: How to Search for Millions of Queens
- Clone the repo
- run
npm start
- Queens
- Free dimensional board
- Queens attack positions
- Diplay number of iterations
- Visualize the algorithms
- Responsive