Item: tModelOtherRecursive3b

Stem:

Dominoes are rectangular-shaped tiles. Each tile is divided by a line across the center that separates the piece into two ends. Each end may have between 0 and 6 dots (an end with 0 dots appears blank). You can arrange dominoes in a chain by matching the number of dots on the ends where they touch.

Anthony has a set of dominoes. He removes all of the dominoes that have an end with no dots (blanks) on them. He selects four dominoes from the remaining pile and arranges them end to end, as shown in the figure below.

Moving from left to right, the sequence that corresponds to the above figure is:

4, 2, 2, 1, 1, 6, 6, 6

Which of the following sequences might represent a different set of 5 dominoes, arranged end to end?

Options:

  1. 2, 4, 4, 1, 1, 3, 3, 5

  2. 1, 6, 6, 3, 3, 4, 4, 6, 1, 2

  3. 3, 3, 3, 6, 6, 6, 6, 5, 5, 5

  4. 3, 5, 5, 6, 4, 2, 2, 1, 1, 6

  5. 6, 3, 3, 5, 5, 6, 6, 6

Key:

Metadata:

Item Node: tModelOtherRecursive3b, Difficulty: 3.
Proficiencies: ModelOtherRecursive.