论文标题
一种实用的方法，可防止在终极的TIC-TAC-TOE中获胜
A Practical Method for Preventing Forced Wins in Ultimate Tic-Tac-Toe
论文作者
论文摘要
Ultimate Tic-Tac-toe是流行的TIC-TAC-TOE游戏的变体。两名球员竞争赢得了三个结盟的“田野”，每个场地都构成了自己的微型TIC-TAC-TOE游戏。每个举措都决定了下一个球员必须参加的领域。先前的研究表明，对于第一个球员来说，存在强迫赢得策略，从而可以至少29个动作和最多43次动作获胜。本文提出了一个实用的解决方案，以解决Bertholon等人发现的强制胜利问题，提出了一种简单的方法，以随机化播放的第一组动作。该方法使用5个随机生成的数字在0到8之间，以任意放置游戏的前4个动作，并帮助玩家避免强迫获胜而无需更改游戏的其他规则。本文还调查了前4个动作随机放置将导致易于计算的强迫获胜的概率，并表明这种概率精确是56/59049，即0.0948％。
Ultimate Tic-Tac-Toe is a variant of the popular Tic-Tac-Toe game. Two players compete to win three aligned "fields," with each field constituting its own miniature tic-tac-toe game. Each move determines which field the next player must play in. Prior studies have shown that there exists a forced winning strategy for the first player, whereby they can win in at least 29 moves and at most 43 moves. This paper proposes a practical solution to the forced-win problem discovered by Bertholon et al., by putting forth a simple method for randomizing the first set of moves that are played. This method uses 5 randomly generated digits between 0 and 8 to arbitrarily place the first 4 moves of the game, and helps players avoid forced wins without having to change other rules of the game. This paper also investigates the probability that a random placement of the first 4 moves will lead to an easily calculable forced win, and shows that this probability is precisely 56/59049, or 0.0948%.
