Drexel dragonThe Math Forum

The Math Forum Internet Mathematics Library

Tiling with Polyominoes

Library Home || Full Table of Contents || Library Help

Visit this site: http://www.maa.org/mathland/mathtrek_9_27_99.html

Author:Ivars Peterson (MathTrek)
Description: "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
Languages: English
Resource Types: Articles
Math Topics: Triangles and Other Polygons, Symmetry/Tessellations

[Privacy Policy] [Terms of Use]

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

© 1994- The Math Forum at NCTM. All rights reserved.