Solução do problema da Torre-De-Hanoi para N discos com Depth-First Search
-
Updated
Feb 15, 2017 - C
Solução do problema da Torre-De-Hanoi para N discos com Depth-First Search
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.
My implementation of the Hanoi tower puzzle in concole
Solving the Wolf Cabbage Goat and Man Puzzle
Modeling and solving the Tower of Hanoi with graphs
Hanoi Game in C based on the idea of recursion.
Sort & Search algorithms among others
🔁 C recursion programs.
C programs
Ncurses implementation fo Hanoi towers
Solution implemented in C, Prolog and Scheme
Programs covered in DAA Lab during Semester 4
Add a description, image, and links to the hanoi-towers topic page so that developers can more easily learn about it.
To associate your repository with the hanoi-towers topic, visit your repo's landing page and select "manage topics."