Domino Hunt

From WPC unofficial wiki
Jump to navigation Jump to search

Rules[edit]

Domino Hunt Example.png Domino Hunt Example Solution.png

Divide the grid into a given set of dominoes. Each domino should be used exactly once. The orientation of the letters does not matter. Empty cells are not part of a domino.

(Rules and example (using full set from 0-0 to 3-3) from PGP IB)

Rule variations[edit]

  • Oriented Dominoes: Present in WPC 2000. Numbers are represented by dots as in classic domino. Orientation of the dots mhas to be taken into account.
  • In WPC 2012/Round 1, some numbers were blanked out and solvers had to reconstruct these numbers too.

History of the puzzle[edit]

The puzzle was patented in 1893 by Richard Osa (Germany), under the name "Dominosa Omnibus".[1]

Variants[edit]

Condensed Domino[edit]

Condensed Domino Example.png Condensed Domino Example Solution.png

First appeared on WPC 2018/Round 5. The puzzle was by František Luskač (Czech Rep).

Divide the grid into triminoes where each trimino represents two overlapping domino tiles. The whole set of domino tiles from the given set has to be used.

(Rules and example (1-1 to 4-4) from WPC 2018 IB)

Appearances in the past WPCs[edit]

References[edit]