Two algorithms for randomly generating aperiodic tilings
chiark.greenend.org.uk
chiark.greenend.org.uk
Simon Tatham (the author of this article) is the developer of PuTTY [1], an open source Windows native SSH client, and Simon Tatham's Portable Puzzle Collection [2], a bunch of simple games implemented in portable C (with OS-specific frontends, or you can play them in-browser via WebAssembly).
The website has been updated in ways that improve it (this just-written article is a huge amount of informative content, and being able to play a puzzle in-browser via WASM is very welcome), but it never jumped on any of the 21st century design bandwagons that have taken over most of the WWW (many of which, I suspect, only exist to create jobs for web developers and branding consultants).
[1] PuTTY https://www.chiark.greenend.org.uk/~sgtatham/putty/
Also it could benefit from a modicum of CSS.
And 97% of web users don't know CSS.
You can play Loopy on a hat tile grid here: https://www.chiark.greenend.org.uk/~sgtatham/puzzles/js/loop...
The author of this was one of the authors of the Hat tile paper.
It is such a wicked combination of beauty and math, like fractals.
Anyway, that's unfortunate. Can't he just get a cut or something?
Also, this all really begs the question as to whether this is an "invention" or just "math". Imagine if Newton's heirs had to get a cut every time Newtonian physics was used (or calculus for that matter... splitting it with Leibniz's heirs)
If you do find any such thing, please let me know!
I have no idea if their rugs are any good, though, and I don't want to spend hundreds of dollars to find out.
https://www.sciencenews.org/article/ancient-islamic-penrose-...
It seems like there would be infinite possible aperiodic tiles (with real valued side lengths), so long as the number of angles (or nodes/vertices) for a whole tile (like a triangle) has the same evenness or oddness as the number of vertices extending from the node as the number of sides of the shape it is a part of.
So to completely tile a plane aperiodically, each node/angle of a triangle must have an odd number of "sides" from its adjacent tiles stemming from it to completely tile a plane, where each angle of a hexagon must be a node with an even number of sides connecting at its vertices. Once you are more than one "hop" away from another tile, you can have even or odd numbers of verticies.
The perimeter of any plane with a complete aperiodic tiling must still be a hamiltonian path around its edge, therefore the graph of the verticies representing the angles the aperiodic tiles must also reduce to being made of other "shapes" with hamiltonian paths. It implies to me that for every tile that is odd-sided, it requires a complementary odd-sided shape somewhere in the tiling to form a hamilonian path of "hops."
It's not a sufficient condition, but naively it looks like a necessary one. No math will get done here, but from a general interest reasoning perspective, I'd wonder if tiles and hamiltonian cycles are the same thing.
This adjustability was a surprise, we have not seen an aperiodic tiling like this before.
It was found by a hobbyist playing with PolyForm Puzzle Solver
Short answer to your question: David Smith discovered the hat shape by experimentation.
Now, people have gotten it down to a single shape that—by itself—tiles the pattern infinitely, but not in one of those 17 groups.