/

AMC12 2021 B

AMC12 2021 B · Q22

AMC12 2021 B · Q22. It mainly tests Casework, Games (basic).

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 有必胜策略?
stem
(A) (6,1,1) (6,1,1)
(B) (6,2,1) (6,2,1)
(C) (6,2,2) (6,2,2)
(D) (6,3,1) (6,3,1)
(E) (6,3,2) (6,3,2)
Answer
Correct choice: (E)
正确答案:(E)
Solution
We say that a game state is an N-position if it is winning for the next player (the player to move), and a P-position if it is winning for the other player. We are trying to find which of the given states is a P-position. First we note that symmetrical positions are P-positions, as the second player can win by mirroring the first player's moves. It follows that $(6, 1, 1)$ is an N-position, since we can win by moving to $(2, 2, 1, 1)$; this rules out $\textbf{(A)}$. We next look at $(6, 2, 1)$. The possible next states are \[(6, 2), (6, 1, 1), (6, 1), (5, 2, 1), (4, 2, 1, 1),(4, 2, 1), (3, 2, 2, 1), (3, 2, 1, 1), (2, 2, 2, 1).\] None of these are symmetrical, so we might reasonably suspect that they are all N-positions. Indeed, it just so happens that for all of these states except $(6, 2)$ and $(6, 1)$, we can win by moving to $(2, 2, 1, 1)$; it remains to check that $(6, 2)$ and $(6, 1)$ are N-positions. To save ourselves work, it would be nice if we could find a single P-position directly reachable from both $(6, 2)$ and $(6, 1)$. We notice that $(3, 2, 1)$ is directly reachable from both states, so it would suffice to show that $(3, 2, 1)$ is a P-position. Indeed, the possible next states are \[(3, 2), (3, 1, 1), (3, 1), (2, 2, 1), (2, 1, 1, 1), (2, 1, 1),\] which allow for the following refutations: \begin{align*} &(3, 2) \to (2, 2), && &&(3, 1, 1) \to (1, 1, 1, 1), && &&(3, 1) \to (1, 1), \\ &(2, 2, 1) \to (2, 2), && &&(2, 1, 1, 1) \to (1, 1, 1, 1), && &&(2, 1, 1) \to (1, 1). \end{align*} Hence, $(3, 2, 1)$ is a P-position, so $(6, 2)$ and $(6, 1)$ are both N-positions, along with all other possible next states from $(6, 2, 1)$ as noted before. Thus, $(6, 2, 1)$ is a P-position, so our answer is $\boxed{\textbf{(B)}}$. (For completeness, we could also rule out $\textbf{(C)}$, $\textbf{(D)}$ and $\textbf{(E)}$ as in Solution 2.)
我们说一个游戏状态是 N-位置,如果下一步玩家(当前轮到的玩家)能获胜,是 P-位置,如果另一个玩家能获胜。我们要找出给定的状态中哪个是 P-位置。 首先注意到对称位置是 P-位置,因为第二玩家可以通过镜像第一玩家的移动获胜。因此 $(6, 1, 1)$ 是 N-位置,因为可以移动到 $(2, 2, 1, 1)$ 获胜;这排除了 $\textbf{(A)}$。接下来看 $(6, 2, 1)$。可能的下一步状态是 \[(6, 2), (6, 1, 1), (6, 1), (5, 2, 1), (4, 2, 1, 1),(4, 2, 1), (3, 2, 2, 1), (3, 2, 1, 1), (2, 2, 2, 1).\] 这些都不是对称的,因此我们合理怀疑它们都是 N-位置。事实上,除了 $(6, 2)$ 和 $(6, 1)$ 外,所有这些状态都可以通过移动到 $(2, 2, 1, 1)$ 获胜;剩下检查 $(6, 2)$ 和 $(6, 1)$ 是 N-位置。 为了节省工作,如果能找到一个直接从 $(6, 2)$ 和 $(6, 1)$ 都能到达的单个 P-位置就好了。我们注意到 $(3, 2, 1)$ 可以直接从两个状态到达,因此只需证明 $(3, 2, 1)$ 是 P-位置即可。可能的下一步状态是 \[(3, 2), (3, 1, 1), (3, 1), (2, 2, 1), (2, 1, 1, 1), (2, 1, 1),\] 这些允许以下反驳: \begin{align*} &(3, 2) \to (2, 2), && &&(3, 1, 1) \to (1, 1, 1, 1), && &&(3, 1) \to (1, 1), \\ &(2, 2, 1) \to (2, 2), && &&(2, 1, 1, 1) \to (1, 1, 1, 1), && &&(2, 1, 1) \to (1, 1). \end{align*} 因此,$(3, 2, 1)$ 是 P-位置,所以 $(6, 2)$ 和 $(6, 1)$ 都是 N-位置,以及之前提到的从 $(6, 2, 1)$ 的所有其他可能下一步状态。因此,$(6, 2, 1)$ 是 P-位置,所以答案是 $\boxed{\textbf{(B)}}$。(完整起见,我们也可以如 Solution 2 排除 $\textbf{(C)}$、$\textbf{(D)}$ 和 $\textbf{(E)}$。)
Topics
Related Questions
Practice full AMC exams on amcdrill.
Try full-length practice and diagnostics at www.amcdrill.com.