Difference between revisions of "1992 AIME Problems/Problem 12"

m (See also: box)
Line 10: Line 10:
== See also ==
== See also ==
* [[1992 AIME Problems/Problem 11 | Previous Problem]]
{{AIME box|year=1992|num-b=11|num-a=13}}
* [[1992 AIME Problems/Problem 13 | Next Problem]]
* [[1992 AIME Problems]]

Revision as of 16:02, 11 March 2007


In a game of Chomp, two players alternately take bites from a 5-by-7 grid of unit squares. To take a bite, a player chooses one of the remaining squares, then removes ("eats") all squares in the quadrant defined by the left edge (extended upward) and the lower edge (extended rightward) of the chosen square. For example, the bite determined by the shaded square in the diagram would remove the shaded square and the four squares marked by $\times.$ (The squares with two or more dotted edges have been removed form the original board in previous moves.)

AIME 1992 Problem 12.png

The object of the game is to make one's opponent take the last bite. The diagram shows one of the many subsets of the set of 35 unit squares that can occur during the game of Chomp. How many different subsets are there in all? Include the full board and empty board in your count.


This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

1992 AIME (ProblemsAnswer KeyResources)
Preceded by
Problem 11
Followed by
Problem 13
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
All AIME Problems and Solutions
Invalid username
Login to AoPS