On Aug 21, 2008, at 6:59 PM, Robert Holmes wrote:
> ..
> Here's another (famous) problem that can be answered using a top-down
> technique rather than a bottom-up: if you have a regular 8x8 chess
> board and
> you remove the bottom left and top right squares, how many ways can
> you
> cover the remaining 62-squares completely using non-overlapping 2x1
> rectangles?
Wonderful! OK, I cheated, but the solution is, as you say, elegant.
I have to admit that I had to see what the chessboard looked like ..
two black squares on the two corners being eliminated.
-- Owen
============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
