Arjun and Beth play a game in which they take turns removing one brick or two adjacent bricks from one "wall" among a set of several walls of bricks, with gaps possibly creating new walls. The walls are one brick tall. For example, a set of walls of sizes $4$ and $2$ can be changed into any of the following by one move: $(3,2),(2,1,2),(4),(4,1),(2,2),$ or $(1,1,2).$
Arjun plays first, and the player who removes the last brick wins. For which starting configuration is there a strategy that guarantees a win for Beth?
Arjun 和 Beth 玩一个游戏,他们轮流从一组砖墙中移除一块砖或两块相邻的砖,移除来自同一“墙”,间隙可能创建新墙。墙高为一砖。例如,大小为 $4$ 和 $2$ 的墙组可以通过一步移动变为以下之一:$(3,2),(2,1,2),(4),(4,1),(2,2)$ 或 $(1,1,2)$。
Arjun 先手,取走最后一块砖的玩家获胜。对于以下哪种起始配置,Beth 有必胜策略?