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.
Resol el trencaclosques de les torres de Hanoi. Mou N discos des d' un pal a un altre, un disc cada vegada, sense deixar cap disc o sobre d' un de més petit. http: // en. wikipedia. org/ wiki/ Tower_ of_ Hanoi Escrit per Dave Atkinson; 2005.