Exhaustive search of convex pentagons which tile the plane
arXiv:1708.00274
Abstract
We present an exhaustive search of all families of convex pentagons which tile the plane. This research shows that there are no more than the already 15 known families. In particular, this implies that there is no convex polygon which allows only non-periodic tilings.