The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

This is a C# console application. The purpose of this program is to show possible puzzle moves with Recursion.

• Visual Studio 2017 Community with .NET Core 2.0 SDK
• GitBash / Terminal or GitHub Extension for Visual Studio

1. Clone the repository to your local machine.
2. Cd into the application directory where the AppName.sln exist.
3. Open the application using Open/Start AppName.sln.
4. Once Visual Studio is opened, you can Run the application by clicking on the Play button .
5. A welcome message with instructions will be displayed to teach you how to get the results.

A few rules should be applied to the puzzle:-

• Only one disk is allowed to move at a time.
• Bigger disks can never be on the top of smaller ones.
• Minimum number of disks to move is 1.

• Total Number of Moves = (2 ^ Number Of Disks) - 1 ... Note that ^ is the power operator.

E.g.: 1-2-3 in ascending order where:

• '1' is the starting pile that has the disks.
• '2' is the helper rod that will be calculated every recursive call.
• '3' is the destination rode where the final move will happen.

1. Move (n - 1) disk from pile 1 to 3 using the helper pile 2 as an intermediate.
2. Move nth disk from pile 1 to 3
3. Move (n - 1) disk from 2 to 3 using the helper pile 1 as an intermediate.

Note: n is the number of disks needs to be transferred.

• C# Console Core application.