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 indicatesher 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.

中文翻译：

---

分析Clobber的变体：San Jego游戏

San Jego是一款具有完善信息的两人游戏。它是Clobber（2001）和Cannibal Clobber游戏的变体。给定的是一块矩形板，其上有黑白棋子。彼此堆叠的多个零件称为塔。塔顶上的那一块表明她的主人。此举包括选择一个自己的塔并将其完全放置在相邻塔的顶部。如果两个玩家都不能移动，则游戏结束。赢家是最高塔的玩家。确定了圣杰戈州状态空间复杂度的上限。此外，游戏树的复杂性在理论和数值上都是近似的。对于较小的棋盘尺寸，将计算最佳博弈论值，并确定第一步的优势。