GitHub - awahib480/8-Queens-Solver: A 8-Queens Solver that solves a common AI problem of placing 8 queens on a 8x8 board without any conflicts between the queens. Built using Tkinter (for UI) and Python. Includes two algorithms i.e. BFS (Breadth-First Search) and CSP (Constraint Satisfaction Problem).

awahib480 / 8-Queens-Solver Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

A 8-Queens Solver that solves a common AI problem of placing 8 queens on a 8x8 board without any conflicts between the queens. Built using Tkinter (for UI) and Python. Includes two algorithms i.e. BFS (Breadth-First Search) and CSP (Constraint Satisfaction Problem).

MIT license

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
LICENSE		LICENSE
algorithms.py		algorithms.py
app.py		app.py
board.py		board.py
notebook.ipynb		notebook.ipynb
readme.txt		readme.txt

Repository files navigation

************************************
Working / Tutorial (8-Queens Solver)
************************************

1. Run the "app.py" file to open the application interface.
2. Select your desired Algorithm (BFS or CSP) from the dropdown menu.
3. Choose your Initial Configuration of Queens (Default or Custom).
4. If using Custom, enter a row number (1-8) for each column in the boxes to place queens.
5. Click the Start button to run the first step and enable controls.
6. Use the Step button to advance one action at a time for detailed viewing.
7. Use the Run button to execute the search continuously until a solution is found or the search fails.
8. Details of active queen's movement and the status updates are on the right panel.
9. Click Reset to clear the board and choose a new algorithm or configuration.