1
0
Fork 0
mirror of https://github.com/shlomif/PySolFC.git synced 2025-04-05 00:02:29 -04:00
PySolFC/html-src/rules/bitsnbytes.html
Shlomi Fish ada9778879 Ran the HTMLs thru tidy.
tidy -asxhtml so they will validate.
2017-11-12 21:26:36 +02:00

36 lines
1.4 KiB
HTML

<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta name="generator" content=
"HTML Tidy for HTML5 for Linux version 5.4.0" />
<title></title>
</head>
<body>
<h1>Bits n Bytes</h1>
<p>Hex A Deck type. 1 deck. One redeal.</p>
<h3>Object</h3>
<p>Fill all row stacks.</p>
<h3>Quick description</h3>
<p>Fill Byte stacks by matching the goal card's byte value, fill
bit stacks by matching the corresponding bit value.</p>
<h3>Rules</h3>
<p>When play begins the four left most columns are filled with four
goal cards of different ranks, one from each suit. The next two
columns to the right are the byte stacks. They can be filled with
cards of the same rank as the goal card in that row. The four right
most columns are the bit stacks. They can be filled with cards of
the same suit as the goal card in the respective row if their least
significant bit matches the corresponding bit on the goal card.</p>
<p>Cards from the talon are turned over to the waste pile, two at a
time. There is only one redeal.</p>
<p>The only function of the Wizards in this game is to block the
waste stack at the worst possible time.</p>
<h3>Strategy</h3>
<p>Since there are only four cards of any one rank, it's important
to fill the byte columns first.</p>
<h3>Author</h3>
<p>This game and documentation has been written by <a href=
"mailto:grania@mailcity.com">T. Kirk</a> and is part of the
official PySol distribution.</p>
</body>
</html>