Tower of hanoi program in c using graphics in multimedia

Tower of hanoi program in c using graphics in multimedia how to#

It might prove instructive to have the game played in a classroom with a different student playing the role of each disc. Each disc will need only to talk to the one just smaller First ask the smaller disc above you to move to the alternate peg (along with its brethren above, if any), make your move, and finally ask the same disc to now move to your peg. If there is no smaller disc on top, simply move to the requested peg. We'll have each disc use the following strategy.

Lets think of the discs as being animated and that we can request one of them to move itself, along with all of the smaller brethen above it, to another peg. Then the discs, as objects, can hold the information normally held in the call stack. The recursion can be avoided, or at least made more intuitive by using an object oriented approach. And I think the problem is the difficulty in visualizing the nested context of the recursive calls. It is much better than the usual factorial example which does nothing more than use recursion to replace a simple for loop.Д«ut students have a hard time getting it. I have tried a couple of times to teach the Hanoi puzzle as a good example of recursion. Here is a screen shot of the game in progress.ДЄnd here is a javascript animation. The other 99% of the program involves doing TK graphics to make it come alive. Guido's hanoi.py in the Python Demo area is a nice demonstration of this recursive process. Can't do 4 discs? Well then, move just 3.

Tower of hanoi program in c using graphics in multimedia how to#

If you don't know how to move 5 discs from A to C (using B for intermediate storage), then just move 4 discs from A to B, one disk from A to C (this is really easy) and then move 4 discs from B to C. The problem is to move the discs, one at a time from peg to peg in such a way that this is always true and to finally end up with all of the discs on peg 3 in the original order. A disc is never stacked on top of a smaller disc. In the initial configuration all the discs are stacked on the first peg with the largest disc on the bottom and the smallest on top. Each disc can fit on any of 3 pegs and each peg is high enough to hold all the discs in a stack. There are a number of discs each with a hole in the center. The Tower of Hanoi is a classic game that is often emulated on computers to demonstrate recursion.