Unformatted text preview: 7 board with any one square missing can be tiled using trominos. (This is lengthy, and done by considering several possible cases of missing square. So if you can’t ﬁnd an answer just assume that this can be done). (d) Show that a 11 × 11 board, with any one square missing can be tiled using trominos. Hint: Divide the board into a subboard of size 7 × 7 (which contains that missing square), a subboard of size 5 × 5 with a corner missing, and two subboards of size 4 × 6. (e) By induction show that, for n > 11, any n × n board with one square missing can be tiled using trominoes as long as n is odd and not a multiple of 3. Hint: Divide the board into four parts, One of size ( nm ) × ( nm ) containing the missing square (which can be solved using induction), two boards of sizes ( nm1) × m , which can be solved using part (a), and one board of size ( m +1) × ( m +1), with a missing corner. 1...
View
Full Document
 Fall '10
 sanjay
 Algorithms, Sort, size, sort algorithm, Counting Sort algorithm

Click to edit the document details