Strategy Y *
if there is an empty key position left then
(a)
if there is an empty key position on the circle where the opponent
took a key position in his last move then
if there is only one point in that circle then
assign the number of key positions for this circle to dN/K"∣
place a point on a key position in that circle next to the point
placed by the opponent on the clockwise side of that point (if
possible), otherwise on the anti-clockwise side (if possible)
_ otherwise anywhere else
else if there is an empty key position in a non empty circle then
place a point on a key position in that circle
else if number of empty circles L ≤ K - N mod K then
place a point on an empty circle assigning the number of key
_ positions for this circle to bN/KJ
else
place a point on an empty circle assigning the number of key
_ positions for this circle to dN/K^∣
else if if r < Z then
(b) |_ place a point in the middle of a maximal interval of the opponent
else
(c) if there is more than one interval of the opponent then
place a point in the middle of a maximal interval of the
opponent
else if there is exactly one interval of the opponent and its length
is l then
place a point in a bichromatic key interval at distance less
_ than 1/dN/Ke — l from endpoint of the opponent
17
More intriguing information
1. Labour Market Institutions and the Personal Distribution of Income in the OECD2. The name is absent
3. Word searches: on the use of verbal and non-verbal resources during classroom talk
4. The use of formal education in Denmark 1980-1992
5. AN ECONOMIC EVALUATION OF THE COLORADO RIVER BASIN SALINITY CONTROL PROGRAM
6. The name is absent
7. The name is absent
8. The name is absent
9. Neural Network Modelling of Constrained Spatial Interaction Flows
10. The name is absent