Feedback | Home

MIT Mystery Hunt Puzzle Index: Keyword Data

domino puzzle

A grid is given with numbers 0 to N in every cell, and dashed borders. Divide the grid into 2-cell regions so that each possible domino (0-0, 0-1, ..., N-N) appears exactly once (i.e., a complete set of dominoes).

Also called: Domino Division, Dominosa, Domino Search, Solitaire Dominoes

Puzzles

MIT Mystery Hunt 1996 10B
MIT Mystery Hunt 2005 Simple Unassuming Logic Puzzles

Categories

Games
Puzzle Types

Home