Help for the Game of Che


Welcome to the network Che server. The challenge command is described here. Other commands are the same as for all pbmserv games.

  che challenge [-num_tiles=n] userid1 userid2

Starts a new game for two players.

The -num_tiles option specifies the number of tiles to play with (default is 48). Set to -1 or 999 for an unlimited tile supply.

Introduction

Che is a boardless tile placement game in which players strive to form closed regions with Truchet tiles.

Rules

Two players, Light and Dark, share a common pool of duotone Truchet tiles. Each tile has inverted colours on the front and back and may be played oriented either left or right.

       +---|---+   +---|---+
       |    \..|   |../    |
 Front __    \__   __/    __  (Light dominant)
       |.\     |   |     /.|
       |..\    |   |    /..|
       +---|---+   +---|---+ 


       +---|---+   +---|---+
       |....\  |   |  /....|
 Back  __....\__   __/....__  (Dark dominant)
       | \.....|   |...../ |
       |  \....|   |..../  | 
       +---|---+   +---|---+ 
 
         Left        Right 

Play: Light places a tile of their choice on the playing area. Players then take turns placing two tiles of their choice squarely adjacent to at least one existing tile such that all neighbouring edge colours match (the two tiles being placed to not need to be adjacent themselves).

Aim: A player wins by completing a closed region of their colour, which may be any size or shape. If a move achieves this for both players then the mover loses.

 +---|---+---|---+
 |../         \..|
 __/    ___    \__
 |     /...\     |
 |    /.....\    |
 +   |...+...|   +   Dark wins this game
 |    \...../    |
 __    \___/    __
 |.\           /.|
 |..\         /..|
 +---|---+---|---+ 

If the tiles run out before either player wins, then the owner of the largest region wins. A region's size is given by the number of dominant tiles that it contains. For example, Light has the largest region (size 5) in the following game; Light would win this game if the tiles ran out at this point.

         +---|---+                
         |../    |        
         __/    __            
         |     /.|      
         |    /..|     
 +---|---+   (...+               +---|---+---|---+ 
 |....\       \..|               |....\       \..| 
 __....\___    \_|               __....\___    \__
 | \.......\     |               | \.......\     |
 |  \.......\    |               |  \.......\    |
 +---|---+...\   +---|---+---|---+   \...+...\   +
         |....\       \...../         \.......\  |
         __....\___    \___/    ____   \___....\__ 
         | \.......\           /....\      \.....|
         |  \.......\         /......\      \....|
         +---|---+---|---+---|---+---|---+---|---+

Notes

It is generally better to play tiles of the opponent's dominant colour each turn.

Syntax

che move <game#> <userid> <passwd> d3            Play tile 'd' at position 3.
che move <game#> <userid> <passwd> d3,a2      Play tile 'd' at position 3 and tile 'a' at position 2.
[[che move <game#> <userid> <passwd> 6-c10  Move the tile numbered 6 and play it as tile 'c' at position 10.]]

Test Options

-tie_none           If no region is closed when the tiles run out, then the game is tied (default off).
-tie_move
           If no region is closed when the tiles run out, then a tile is moved each turn (default off).
-tie_largest_wins    If no region is closed when the tiles run out, then the owner of the largest group wins (default on).
-tie_largest_loses   If no region is closed when the tiles run out, then the owner of the largest group loses (default off).
-num_free        Sets the minimum number of free sides that a tile must have to be moved (default 1).
-free_corner     Specifies that only tiles with a free corner can be moved (default off).
-placements=p
   Place p tiles per turn (default 2).
-single
               Only one tile may be played per turn (default off).
-pairs                 Two tiles must be played per placement turn, except for the opening move (default on).
-triples
            Three tiles must be played per placement turn, except for the first two moves (default off).
-adjacent           Multiple tile placements must be adjacent to each other (default off).
-nonadjacent     Multiple tile placements need not be adjacent to each other (default on).
-move_anytime   Players may move a tile in lieu of placing tiles on their turn (default off).
-no_move_anytime
  Players may not move tiles before the tile pool runs out (default on).

If multiple tile placements are specified then 1 tile is played on the first move, 2 on the second move, etc. until the number of placements is reached.

If tile movement is allowed then the player may pick up an existing tile and place it elsewhere, provided that:
1) it was not placed or moved on the last turn, and
2) its removal would not disconnect the main group into two or more subgroups.

New Rules

The following options trigger new rules that improve the game:
-group_area=n
-group_extent=n   

The group_area option inverts the winning condition so that the aim is to surround an enemy group, but a player loses if any friendly group reaches n tiles in area (counting dominant tiles). A player loses if their move achieves a win for both players.

The group_extent option triggers similar rules except that a player loses if any friendly group reaches n tiles in extent either horizontally or vertically (counting dominant tiles).

Recommended sizes are -group_area=16 and -group_extent=6.

History

Che rules copyright Cameron Browne © 2008.

The name “Che” is derived from the letters TRUCHET.

More details are available at the official Che page.

Implementation and Help file by Cameron Browne, March 2008.