Hexbear thread and accompanying news article about the weak solution: https://hexbear.net/post/260404

  • TerminalEncounter [she/her]
    ·
    edit-2
    1 year ago

    No way! I can't believe they sorted it. I thought it was kinda cheating using chiral reflections.

    I love this stuff because I did an undergrad research job on aperiodic tilings of the plane too but we didn't aim at anything unsolved or whatever. Just, like, their chromatic indices if they're taken as graphs. I wonder what the chromatic index and number of this tiling are... I came up with an alternating colour theorem for most regular but aperiodic tilings so I knew they were all type 1.

    Looking at it I would guess you could get away with just 4 coloring edges. It might just be 2 coloring for vertices too... hmm...

    It's euclidean and therefore 4 colourable in terms of faces. Might be less, I wonder. It'd be fun to try!