Search in Co-Wiki

Col (game)

game-theory 640 tokens 5 outbound links

Col (game)

Example game In the following game, the first of the two players is using red, and the second is using blue. The last move in each image is shown brighter than the other areas.

The first player may colour any of the areas to begin. However, the region around the outside of the graph is not included as an area for this game.

The second player now colours a white cell. As no areas are currently blue, any white cell is allowed.

At this point, the requirement that the graph be proper comes into effect, as a red area must be made which does not touch the existing one:

Note that areas only count as touching if they share edges, not if they only share vertices, so this move is legal.

The game continues, players moving alternately, until one player cannot make a move. This player loses. A possible continuation of the game is as follows (with each move numbered for clarity):

In this outcome, the blue player has lost.

Snort Snort, invented by Simon P. Norton, uses a similar partisan assignment of two colors, but with the anticlassical constraint: neighboring regions are not allowed to be given different colors. Coloring the regions is explained as assigning fields to bulls and cows, where neighboring fields may not contain cattle of the opposite sex, lest they be distracted from their grazing.

Deciding the outcome in Snort is PSPACE-complete on general graphs. This is proven by reducing partizan node Kayles, which is PSPACE-complete, to a game of Snort.

Analysis The value of a Col position is always either a number or a number plus star This makes the game relatively simple compared with Snort, which features a much greater variety of values.

References * Revised and reprinted as * * Revised and reprinted as *

External links *[Col and Snort games on Google Play

[[Category:Paper-and-pencil games](https://play.google.com/store/apps/details?id=su.smartkids.games.col])]