The Tao of Gaming

Basic polynomino theory?


Little Princess Tao wanted to play Ubongo. So we played. (She finished most puzzles in time, and often beat me).

This got me to thinking about polyominoes. I can look at a basic grid arrangement and a set of -ominoes and tell if it's impossible by counting squares, and some arrangements because of parity issues. But I suspect that with some thought I could knock out more possibilities. Are there other tricks? Is there a good reference for the theory behind this that doesn't involve massive math?

The fact that Wikipedia had nothing leads me to believe I'm spelling this wrong, or missing a technical term.

Mike Siggins (mail):
Is this any use?

http://mathworld.wolfram.com/Polyomino.html
12.3.2006 5:24pm
Brian (www):
A good starting point, although none of the pages I found off of it discuss tiling in any technical detail. (And only one page mentions the parity trick I already knew ...)
12.3.2006 10:31pm
Larry Levy (mail):
As Mike's link shows, Brian, you were spelling polyomino wrong.

Do you have a way of getting hold of old Scientific American articles? I know that Martin Gardner devoted several of his wonderful Mathematical Recreations articles to polyominos. I own most of the books. If you don't mind waiting, I can see if there's anything there. At the very least, I may be able to find a technical reference.
12.4.2006 11:04pm
Peer Sylvester (mail):
Hi,
perhaps this helps (including references):
http://www.maa.org/mathland/mathtrek_9_27_99.html
12.6.2006 2:43am
Larry Levy (mail):
Sorry, Brian. Checked my Gardner books and the only article about polyominos is about tiling the plane, which won't help you at all. I guess the articles I was thinking of were in earlier books.
12.6.2006 9:40pm
Brian (www):
Thanks for all the pointers and help.
12.7.2006 8:49pm

Post as: [Register] [Log In]

Account:
Password:
Remember info?