Towers of Hanoi

The classic ring-moving puzzle. All the rings start stacked on the left tower, the largest at the bottom. Move them one at a time from tower to tower until the whole stack stands on another tower, never putting a ring on a smaller one. Choose from 2 to 8 rings; three rings need at least 7 moves, eight need 255. Move the hand to a tower and lift its top ring, then carry it to another tower. The move counter keeps track, and when the puzzle is solved your moves are compared with the fewest possible, with a best score kept for each number of rings. Stuck? Ask the computer for one best move, or choose Watch the Computer on the title to see it solve the puzzle alone.

Controls: Left and right move the hand between the towers; the left button (or up or down on the stick) lifts the top ring or sets the held ring down; the right button asks the computer for one move. On the title, up and down choose, left and right set the number of rings, and a button starts. While the computer plays alone, a button returns to the title.

ColecoVision version credited in the source to Claude (an AI made by Anthropic) for Amy Studio, in Amy, the language by Amy Bienvenu, 2026: a reimagined adaptation of the published rules. From Ahoy! No. 18, June 1985, page 17: original Commodore 64 program by Daniel Miller. This is a modern homebrew adaptation, not a commercial Coleco release.