Welcome, guest.
  [Refresh|Up] It's 11:27:07 16th October 2004 GMT.
Also please see this site which contains an accurate snapshot of the gamestate (except proposals) at some time far in the past.

Proposal Information for FerretA


Exists: No
Created: by Alex at 0:40:28 5th January 2004 GMT.
Description: the ferret carries its algorithm
Refreshed: 4:12:46 10th January 2004 GMT by Kelly.
Expires 4:12:46 26th January 2004 GMT
Change the text of rule 34 to the following asterisk-delimited text.

*
Let D = (d_1, d_2, ... , d_8) = ((-1,0),(-1,1),(0,1),(1,1),(1.0),(1,-1),(0,-1),(-1,-1)).

A vertex of space may be assigned any legal ferret algorithm; the mapping is
part of the gamestate. An algorithm is a legal ferret algorithm only if the ruleset explicitly states so. In particular, the following is a type of move with an evaluation period of eleven days: a player may assign an allowed
algorithm to some vertex e owns.

Location, focus, and current algorithm are properties of the ferret that are in the gamestate, as is direction.

The location and focus of the ferret are vertices of space. The current algorithm of the ferret is a legal ferret algorithm. The direction of the ferret is a member of D. Each day at 16:00 GMT, the ferret's
location and direction are updated according to its current algorithm. When the ferret's location becomes vertex v, if v has an assigned
algorithm and v is not currently the ferret's focus, the ferret acquires v as focus and the algorithm assigned to v as current algorithm, and v's owner (if a player) is incremented.

The following algorithm, called "forgetful left wall following", is a legal ferret algorithm: "Suppose that (x,y) is the current location of the
ferret. Let S = {i | (x,y)+d_i is graphwise adjacent to (x,y)}. If S is not empty: Let I be the smallest element of S. Set the ferret's direction to
d_I. Set the ferret's location to (x,y) + d_I."

The following algorithm, called "left wall following", is a legal ferret algorithm: "Suppose that (x,y) is the current location of the ferret.
Let n be the integer such that d_n is the ferret's direction. Let T=(t_1,t_2,...,t_8) be the cyclic permutation of D whose first element is
d_((n+4)%8 + 1). Let S = {i | (x,y)+t_i is graphwise adjacent to (x,y)}. If S is not empty: Let I be the smallest element of S. Set the ferret's
direction to t_I. Set the ferret's location to (x,y) + t_I."
*

Votes:
Comments:

Up

[debugging data | source code]