Solves the Towers of Hanoi puzzle. Move N disks from one pole to another, one disk at a time, with no disk ever resting on a disk smaller than itself. http: / /en. wikipedia. org/ wiki/ Tower_of_Hanoi Written by Dave Atkinson; 2005.
Resolve o quebracabezas das Torres de Hanoi. Move N discos dun pau ao outro, movendo un disco de cada vez, sen que os discos descansen nunca noutro máis pequeno ca el. http: // en. wikipedia. org/ wiki/ Tower_ of_ Hanoi. Escribiuno Dave Atkinson en 2005.