Make chess puzzle level (Kasparov to F3) winnable.

[naja.git] / README.txt

diff --git a/README.txt b/README.txt
index 651b7909ce1aace963c010be7fb5c98a0f23d975..23d788cdb0f7eee65ae89ee734b5c99dc709c499 100644 (file)
--- a/README.txt
+++ b/README.txt
@@ -10,7 +10,7 @@ Team:
 Members:
     Simon Cross
     Neil Muller
-    Adrianna Pinska
+    Adrianna Pińska
     Stefano Rivera
     David Sharpe
     Jeremy Thurgood
@@ -46,15 +46,38 @@ Othewise open a terminal / console and "cd" to the game directory and run:
 How to Play the Game
 --------------------
 
-There are no ducks.
+You are a robot, frantically trying to set the correct bits to gain points,
+for reasons that are unlikely to ever become clear.
 
+Your robot has 8 bits. Four bits control the directions you can move in,
+3 allow you to unlock various actions, and the last, the Most Significant Bit,
+makes everything work better.
+
+The game has two phases. Movement and Actions.
+
+During Movement, you can explore the board and learn about the available
+tiles. Tiles you can legally move onto are highlighted. It's always possible
+to stay on your current tile.
+
+After moving, select an action from the tile. Most actions require various
+bits to be set, although all tiles have a default action, although this may
+be "No effect". After the action, the tile will be replaced with a new tile.
+
+Some actions cost you health. When you run out of health, the game is over
+and you lose.
+
+If you have all three colour bits set, and are on the right tile, you can
+gain a point, although this unsets all the colour bits. Once you have enough
+points, you win the game, and there is much rejoicing.
+
+(In true 8-bit style, the Konami Code is accepted.)
 
 Development notes
 -----------------
 
 Creating a source distribution with::
 
-   ./scripts/build_unix.sh
+   python setup.py sdist
 
 You may also generate Windows executables and OS X applications::