Blocking Dominos

Discrete Mathematics Level 4

Diego wants to completely cover a \( 6 \times 6 \) board using 18 dominos. Find the smallest positive integer \(k\) which satisfies the following property:

It is possible for Diego to place \(k\) dominos, such that there is a unique way to completely cover the remaining squares.

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, conceptual quizzes.

Our wiki is made for math and science

Master advanced concepts through explanations, examples, and problems from the community.

Used and loved by 4 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.