2021 AMC 10 A Problem 23
One Page to Learn. One Point to Earn.
In This Page:
To help you master 2021 AMC 10 A Problem 23, this page includes:
- The original AMC problem to try, plus the correct answer
- Clear, step-by-step solutions using different methods
- Key ideas, useful formulas, and takeaways you can apply to similar problems
- Related problems from past AMC exams, plus new practice problems that build the same skills
Want more practice? Scroll down to download Think Academy’s AMC 10 practice packs and keep building your AMC 10 A skills.
2021 AMC10 A Problem 23
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?
Solution
State-by-State Probability Method
Group the squares by their structural type (Center, Edge, Corner) to simplify the grid. Calculate the probability of being in each type of square after each hop, keeping in mind that the Corner is a stopping point.
When locations on a grid have identical properties (like the 4 edges on a wrap-around board), you can group them into a single ‘state’ to drastically reduce the number of paths you need to track.
Step 1: Define the states and transition probabilities
Group the 9 squares into 3 types: Center (1 square), Edge (4 squares), and Corner (4 squares). From the Center square, all 4 directions lead to an Edge square, so the probability of moving from Center to Edge is 1. From an Edge square (for example, the top-middle square), the 4 directions lead to: – Down: Center square (1 choice) – Up: Wraps around to the bottom-middle square, which is another Edge square (1 choice) – Left and Right: Corner squares (2 choices) Thus, from an Edge, the probabilities are to Center, to Edge, and to Corner. From a Corner square, Frieda stops, so we just accumulate the probability of being there.
Step 2: Track probabilities for Hops 1 and 2
Frieda starts at the Center (Hop 0). For Hop 1, she must move to an Edge. For Hop 2, she distributes her probability from the Edge according to the rules established above.
Step 3: Track probabilities for Hop 3
Calculate the new probabilities by analyzing where she was at Hop 2. The probability of being at an Edge comes from both the previous Center state (all of it moves to Edge) and the previous Edge state (one-quarter of it stays on an Edge).
Step 4: Track probabilities for Hop 4
We only need to find the probability that she has reached a Corner by the 4th hop. This includes the accumulated probability that she was already at a Corner after Hop 3, plus the new chance she just arrived from an Edge.
The probability is , which corresponds to choice D. We can verify the sum of probabilities at Hop 3: , confirming no probability was lost.
Complementary Path Counting Method
Instead of tracking fractions, count the number of 4-hop paths that NEVER visit a corner. Subtract this from the total possible paths to find the probability of reaching a corner.
Complementary Probability: . This is particularly powerful when the ‘Not Event’ (never hitting a corner) entirely avoids the absorbing state, keeping the number of choices consistent at every step.
Step 1: Reframe the problem using the complement
Instead of stopping at a corner, imagine Frieda always makes exactly 4 hops. Since she has 4 choices for each hop, there are total possible sequences. The event ‘reaches a corner and stops’ is the exact complement of ‘makes 4 hops and NEVER touches a corner’. We will count the paths that strictly visit Center and Edge squares.
Step 2: Establish the path transitions
Let and be the number of valid paths (avoiding corners) ending at a Center or Edge square after hops. From a Center square, all 4 choices go to an Edge, creating 4 paths. From an Edge square, exactly 1 choice goes to a Center, and exactly 1 choice goes to an Edge. (The other 2 choices go to a Corner, which we discard).
Step 3: Count valid paths for Hops 1 and 2
We start with 1 path at the Center at Hop 0. We update the counts using the transition rules.
Step 4: Count valid paths for Hops 3 and 4
We continue applying the transition rules for the 3rd and 4th hops.
Step 5: Calculate the final probability
Sum the valid paths ending at either safe square after 4 hops, divide by the total possible paths, and find the complement probability.
The probability of reaching a corner is , matching choice D. Counting paths with integers avoids fractional arithmetic errors, providing a solid verification of our previous method.
Similar Problems in Real Exams
The following five AMC 10 A problems are closely related to AMC 10 A 2021 Question 23. These real AMC 10 A problems test the same key concept—Probability. Click any problem to learn and practice, then continue to the adapted practice section later in this article for more problems to try.
2024 AMC 10 A Problem 24
2023 AMC 10 A Problem 7
2020 AMC 10 A Problem 13
2025 AMC 10 A Problem 14
2025 AMC 10 A Problem 16
Adapted Problems to Practice
What Formulas Do You Need for This Problem?
- State Grouping in Symmetric Grids:
When multiple positions on a board have identical transition rules, group them into a single 'state' rather than tracking them individually.
Requires structural symmetry, such as the wrap-around topology of a torus where all edges and all corners behave identically. By recognizing that all 4 Edge squares have the same probabilities of reaching a Corner or Center, we reduce a 9-square grid into a simple 3-state system.
- Complementary Probability:
P() is the probability of the target outcome occurring. P() is the probability of it failing to occur. Because the frog stops when she reaches a corner, calculating the probability of reaching a corner in at most 4 steps is exactly the same as 1 minus the probability of surviving 4 steps without ever touching a corner.
- Absorbing States and Path Counting:
To find the probability of eventually hitting an absorbing state (a state you cannot leave), you can pretend the process never stops and count the number of paths of length that completely avoid the absorbing state.
Applies when all outward choices from non-absorbing states have equal probability. Counting the whole-number paths that stay strictly in the Center and Edge squares is mathematically equivalent to the fractional probability calculation, but it is often less prone to arithmetic mistakes.
Key Takeaway: Remember This Strategy for Next Time
A grid with symmetry or wrap-around rules (like a torus).
Try: Try grouping the squares by their type (Center, Edge, Corner) instead of tracking individual coordinate positions.
Why: Symmetry guarantees that all squares in a specific group will have identical transition probabilities, drastically simplifying your calculations.
A problem asking for the probability of reaching a goal 'within steps' and stopping.
Try: Use complementary counting: find the probability of making exactly steps without ever touching the goal, and subtract from 1.
Why: Avoiding the goal completely creates a clean, predictable set of paths that don't terminate early, which is often much easier to count than tracking when and where the goal is hit.
A multi-stage probability problem with equal branch probabilities at each non-terminal step.
Try: Count the number of valid paths using whole numbers and divide by the total possible unrestricted paths at the very end.
Why: Whole-number path counting prevents the headache of adding and multiplying different fractions at every stage.
Unlock More Targeted AMC 10 Practice Resource
Build Stronger Skills. Practice with Purpose. Prepare with Confidence.
Get a complete set of module-focused AMC 10 practice workbooks designed to help students strengthen core concepts, improve problem-solving strategies, and feel more confident on test day.
With 250+ practice problems organized across six essential AMC 10 modules, students can focus on one skill area at a time and learn from clear, step-by-step solutions.

Download the Free AMC 10 Practice Resource Pack
Inside, You’ll Find:
- 6 module-focused practice workbooks: Algebra, Geometry, Number Theory, Combinatorics, and Probability & Statistics.
- 250+ AMC 10-style practice problems covering essential concepts and common competition question types.
- Complete answer keys and step-by-step solutions to help students understand the reasoning behind each answer.
- Organized, print-ready materials for independent study, guided practice, or extra preparation at home.
Get Instant Access: Fill out the form below to receive our exclusive resource pack.
*Please enter a valid email address to access the materials and receive future prep updates.
About Think Academy
Think Academy US Online, part of TAL Education Group (NYSE: TAL), provides structured math and ELA programs that help students build strong academic foundations and grow with confidence. With expert teachers, proven methods, and innovative AI tools, we nurture learning ability, curiosity, and healthy study habits that support long-term growth and a lifelong love of learning.
Check our programs:
- Think Kids: Ages 3-5
- Math
- Lower Elementary Math — Grades 1–2
- Upper Elementary Math — Grades 3–5
- Middle School Math — Grade 6–8
- High School Math — Grade 9-12
- ELA
- Elementary ELA — Grades 2–5
Want more insights on Math & ELA learning and parenting? Fill out the form on this page and subscribe to our newsletter for weekly tips and the latest resources. Join 100,000+ families in our Parent Community!














