Pattern Anatomy

Each pattern, deconstructed.

small-domain-constrained-search

"선택지가 적을 때 — 그냥 다 시도해보세요"

★ Rank 1/25 22.8% of all AMC problems Grade 2–4 ★★★★★

A finite (often very small) set of candidates is tested against one or more constraints. The natural strategy is to enumerate the candidates — frequently the multiple-choice list itself — and check each against the constraints using guess-and-check or systematic listing.

5개 답안 중 하나 찍기 전에, 3-4번만 case 따져도 충분.

Drill 1020 variants available
Try a sample now
Sample problem
no figure
amc8-2024-4
Try it →
27-year frequency
1999–2026 ↓ 40%
2026 forecast slots
#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
Champion: [email protected]

How to solve

Primary tools organizetry-it
What to look for
  • Replace the 1-9 sum with 1-N and seek a different perfect square / triangular number
  • Swap two standard dice for one die plus a spinner (1-4) to change the candidate pool
  • Increase candidate_set_size modestly so brute enumeration still works but is less trivial

Sub-archetype mix (5)

Click a row to see member problems.

More data (year-over-year, tool fingerprint, grade distribution, all members)
695
members
1999–2026
Active years
Year-over-year

Tool fingerprint (1–17)

Grade distribution

  • K
    1
  • Gr 1
    4
  • Gr 2
    8
  • Gr 3
    15
  • Gr 4
    72
  • Gr 5
    20
  • Gr 6
    134
  • Gr 7
    84
  • Gr 8
    70