File: beehive.html

package info (click to toggle)
pysolfc 3.2.0-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 94,856 kB
  • sloc: python: 82,020; tcl: 4,529; makefile: 65; sh: 57; perl: 48
file content (25 lines) | stat: -rw-r--r-- 856 bytes parent folder | download | duplicates (2)
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
<h1>Beehive</h1>
<p>
Canfield type. 1 deck. Unlimited redeals.

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

<h3>Rules</h3>
<p>
Six tableau piles are dealt forming the "garden", and there is a
thirteen card reserve called the "beehive".
<p>
Piles in the tableau/garden are built by the same rank.  Once all four
cards of the same rank are in a tableau pile, that pile may be moved to
the foundation.  If a tableau pile is empty, the top card from the
reserve/beehive is dealt in its place.  If the reserve is empty, any card
from the tableau or waste pile may be dealt in its place.
<p>
Cards may be dealt from the stock three at a time, and may be played on
the tableau piles.  The top card of the reserve/beehive may also be moved
to a matching tableau pile.
<p>
The game is won when all cards have been matched up and moved to the
foundation.