File: precedence.html

package info (click to toggle)
pysolfc 3.2.0-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 94,860 kB
  • sloc: python: 82,020; tcl: 4,529; makefile: 66; sh: 57; perl: 48
file content (55 lines) | stat: -rw-r--r-- 1,537 bytes parent folder | download
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
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<html>
<head>
<title>PySol - Rules for Precedence</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>Precedence</h1>
<p>
Two-Deck game type. 2 decks. 2 redeals.

<h3>Object</h3>
<p>
Move all the cards to the foundations.

<h3>Rules</h3>
<p>
At the start of the game, one king is moved to the leftmost
of eight foundations.
<p>
Deal cards from the stock one at a time.  Cards from the waste
pile may be moved to foundations, which are built down by rank,
wrapping down from ace to king as necessary.  A card cannot be
placed in a foundation unless the foundation to the left of it
has cards in it.
<p>
The leftmost foundation starts with a king, and each foundation
starts with one rank lower than the one to the left of it.  Therefore,
the foundations begin with K-Q-J-10-9-8-7-6 from left to right, and
are built to A-K-Q-J-10-9-8-7 respectively.
<p>
You can go through the talon three times.  The game is won if
all cards are moved to the foundations.


<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>