2021 AMC 10A Problem 23
Frieda the frog begins a sequence of hops on a grid of squares, moving one square on each hop and choosing at random the direction of each hop-up, down, left, or right. She does not hop diagonally. When the direction of a hop would take Frieda off the grid, she "wraps around" and jumps to the opposite edge. For example if Frieda begins in the center square and makes two hops "up", the first hop would place her in the top row middle square, and the second hop would cause Frieda to jump to the opposite edge, landing in the bottom row middle square. Suppose Frieda starts from the center square, makes at most four hops at random, and stops hopping if she lands on a corner square. What is the probability that she reaches a corner square on one of the four hops?
Show solution without answering
Key insight
Only three kinds of square matter: center, edge, corner. From an edge, half the hops reach a corner, a quarter return to center, a quarter wrap to an edge.
Solution
1. There are only three kinds of square: the center (call it ), the four edge-middle squares (), and the four corners (). All edge squares behave the same way, so we only need to track which kind of square Frieda is on.
2. Work out the hops from each kind:
- From , every hop lands on an edge square.
- From an edge square, say the top middle: left and right reach corners, down goes to the center, and up wraps around to the bottom middle, another edge square. So from : corner with probability , center with , edge with .
3. Now follow the probabilities hop by hop. The columns for and are the chances she is still hopping and standing there.
| after hop | at | at | reaches a corner on this hop |
|---|---|---|---|
How hop works: the at all moves to . The at splits: half of it () reaches a corner, a quarter of it () goes to , and a quarter () stays on an edge.
On hop , the at cannot reach a corner, and half of the at does.
4. Add the chances of reaching a corner:
The answer is .
Why this works
On a symmetric board, squares of the same kind behave the same, so a random walk shrinks to a few "states". Writing one rule per state and following the chances for four hops is much faster and safer than listing all hop sequences.
Alternative approach
Find the chance she never reaches a corner and subtract from . After hop she is still hopping only if she was at after hop (chance ), or at after hop and then missed (chance ). That is , so the answer is .
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
By symmetry only the type of square matters: center (), edge-middle (), or corner ().
From , all four hops land on an . From an (say the top middle): the two sideways hops reach corners, hopping inward returns to , and hopping outward wraps to the bottom middle, another . So from : with probability , with , with .
Track the probability of being unstopped after each hop.
- After hop 1: with probability .
- After hop 2: with , with (corner reached with ).
- After hop 3: from () we go to ; from () we go to with or with . So : , : .
- After hop 4: no corner from ; from () she fails to reach a corner with probability .
Probability of never reaching a corner:
So the probability of success is .
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 8: Basic Probability Techniques (§8.5)
- Intermediate Counting & Probability, Chapter 13: Events With States (§13.4)
- Intermediate Counting & Probability, Chapter 10: Recursion
- Introduction to Counting & Probability, Chapter 2: Basic Counting Techniques (§2.3)
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.