Beatrix places dominoes on a 5×5 board, either horizontally or vertically, so that each domino covers two small squares. She stops when she cannot place another domino, as in the example shown in the diagram. When Beatrix stops, what is the largest possible number of squares that may still be uncovered?
Select one option, then click Submit.
4
5
6
7
8
Select an option, then submit.
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
Junior Mathematical Challenge (2016)
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →Junior Mathematical Challenge (2016)