Beyond the wall: working with aperiodic tilings using finite-state transducers
Read OriginalThis article details a method for working with aperiodic tilings (Penrose, hat, Spectre) using finite-state transducers and combinatorial coordinates. It presents an algorithm derived from regular-language theory that is faster and more capable than previous recursive methods, handling edge cases and generating complex tiling patches. The content includes technical explanations, implementation details, and visual examples.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
Quoting Thariq Shihipar
Simon Willison
•
2 votes
2
Using Browser Apis In React Practical Guide
Jivbcoop
•
2 votes
3
Top picks — 2026 January
Paweł Grzybek
•
1 votes
4
In Praise of –dry-run
Henrik Warne
•
1 votes
5
Deep Learning is Powerful Because It Makes Hard Things Easy - Reflections 10 Years On
Ferenc Huszár
•
1 votes
6
Vibe coding your first iOS app
William Denniss
•
1 votes
7
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook
•
1 votes
8
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft
•
1 votes