Election Games (1/4)

SIERPINSKI ELECTION

On each move fill a cell or cells with your symbol. The number of stones dropped follows a 121 cycle (ie, one stone, then two stones, then one stone, and so on). In short, we say it uses a (121)* progressive mutator.

Two friendly cells in a small triangle win that triangle for the player.
Two won small triangles in the same large triangle win that for the player.
Two won large triangles for a player win the game.

The notation is, top-triangle = 1; bottom-left = 2; bottom-right = 3;
and largest triangle = 1st co-ordinate down to smallest = 3rd co-ordinate.

Game example:
      J's      B's
1. 111       222 333
2. 213       311
3. 123 231   221
4. 312       211 233
5. 313       212
6. 323 121   131
7. resign

             j
            . .
                            
          j     b
         . j   . .
        ___________          
      b \         / b
     b j \       / j j    
          \     /  
   b     j \   / .     .
  b .   . b \ / . j   . b
            
The name is due to the way committee membership can be fiddled so that a strategically-placed minority can still win an election! The idea and these games by Bill Taylor.

This election principle can be extended to more games (check next posts).