**Hosted by The Math Forum
**

Spring 97 Archive || MacPOW Home || Math Forum POWs || Search MacPOW

Given an NxN board and a supply of 2x1 dominoes, what is the minimum N such that you can tile the board without it being possible to draw a line parallel to any side of the board that does not slice any domino into two?

Source: This problem was found by John Guilford on the rec.puzzles newsgroup.

© Copyright 1997 Stan Wagon. Reproduced with permission.

[**Privacy Policy**]
[**Terms of Use**]

Home || The Math Library || Quick Reference || Search || Help

http://mathforum.org/

The Math Forum is a research and educational enterprise of the Drexel University School of Education.

2 October 1998