Towers. This program solves the Towers of Hanoi problem using a recursive technique. Works for 1 to 9 disks. The disks start on the left pole (1) and end up on the right pole (3), using the middle pole (2). Nine disks takes about 23 Edsac minutes.
Download Towers: Towers.txt
Program documentation: Towers.pdf