Tiling with Polyominoes
Library Home || Full Table of Contents || Suggest a Link || Library Help
|Ivars Peterson (MathTrek)|
|"Mathematicians have proved that the general question of whether it's possible to cover the plane with identical copies of a given finite set of tiles is, in principle, computationally undecidable. In other words, there's no cookbook recipe or handbook procedure that you can routinely apply to indicate whether you can fit together copies of an arbitrary shape to form a rectangle. Mathematicians, however, have solved a variety of special cases of the tiling problem in two dimensions..."|
|Levels:||High School (9-12), College|
|Math Topics:||Triangles and Other Polygons, Symmetry/Tessellations|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.