Modeling and solving the Tower of Hanoi with graphs
-
Updated
Feb 11, 2024 - C
Modeling and solving the Tower of Hanoi with graphs
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. Object of the game is to move all the disks over to another tower. But you cannot place a larger disk onto a smaller disk.
Hanoi Game in C based on the idea of recursion.
Hanoi tower game solved automaticaly by software developed in C
Add a description, image, and links to the hanoi-puzzle topic page so that developers can more easily learn about it.
To associate your repository with the hanoi-puzzle topic, visit your repo's landing page and select "manage topics."