PySol - Rules for Hanoi Puzzle

# Hanoi Puzzle

Tower of Hanoi game type. 3+ cards. No redeal.

### Object

Move all of the cards to the rightmost stack.

### Rules

A sequence of cards is played on the leftmost of three stacks, all of the same suit, in order highest to lowest on top.

Cards may only be played on top of a higher valued card. Only the top card may be moved, and spaces may be filled with any single card.

You win when all of the cards have been moved to the rightmost stack.

### Notes

Autodrop is disabled for this game.

### History

Hanoi Puzzle is a card-based version of the classic Tower of Hanoi puzzle. It is traditionally played with different size disks.

For a given number of cards, the minimum number of moves to solve the puzzle is one less than two to a power of the number of cards (2^n - 1).

Glossary
General rules

Back to the index
Back to individual game rules

PySolFC Documentation - version 3.6.0