https://github.com/esraaj-sarkar-gupta/tower-of-hanoi

A recursive python program to solve the Tower of Hanoi Problem and an accompanying set of scripts to analyse data from the runtime of integral values of the program to observe exponentially increasing runtime.
https://github.com/esraaj-sarkar-gupta/tower-of-hanoi

Last synced: about 2 months ago
JSON representation

A recursive python program to solve the Tower of Hanoi Problem and an accompanying set of scripts to analyse data from the runtime of integral values of the program to observe exponentially increasing runtime.

• Host: GitHub
• URL: https://github.com/esraaj-sarkar-gupta/tower-of-hanoi
• Owner: Esraaj-Sarkar-Gupta
• Created: 2024-05-09T19:12:50.000Z (8 months ago)
• Default Branch: main
• Last Pushed: 2024-06-26T20:27:45.000Z (6 months ago)
• Last Synced: 2024-06-27T00:43:01.956Z (6 months ago)
• Language: Python
• Homepage:
• Size: 105 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
This project focuses on solving the Tower of Hanoi problem and using the computation times to analyse exponential computation. 

Tower_of_Hanoi.py solves the TOH problem under 0 constraints.

Time_TOH.py times TOH.py for every inetegral value of N (number of discs) and plots the data. 

The data collected using Time_TOH.py was fed into function fitting programmes (https://wwww.mycurvefit) to generate an approximate function for the computation time for integral values of N. 

The functions collcted, listed below were used to estimate times for higher values of N (values for which my computer is too slow and I am too impatient).