Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Internet Mathematics Library

Tiling with Polyominoes

_____________________________________
Library Home || Full Table of Contents || Suggest a Link || 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-2013 Drexel University. All rights reserved.
http://mathforum.org/
 The Math Forum is a research and educational enterprise of the Goodwin College of Professional Studies.The Math Forum is a research and educational enterprise of the Drexel University School of Education.