Project Title: SOLVING TOWER OF HANOI GAME USING A* SEARCH ALGORITHM AND RECURSIVE BEST FIRST ALGORITHM
Project is implemented in Python language
Required software: Visual studio IDE, python interpreter
Instructions for downloading the visual studio download the software from the link: https://visualstudio.microsoft.com/vs/features/python/
Installation of visual studio:
- Make sure your computer is ready for Visual Studio
- Download Visual Studio
- Install the Visual Studio installer
- After the new workloads and components are installed, choose Launch. Then choose install
- For Python, select the Python development workload and select Install
- select the installation location
- Start programming
Execution steps*
- ASTAR.py(A* search algorithm) and
- RBFS.py (Recursive Best First Search algorithm) files.
- To Solve tower of hanoi problem using A* we can run ASTAR.py by clicking run button
- Now the algorithm starts execution for all the disks which can complete within 30 mins (all 3 heuristic will complete execution for 11 disks in 30 mins)
- To Solve tower of hanoi problem using RBFS we can run RFS.py by clicking run button
- Now the time taken by both algorithms is calculated and memory consumed is also determined.