28 Feb
2006
28 Feb
'06
10:12 p.m.
From: Michael Reid <reid@math.ucf.edu>
What is the smallest polyomino that contains all polyominos of size n?
For n = 4, there is a unique size 6 polyomino that works: OOOO OO
XX XXXX
also works. it is clear that size 6 is the smallest possible, because the square tetromino and the straight one can overlap in at most two squares.
No, OO OO won't fit in that one. ___________________________________________________ Try the New Netscape Mail Today! Virtually Spam-Free | More Storage | Import Your Contact List http://mail.netscape.com