Dominoes are said to be arranged correctly if, for each pair of adjacent dominoes, the numbers of spots on the adjacent ends are equal. Paul laid six dominoes in a line as shown in the diagram.
He can make a move either by swapping the position of any two dominoes (without rotating either domino) or by rotating one domino.
What is the smallest number of moves he needs to make to arrange all the dominoes correctly?
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.
Grey Kangaroo 2018 (2018)
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 →Grey Kangaroo 2018 (2018)