Project: Tower of Hanoi: In Python
* Create an efficient representation of the problem to be used with the search
* Implement the A∗ algorithm and another search algorithm of your choice
to solve the problem.
* Create at least two heuristic functions for this problem to work with A∗
At least one of them should be admissible.
* Run both algorithms with an increasing number n of discs and create a
table with a comparison showing runtime vs. n.