While preparing on of my class about algorithm, I talked about the calssical Towers of Hanoï problem, the perfect example on recursivity. In this game, you have a number of discs, each with a different size, placed on a pole, from the biggest to the smallest. You have to move all the discs, one by one, to another pole, but you can only move a disc on a larger one.

So here's a little demo of this problem, made with Virtools, where you can choose the number of discs, and then you see the animation of the solution. Don't forget that you'll need the 3DVIA Virtools Player to see the demo.

Try the Towers of Hanoï

The higher the tower, the deeper the fall.

Horace