The A* search algorithm and Breath-first search are demonstrated in this software.
A* is the most popular choice among the developers who need to implement a path finding algorithm.
- If you look at the picture, you will see that the programme allows you to edit the map/dungeon The map consists of five types of cells.
| Cell | Description |
|---|---|
| Space | You can walk through it. |
| Water | The same as space but it takes 4 steps to walk on water. |
| Wall | You cannot walk through it. |
| Begin | The initial cell. |
| Goal | The end cell. |
- Once you've completed configuring the map, simply select AStar Search or Breath First Search.
- The number shows on each cell is the number of steps you need to move from the intial cell to the end cell.
- Just download a project, it is just a small program written in C# Windows Form.