This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: and white cells will not be equal. Therefore one cannot fully cover this kind of board with dominos. ¥ 2. ”= ⇒ ”. If number of white cells isn’t equal to the number of black cells on the board covering is impossible as shown above. ” ⇐ =”. Suppose 2 cells, one black and one white have been removed. Let these 2 cells be corners of a rectangular region. Covering the board outside the region is simple. Covering the inside region can be done as shown below. Note that if g is odd and not even covering will be the same up to rotation of the board. Also u will always be odd, since corner colors should be diﬀerent. Exercise 1.3 http://en.wikipedia.org/wiki/BoyerMoore_string_search_algorithm :) 2...
View
Full
Document
This note was uploaded on 05/04/2010 for the course CS 320251 taught by Professor Nuechter during the Fall '09 term at Jacobs University Bremen.
 Fall '09
 Nuechter
 Algorithms, Data Structures

Click to edit the document details