1997-1-30 last update, 1997-1-30 first day
Robert Jasiek, jasiek@snafu.de

Primitive Rules

Introduction

Primitive go rules were presumably first invented in the 1970ies by game theorists. Several versions exist. This version of the author was written down 1997-1-30 and is based on graph theory.

Instead of determining the winner by scoring primitive rules let the first player without an available move lose the game. Such rules omit passes. Games tend to be very long and are so called pass fights. Their final stage consists of suicides respectively attempts to prohibit those of the opponent. They are important in mathematics.

Rules

1. The two colour game is played on a finite graph.
2. Play is alternate colouring of a non-coloured node with black respectively white.
3. A play of a colour causes loss of the other colour of all nodes without a path along the other colour to no colour and subsequently causes a loss of the colour of all nodes without a path along the colour to no colour.
4. No colouring after a play and its caused losses may be recreated.
5. The first colour without a possible play loses.