Knight-s-Tour-Problem---Heuristic-Search

Description

This project implements a solution to the Knight’s Tour Problem on a chessboard using heuristic search methods.
The program allows the user to choose the starting square of the knight and generates a complete tour across the board.

The path is displayed in the console using numbers from 1 to 64, representing each step of the knight’s movement, making the sequence easy to visualize.

The project also explains the chosen heuristic and how it was implemented.

---

Features

• Solve the Knight’s Tour problem using heuristic search.
• User can select the starting square.
• Output shows the full path using step numbers (1–64).
• Console interface that is simple and easy to follow.
• Includes both source code and an executable version (no dependencies required).

---

How to Run

1. Clone this repository:

   git clone https://github.com/your-username/knights-tour-heuristic.git
   cd knights-tour-heuristic
   
   This project was developed as part of a university assignment for the Heuristic Search topic.

Team members (3) contributed equally to the implementation and presentation, they are:

Logan Fernandes

Eduarda

Maria Eduarda