mirror of
https://github.com/shlomif/PySolFC.git
synced 2025-04-05 00:02:29 -04:00
30 lines
859 B
HTML
30 lines
859 B
HTML
<h1>Hanoi Puzzle</h1>
|
|
<p>
|
|
Tower of Hanoi game type. 3+ cards. No redeal.
|
|
|
|
<h3>Object</h3>
|
|
<p>
|
|
Move all of the cards to the rightmost stack.
|
|
|
|
<h3>Rules</h3>
|
|
<p>
|
|
A sequence of cards is played on the leftmost of three
|
|
stacks, all of the same suit, in order highest to lowest on top.
|
|
<p>
|
|
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.
|
|
<p>
|
|
You win when all of the cards have been moved to the rightmost stack.
|
|
|
|
<h3>Notes</h3>
|
|
<p>
|
|
<i>Autodrop</i> is disabled for this game.
|
|
|
|
<h3>History</h3>
|
|
<p>
|
|
Hanoi Puzzle is a card-based version of the classic Tower of Hanoi
|
|
puzzle. It is traditionally played with different size disks.
|
|
<p>
|
|
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).
|