Our robot, Ernie, performs the towers of Hanoi. He takes anywhere from one to five disks, analyzes the initial state of the board, devises a solution, and then executes the solution in a minimal number of moves.
The towers of Hanoi works as such. There are three "towers" (pegs) upon one of which there are rings of different sizes. No ring can rest on top of a smaller ring. The goal is to move all the rings from the initial tower to a goal tower without placing a larger ring on top of a smaller ring.