Contact Details:
Jonathan Grey: khalek@linuxgamers.net
Nathan Parslow: bruce@linuxgamers.net

How it works:

For the purpose of this document a 'turn' is the period of time between one block arriving in the field, and the next.

At the start of a turn, the current block, next block, and current field is taken.  These blocks are recursively added to the fields in all possible combinations of x rotation and x location.  Each of the resultant field is rated, as per the standard rating method, described later.  The comibination of moves with the highest rate is selected, and the first peice is rotation, moved, then dropped.

After a peice has been dropped specials are calculated.  Firstly all fields are read from all players.  A recursive function is then called to get the effectiveness of the specials, this compares all depths and the cost of the specials to be used.

This recursive function:
	- Loops through all fields performing:
		- Effect of special block
		- Field ratings as per standard
		- Performs own function on new fields
		- Stored best score
	- Returns best option

Rating of special usage is considered, and if worth while specials are used.

A loop then waits for the next turn.
