<_description> 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. https://en.wikipedia.org/wiki/Tower_of_Hanoi Written by Dave Atkinson; 2005.