We place two dominoes on a 6 × 2 0 grid board in such way that the two dominoes do not intersect each other. How many ways can we do this?
D
e
t
a
i
l
s
a
n
d
a
s
s
u
m
p
t
i
o
n
s
A domino is a
1
×
2
(or
2
×
1
) rectangle that occupies two adjacent
1
×
1
squares.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
You forgot to subtract the cases where two horizontal dominoes overlap, and where two vertical dominoes overlap. This should give you a total of 22223.
Log in to reply
oh my god I can't believe I missed that!
two overlapping horizontal or vertical dominoes form a 1 × 3 or 3 × 1 rectangle and there are 6 ∗ 1 8 + 2 0 ∗ 4 = 1 8 8 of those so yes the answer should be 2 2 4 1 1 − 1 8 8 = 2 2 2 2 3 .
I knew there must be something wrong with my answer since it wasn't solved by anybody, yet I was too lazy to check my logic.
Thank you for pointing out my mistake Jon!
Log in to reply
I've updated the problem and correct answer to 22223. Can you update your solution accordingly?
The answer is 22223. :\
Problem Loading...
Note Loading...
Set Loading...
Plan for counting:
(1)We will first count the number of ways to place one domino on the board.
(2)Next, we choose two of those ways for two dominoes to occupy.
(3)Finally, we subtract out the unwanted cases.
(1) We can position the domino either vertically or horizontally. For each direction we can easily count the number of ways to be 2 0 ∗ 5 + 1 9 ∗ 6 = 2 1 4
(2) We choose 2 out of the 2 1 4 placements, this gives ( 2 2 1 4 ) = 2 2 7 9 1 ways to do that.
(3) Note that some of those ways violate our restriction that the two dominoes can't share any squares on the board. Since the 2 1 4 placements are all distinct, the two dominoes can only share one of their 1 × 1 square in order to form a violation. To count the number of violations,
Case 1: 2 horizontal dominoes
There are 6 × 1 8 = 1 0 8 such pairs
Case 2: 2 vertical dominoes
There are \( 20 \times 4 = 188 \( such pairs
Case 3: 1 vertical, 1 horizontal domino
We observe there are \(4\) in a 2 × 2 square. If we count the number of 2 × 2 squares in this 6 × 2 0 board and then multiply it by 4 , we will get all the violations without over and under counting. Note that each inner lattice point on the board represents the center point of a 2 × 2 square, therefore each point determine a square. Since there are 5 ∗ 1 9 inner lattice points, our desired number of violations is 4 ∗ 5 ∗ 1 9 = 3 8 0
This gives answer 2 2 7 9 1 − 1 0 8 − 8 0 − 3 8 0 = 2 2 2 2 3