This project solves the classical N-Queens problem using a backtracking algorithm and a Tkinter-based graphical interface for user interaction.
The goal is to place N queens on an N×N chessboard so that no two queens threaten each other (no shared row, column, or diagonal).
- Backtracking search for valid queen placements
- Interactive Tkinter GUI to visualize solutions
- Adjustable board size N
Initial Menu Screen
This project was developed during my undergraduate studies as part of a team assignment focused on algorithmic problem solving and GUI design in Python.
