GOOGLE Interview Riddle - 31 Dominoes on a Chessboard | Tricky Google question

Google tricky interview riddle (A tricky google interview problem - Mutilated Chessboard):
#google #interview #puzzle
A standard 8x8 chessboard has two diagonally opposite corners removed, leaving 62 squares.
Is it possible to place 31 dominoes of size 2x1 so as to cover all of these 62 squares.
Please take a screenshot in your phone and share it on your whatsapp and other social accounts so that your friends and family also can enjoy this beautiful riddle.
Pause the video and think logically.
In the video, I have also explained how it can be related to Hamiltonian cycle.

It's an amazing Google interview riddle to challenge your intelligence.
So if you are looking for a job at Google, please study optimization based puzzles and logic puzzles in detail.

You can share puzzles and riddles with me on these links:

Give a try to these Google interview riddles and puzzles:
Google Interview Riddle - 3 Friends Bike and Walk || Logic and Math Puzzle

GOOGLE Interview Question || Puzzle : 12 Men On An Island || Hard Logic Puzzle

Amazon Interview Question - Coin on a Chess Board - Probability Puzzle

Also try these brilliant mind blowing puzzles:

5 Pirates PUZZLE (Version 2) | 100 Gold Coins 5 Pirates

Trains & Bird Puzzle || Challenge for Math and Aptitude lovers

Very Tricky Race Puzzle

[Quickeditor]

Golden rule(used to solve many tricky puzzles) : always try to break that problem into smallest form☺

[dhruval]

Nice video. I figured it out in minutes.

[mushfikaikfat]

This logic puzzle was a little bit tricky. You explained it very knowingly, that's why now we might be able to solve this easily 😉
Thanks for your elegant explanation 👍
Love from Bangladesh 🇧🇩 ♥️

[dimitristripakis]

I decided it is not possible, but not with an elegant proof like this, very nice, thanks!

[Medical_Facts-]

0:27 I was thinking my mobile is hacked by logical AMAR but then I realize .
👌👌👌👌👌Nice editing👌👌👌👌👌

[ralphschraven]

If you are familiar with the idea of invariants to solve these types of problems, the solution is mere seconds away.

One of the first things you notice is that every tile covers a black & white square. And this should immediately send off alarm bells if you know we just took an evenly checkered board and removed 2 of the same color from it. That's enough to prove: you can't cover the board with dominoes.

Invariants trump "simplify, solve, generalize" as this allows you to intuitively solve the problem without any further inquiry. The "400 page book" problem would be another good such example: you notice the two invariants and can immediately go about solving the problem. No further inductive proofs or other techniques required!

Cool stuff, keep them coming!

[PureInsanity]

Good job changing it from "to stay updated with a new logic every week" to "to stay updated with a new logic puzzle every week"

[AZ-dpmn]

Amazing videos. Just one question. Where do you get that interesting puzzles?

[emem]

So the answer is: yes, possible but only if we remove 2 opposite color squares, not 2 of same color. Easy, but somehow against the prerequisites... isn't it?

[serling]

That was a good one with the Dominos. 😎👍

[vcvartak]

Even if board of same color squares the same principal holds good. Since the remaining two squares are from different rows and column

[rameshkiran]

I have been fighting since yesterday for solution, I Ignored the possibility.. that answer can be just no.😆

[prasannamufc]

Since there doesn't seem to be a problem mutilating the chess board, let's go ahead and cut off the 1st file and add it vertically below the last file. Our aim is to fit 31 dominoes in 62 squares. Turn your problem into a solution. Voilà

[rahenson]

It would be sneaky for a company to remove opposite color squares on the chessboard to leave a solution to see if you really paid attention or just thought you’d seen the trick they were trying to test for.

[zukaka]

I solved differently. Since 31 is an odd number then if the number of horizontally placed dominoes are odd then the number of vertically placed ones must be even, and vice versa. Now if we rotate this mutilated chess board by 90 degrees and then mirror it we will end up with exactly same chess board, however odd and even numbers will change places because the rotation will turn horizontal ones into vertical and vice versa and mirroring will not change anything. So we will get that the number of horizontally placed dominoes must be even and odd at the same time, which is impossible. The same will be true with the vertical ones.

[mr.knight]

To,
Respected sir,
I like your way of explaining,
Sir, i need your help,
Sir in which software you make this animation and related stuff, please help me, please sir.

[xlerb]

Yes, assuming I can mutilate the dominoes as well as the chess board ;)

[AnthonyLauder]

My guess: every piece occupies two adjacent squares, and adjacent squares are never the same colour. So, there would need to be the same number of squares of each of the two colours, and there are not. So (hope I am not being foolish) there will be two non-adjacent squares, and one piece, left over at the end.

[aayushjariwala]

Me after wasting 10 min 😭 and Knowing solution in 10 second

[chess]

According to me vertical position setting on Elo Stockfish board