The program is called Towers of Hanoi, and you've probably seen a kid's toy for this ... so let's have a look at how that might work too. The basic algorithm has three steps: Move the topmost disks ...

The tower of Hanoi (also called the tower of Brahma or ... This list of steps is called an “algorithm.” Extra: Can you try your algorithm on a different number of disks? Does it still work ...

Want to learn more about the recursive algorithm (Yosef Mirsky used a recursive solution to program this arm) for solving Tower of Hanoi? Watch this excellent MIT lecture from 1986: I know I feel ...