1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<html>
<head>
<title>PySol - Rules for Hanoi Puzzle</title>
<meta name="license" content="GNU General Public License">
<meta http-equiv="content-type" content="text/html; charset=utf-8">
</head>
<body text="#000000" bgcolor="#F7F3FF" link="#0000FF" vlink="#660099"
link="#FF0000">
<img src="../images/pysollogo03.png" alt="PySol FC Logo">
<br>
<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).
<p>
<br>
<a href="../glossary.html">Glossary</a>
<br>
<a href="../general_rules.html">General rules</a>
<p>
<a href="../index.html">Back to the index</a>
<br>
<a href="../rules.html">Back to individual game rules</a>
<hr>
<i>PySolFC Documentation - version 3.2.0</i>
</body>
</html>
|
