Setup and opening position
Twelve cells contain the digits 0 through 2. Every orthogonally adjacent pair is a candidate domino edge, and the seeded board is a relabelled or reflected form of a solver-proven unique layout.
Choose six candidate edges that cover all twelve cells and use every unordered digit pair once.
Your unfinished game is saved only in this browser.
Choose six candidate edges that cover all twelve cells and use every unordered digit pair once.
Complete guide
Dominosa is a complete browser implementation with its own versioned rules profile. Partition a 4×3 number grid into the six distinct domino pairs made from 0, 1, and 2.
Twelve cells contain the digits 0 through 2. Every orthogonally adjacent pair is a candidate domino edge, and the seeded board is a relabelled or reflected form of a solver-proven unique layout.
Select non-overlapping adjacent cell pairs so every cell belongs to exactly one domino. The unordered pairs 0-0, 0-1, 0-2, 1-1, 1-2, and 2-2 must each appear exactly once.
Choose six candidate edges that cover all twelve cells and use every unordered digit pair once. Audit both constraints independently—six non-overlapping dominoes and six different pair types—because satisfying one does not guarantee the other.
Mark any candidate whose digit pair has only one remaining location, then remove all other candidates touching either of its cells. Pair order is irrelevant: 0-2 and 2-0 are the same domino type and cannot both be selected.
Choose six candidate edges that cover all twelve cells and use every unordered digit pair once.
Select non-overlapping adjacent cell pairs so every cell belongs to exactly one domino. The unordered pairs 0-0, 0-1, 0-2, 1-1, 1-2, and 2-2 must each appear exactly once.
Mark any candidate whose digit pair has only one remaining location, then remove all other candidates touching either of its cells.