Custom Tower of Hanoi Solver

After positioning 5 discs of the Tower of Hanoi to any position, this application will calculate the most efficient solution to moving the discs to the end position, while following the rules of the Tower of Hanoi puzzle. These are: 1. A disc may not be placed on top of a smaller disc. 2. Only one disc may be moved at a time. 3. Only the top disc of a pile may be moved onto another peg. An online version for 7 discs can be found here: https://scratch.mit.edu/projects/2614806/ It uses the same logic as this application, which I made as part of a school project 8.