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有必胜策略?