Welcome, guest.
  [Refresh|Up] The Christmas Game has ended.
You may wish to visit another site which contains an accurate snapshot of the gamestate (except proposals) at some time far in the past.

Proposal Information for Ferret


Exists: No
Created: by Robert at 3:27:27 22nd October 2003 GMT.
Description: fun with algorithms
Refreshed: 8:24:08 30th November 2003 GMT by Kelly.
Expires 8:24:08 16th December 2003 GMT
New Rule: Ferret
Color: brown, of a ferret
*
A vertex of space may be assigned an algorithm, provided that algorithm is among those which the ruleset explicitly allows; the mapping is part of the gamestate. 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.

The location and focus of the ferret are both vertices of space, and are both part of the gamestate, as are as any static variables specified by the algorithm of its focus. Each day at 16:00 GMT, the ferret's location moves to a graphwise adjacent vertex according its focus's algorithm. When the ferret's location is a vertex with an assigned algorithm, the ferret acquires that vertex as owner, and the vertex's owner (if a player) is incremented.

For any *cyclic* permutation (p_1,p_2,...,p_8) of D=((1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)), the following algorithm is allowed:
"Suppose that (x,y) is the current location of the ferret. Let I be the smallest value of i such that a vertex at (x,y)+p_i is graphwise adjacent to (x,y). Then (x,y)+p_I is the new location."
This type of algorithm is referred to as "forgetful right wall following."

The following algorithm, called "right wall following," is also allowed for any d0 in D:
"d, a member of D, is a static variable initially set to d0. Suppose that (x,y) is the current location of the ferret. Let P be the cyclic permutation of D whose first element is d, and I be the smallest value of i such that a vertex at (x,y)+p_i is graphwise adjacent to (x,y). Then (x,y)+p_I is the new location."
*
The ferret's location is vertex 7 (1,1), and its owner is vertex 0 (1,4).
Vertex 0 is assigned the right wall following algorithm with parameter (1,0).

Clearly this needs some revision to prevent players from hogging the ferret.
Perhaps some standard format for algorithms can be devised (or at least a definition of algorithm!).
Votes:
Comments:

Up

[debugging data | source code]