aboutsummaryrefslogtreecommitdiff
path: root/chm.css
diff options
context:
space:
mode:
authorSimon Tatham <anakin@pobox.com>2023-04-10 14:56:34 +0100
committerSimon Tatham <anakin@pobox.com>2023-04-10 14:59:05 +0100
commit6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6 (patch)
tree1672404818caa3f82491962ad4b4ba855414d46a /chm.css
parent71cf891fdc3ab237ecf0e5d1aae39b6c9fe97a4d (diff)
downloadpuzzles-6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6.zip
puzzles-6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6.tar.gz
puzzles-6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6.tar.bz2
puzzles-6fb890e0ea20a3c366ffd2de45d26a0c1c454dd6.tar.xz
Reference my just-published article about aperiodic tilings.
In commit 8d6647548f7d005 I added the Hats grid type to Loopy, and mentioned in the commit message that I was very pleased with the algorithm I came up with. In fact, I was so pleased with it that I've decided it deserves a proper public writeup. So I've spent the Easter weekend producing one: https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/aperiodic-tilings/ In this commit I adjust the header comments in both penrose.c and hat.c to refer to the article (replacing a previous comment in penrose.c to a much less polished page containing a copy of my jotting-grade personal notes that I sent James Harvey once). Also, added some code to hatgen.c to output Python hat descriptions in a similar style to hat-test, which I used to generate a couple of the more difficult diagrams in the new article, and didn't want to lose.
Diffstat (limited to 'chm.css')
0 files changed, 0 insertions, 0 deletions