Search

San Jego is a two-player game with perfect information. It is a variation of the games Clobber (2001) and Cannibal Clobber. Given is a rectangular board with black and white pieces on the cells. Multiple pieces which are stacked on each other are called towers. The piece on top of a tower indicates her owner. A move consists of picking an own tower and placing it completely on top of an adjacent tower. If both players can not move anymore, the game ends. Winner is the player with the highest tower. An upper bound for the state-space complexity of San Jego is determined. Furthermore, the game-tree complexity is approximated theoretically and numerically. For small board sizes, the optimal game-theoretic values are calculated and the advantage of the first move is determined. [ABSTRACT FROM AUTHOR]

The article discusses the random-turn hex game, which involves two players who take turns placing stones of their respective colors on the hexagons of a rhombus-shaped hexagonal grid. It requires the players to toss a coin before each turn to decide who gets to place the next stone rather than alternating turns. Its optimal strategy is very simple and a player wins by completing a path connecting the two opposite sides of his or her color. Details about the description of random-turn selection games are provided.

The article discusses the Capture and Take away games, which require problem-solving strategies. In the Capture game, the first player moves from the single position at the top of the board to one of the positions in the top row. The two players move in horizontal and vertical patterns or to the top position. There are 9 markers placed in a line or a circle in the Take away game. A player may take away one or two markers next to each other and the player to take away the last marker wins.