Skip to content

Solution to the Hanoi Tower by using recursion in C#

Notifications You must be signed in to change notification settings

lazzerex/Hanoi-Tower

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

I. HOW TO USE THE CODE

  1. Clone the project using: git clone

  2. Run the Program.cs file in the GaussLegendre folder.

  3. Enter the number of disc (numdisc). The correct number of moves should be 2^(numdics) - 1.

About

Solution to the Hanoi Tower by using recursion in C#

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages