A GUI application built with Java Swing that demonstrates a heuristic approach to solving the knight's tour problem on an 8x8 chessboard. The application offers three modes: auto, guided, and manual, catering to different ways of solving or exploring the problem.
The knight's tour problem involves finding a sequence of moves for a knight on a chessboard such that the knight visits every square exactly once. Squirrel's algorithm provides a heuristic to solve this problem efficiently.
- Auto Mode: Automatically solves the knight's tour problem without user intervention.
- Guided Mode: Guides the user by suggesting which cell to move next to solve the knight's tour.
- Manual Mode: Allows the user to solve the knight's tour themselves, turning it into a game-like experience.
- GUI interface built with Java Swing for interactive visualization.
- Implements Squirrel's algorithm heuristic for solving the knight's tour problem.
- Board size: 8x8 chessboard.
- Clone the repository
- Open the project in your Java IDE.
- Compile and run the application.
- Choose a mode (auto, guided, manual) to solve the knight's tour problem.
- Follow the instructions or prompts based on the selected mode.
- Visualize the knight's moves on the 8x8 chessboard.
This project is licensed under the MIT License. See the LICENSE file for more details.
- Janriz Mathew Libres - [email protected]
- LinkedIn: Profile
- Clint Jonathan Galendez - [email protected]
- LinkedIn: Profile