# 21.pdf - CMPSCI 250 Introduction to Computation Lecture#21...

• Test Prep
• 27
• 100% (1) 1 out of 1 people found this document helpful

This preview shows pages 1–10. Sign up to view the full content.

CMPSCI 250: Introduction to Computation Lecture #21: Induction for Problem Solving David Mix Barrington 23 October 2017

This preview has intentionally blurred sections. Sign up to view the full version.

Induction for Problem Solving The L-Shaped Tile Problem Recursively Tiling a Chessboard Cutting Pizzas The Pizza-Cutting Theorem Cutting a Block of Cheese With a Katana The Speed of the Euclidean Algorithm
Polyominoes Samuel Golomb initiated the study of generalized dominos called polyominos . An ordinary domino is made from two connected squares, and there is basically only one way to do it. A tromino is made from three connected squares, and there are two different ones, I-shaped and L- shaped.

This preview has intentionally blurred sections. Sign up to view the full version.

More Polyominoes There are five kinds of tetrominos and twelve kinds of pentominos (six of which are shown twice below, in two reflective forms).
The L-Shaped Tile Problem Golomb posed the question of what kinds of figures can be tiled by various kinds of polyominos. In particular, can an 8 × 8 chessboard be tiled by L-shaped trominos? (No, because 64 % 3 0.) What about an 8 × 8 board with one square missing ?

This preview has intentionally blurred sections. Sign up to view the full version.

Recursively Tiling a Chessboard In the figure below, an 8 × 8 board with one (black) square missing has been tiled by 21 L-shaped trominos. How did we do it, and can we always do it? We do it with a recursive algorithm that provides an inductive proof that any 2 n × 2 n board, with any one square missing, can be tiled . (The bold-faced statement will be the P(n) of our inductive proof.)
The Recursive Tiling The base case of P(0) says that any 1 × 1 board, with any one square missing, can be tiled. (Use 0 tiles!) The key step of the recursive algorithm is to reduce a 2 n+1 × 2 n+1 problem to four 2 n × 2 n problems. We do this by placing one tile (the orange one in the figure) in a particular position.

This preview has intentionally blurred sections. Sign up to view the full version.

The Recursive Tiling The orange tile takes one square from three of the four quarters, the three that are not already missing a square. Then we recursively tile each of the quarters -- in this example by placing the green tile to make 2 × 2 boards with one square missing -- these are covered by the red and blue tiles.
Clicker Question #1

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.
• Fall '09
• Natural number, Euclidean algorithm, CUTS, Fibonacci number, Samuel Golomb

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern