Abstract.A loop of polygons is a planar arrangement of congruent
non overlapping regular polygons in which each polygon has a common
edge with exactly two other polygons.
A loop encloses an equilateral polygon (not necessarily convex or
equiangular but we will require it to be not self-intersecting and of
positive area) that we will refer to as the window of the
loop.
We conduct an exhaustive computational search for all loops of polygons or
-gons for
and small values of the perimeter
of their windows.
The stages leading to the generation and display of the loops
were implemented in Mathematica.