# Difference between revisions of "2021 AMC 10B Problems/Problem 24"

Pi is 3.14 (talk | contribs) (→Problem) |
(→Problem) |
||

Line 73: | Line 73: | ||

<math>\textbf{(A)} ~(6, 1, 1) \qquad\textbf{(B)} ~(6, 2, 1) \qquad\textbf{(C)} ~(6, 2, 2) \qquad\textbf{(D)} ~(6, 3, 1) \qquad\textbf{(E)} ~(6, 3, 2)</math> | <math>\textbf{(A)} ~(6, 1, 1) \qquad\textbf{(B)} ~(6, 2, 1) \qquad\textbf{(C)} ~(6, 2, 2) \qquad\textbf{(D)} ~(6, 3, 1) \qquad\textbf{(E)} ~(6, 3, 2)</math> | ||

− | |||

− | |||

== Video Solution by OmegaLearn (Game Theory) == | == Video Solution by OmegaLearn (Game Theory) == |

## Revision as of 21:48, 11 February 2021

## Problem

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 and can be changed into any of the following by one move: or . 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?

## Video Solution by OmegaLearn (Game Theory)

~ pi_is_3.14