jump to navigation

Problem of the Day #190: Least Blocking Set September 25, 2011

Posted by Saketh in : potd , trackback

Consider an $n$ by $m$ grid of unit squares. What is the least number of cells you must cut out to prevent placement of the following piece anywhere on the board?

Comments»

no comments yet - be the first?