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 Distances'

Exists: No
Created: by Alex at 2:15:10 17th October 2003 GMT.
Description: Distances with supplemental material
Expires 2:15:10 2nd November 2003 GMT

{
New Rule: DistanceDefault
Color: black, because that was the default color
The graphwise distance between two vertices a, b of space is the least integer n for which there exists a sequence of vertices a = v[0], v[1], ..., v[n-1], b = v[n] such that
v[i] is graphwise adjacent to v[i+1] for all 0 <= i < n. The graphwise distance between nowhere and any possible location of a player is considered to be infinite.

The coordinatewise distance between two vertices a, b of space is defined as their Euclidean distance (so, for (a,b) and (c,d) it's Sqrt((a-c)^2 +(b-d)^2). The coordinatewise distance between nowhere and any possible location of a player is considered to be infinite.
}

Change "equidistant" in rule 16 to "graphwise equidistant".

Delete proposal "Distances" if it exists.

Votes:

Alex voted with 1
Robert voted with 4/7
Olena voted with 1

Comments:

Alex requests that people leaving comments identify themselves (unless they object to doing so).
Remember to delete Distances! --Alex

[debugging data | source code]