TowersOfHanoi
—Josh Feler
This Karel contest entry solves the Tower of Hanoi problem for any size.
Necessary conditions for the functioning of the program are that the
problem be modeled in a world with three columns (height can be anything
taller than number of discs in the problem + 1) and that all the discs
start on the third column in a legal formation (ie, discs must be in
proper ascending order from the top). Disc size is modeled by the number
of beepers on a corner. A corner with 3 beepers represents a disc
smaller than a corner with 7 beepers, etc.