News for hackers. Stuff that matters.
Re:Pentagon Tiling Proof Solves Century-Old Math Problem by markegli on Tuesday July 11, 2017 @05:37PM (#14748314)
The tiles in an aperiodic tiling must guarantee that the tiling is not periodic simply by their shape.

https://en.wikipedia.org/wiki/Aperiodic_tiling

All three of the Scheme examples can be tiled periodically even though they aren't tiled periodically in the examples. How to tile them periodically is left as an exercise to the reader, but it's not hard.

Re:Pentagon Tiling Proof Solves Century-Old Math Problem by GregBuchholz on Tuesday July 11, 2017 @06:03PM (#14748475)
Got to love this quote from the "Einstein Problem" page on Wikipedia:

https://en.wikipedia.org/wiki/Einstein_problem

"Depending on the particular definitions of nonperiodicity and the specifications of what sets may qualify as tiles and what types of matching rules are permitted, the problem is either open or solved."

Re:Pentagon Tiling Proof Solves Century-Old Math Problem by Infernal on Tuesday July 11, 2017 @07:24PM (#14748928)
There's definitely something Douglas Adams-esque about that phrasing.