For 1-point pairs (p,p) it can also be required that the value is one of two numbers i,j in the range -99,...,99 or that it is neither one of two numbers in the range -99,...,99. The meaning "i or j" is represented by

100 i+j+300, if 0 <= i,j <= 99;
100 i-j+20300, if 0 <= i <= 99 and -99 <= j <= 0;
100 i+j-100, if -99 <= i <= -1 and -99 <= j <= 0.

i and j are excluded by the number

100 i+j+10300, if 0 <= i,j <= 99;
100 i-j+30300, if 0 <= i <= 99 and -99 <= j <= 0;
100 i+j-10100, if -99 <= i <= -1 and -99 <= j <= 0.

For example

#4 1(0,1,2,3,0) 100(0,2) 15220(3,3)

matches a square of edges with value 1, where one diagonal is labeled 0 while the other can take any value. A point on the 0-valued diagonal is neither 20 nor 49, the other points must have value 0.

The edge movement instructions are appended, if needed, at the end of the graph code and are a list of at most four space separated strings of the form

(p,q)->r

(-> is a dash followed by a greater sign), meaning that the edge (p,q) "moves to" (q,r) (i.e. the value of (p,q) decreases by 1 and the value of (q,r) increases by 1).

The list and possibly the edge move instructions can be followed by any text which does not begin with a number followed by a parentheses or an expression of the form (p,q)->r.

Not all edge movement instructions can be applied. They must for example preserve the value and the valence of every point and can not force an edge to increase or decrease its value by 2 or more. The program checks the correctness of the rules before beginning the computation. An edge movement instruction can be partial, if there is no ambiguity in completing it.

For this release the largest number of points in a graph is 100, the largest number of non-zero points or edges in a graph is 500 and the range of integer labels of pairs of points in the graph is between -32768 and 32768.

The computation produces a sequence of colored graphs called a generation, whose maximum length for this release is set to 200000.

<< back