Difference between revisions of "2021 AMC 12B Problems/Problem 22"
(→Problem) |
Pi is 3.14 (talk | contribs) (→Solution) |
||
Line 8: | Line 8: | ||
<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> | ||
− | ==Solution== | + | == Video Solution by OmegaLearn (Game Theory) == |
− | + | https://youtu.be/zkSBMVAfYLo | |
+ | |||
+ | ~ pi_is_3.14 | ||
==See Also== | ==See Also== | ||
{{AMC12 box|year=2021|ab=B|num-b=21|num-a=23}} | {{AMC12 box|year=2021|ab=B|num-b=21|num-a=23}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 20:08, 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
See Also
2021 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 21 |
Followed by Problem 23 |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.