The tiling world is a bit aflutter recently with the drop of Smith, Meyers, Kaplan, and Goodman-Strauss's paper showing an *einstein* - a simply-connected polygon - that must aperiodically tile the plane. Their einstein is a concave 13-gon that they have called the "hat" monotile.

The image above is from Kaplan's tweet announcing the paper. While playing with his discovery Smith supposed that it was necessarily aperiodic; Meyers, Kaplan, and Goodman-Strauss worked with Smith to give two separate proofs of aperiodicity.

Earlier I think in "Mathematical Games" in a *Scientific American* article from the '70s, Martin Gardner relayed a question considered by John Conway about whether a (rhombic) Penrose tiling of the plane could admit a three-coloring; this was algorithmically answered in the affirmative by Sibley and Wagon. I dug up some plastic Penrose rhombi that I had bought about 25 years ago, and indeed they came in only three colors. It's a straightforward but fun puzzle to tile with only these three colors.

The same question can be asked about the SMKG einstein -

can we three-color any tiling with the above 13-gon monotile? If so, can we give an efficient algorithm?

The construction is gloriously simple and could be taught to bright young children. How many colors would be needed to 3D-print a bunch of these?

**Added later**

As we know, at least for a finite part of the plane four colors suffice, but some questions may remain about how easy it is to four-color the monotiling. Jesse Clark suggested that it could be easily four-colored along radial stripes here.

aperiodicandnon-periodic. A tiling isnon-periodicif it is not periodic. A set of tiles isaperiodicif it tiles the plane, but every tiling is non-periodic. This terminology may not be universal but it is pretty common. $\endgroup$1more comment