Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Show that by removing two white squares and two black squares from 8 X 8 checkerboard (colored as in the text) you can make it impossible to tile the remaining squares using dominoes.

Short Answer

Expert verified

It is not possible to use dominoes to tile a 8 X 8 checkerboard when two black squares and two white squares are removed.

Step by step solution

01

To prove

When two black squares and two white squares are removed from a 8 X 8 checkerboard, it is impossible to tile the remaining squares using dominoes.

02

Proof

Rotate the 8 X 8 checkerboard such that a black square is in the upper left corner.

Then, remove the two squares adjacent to the upper left corner and remove the two black squares adjacent to the upper right corner.

Now, it is impossible to tile the 8 X 9 checkerboard because we cannot tile the

Upper right corner nor the upper left corner.

Thus, it is not possible to use dominoes to tile a 8 X 8 checkerboard when two black squares and two white squares are removed.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Construct a truth table for((pโ†’q)โ†’r)โ†’s

Construct a combinatorial circuit using inverters, OR gates, and AND gates that produces the outputยฌpโˆจยฌrโˆงยฌqโˆจยฌpโˆงqโˆจr from input bits p,qand r

An explorer is captured by a group of cannibals. There aretwo types of cannibals-those who always tell the truthand those who always lie. The cannibals will barbecuethe explorer unless he can determine whether a particular cannibal always lies or always tells the truth. He isallowed to ask the cannibal exactly one question.
a) Explain why the question "Are you a liar?" does notwork.
b) Find a question that the explorer can use to determinewhether the cannibal always lies or always tells thetruth.

What is the value of x after each of these statements is encountered in a computer program, if x = 1 before the statement is reached?

a) if x+2=3then x=x+1
b) if (x+1=3)OR (2x+2=3)then x=x+1
c) if (2x+3=5)AND (3x+4=7)then x=x+1
d) if (x+1=2)XOR (x+2=3)then x=x+1
e) if x < 2 thenx=x+1

A says โ€œWe are both knavesโ€ and B says nothing. Exercises 24โ€“31 relate to inhabitants of an island on which there are three kinds of people: knights who always tell the truth, knaves who always lie, and spies (called normals by Smullyan [Sm78]) who can either lie or tell the truth. You encounter three people, A, B, and C. You know one of these people is a knight, one is a knave, and one is a spy. Each of the three people knows the type of person each of other two is. For each of these situations, if possible, determine whether there is a unique solution and determine who the knave, knight, and spy are. When there is no unique solution, list all possible solutions or state that there are no solutions.

A says โ€œI am the knave,โ€ B says โ€œI am the knave,โ€ and C says โ€œI am the knave.โ€

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free