• Home
  • Technology
  • Gaming
  • Entertainment
  • World & Business
  • Science
  • Sports
  • AI
HomeTechnologyGamingEntertainmentWorld & BusinessScienceSportsAI
    • Home
    • Technology
    • Gaming
    • Entertainment
    • World & Business
    • Science
    • Sports
    • AI
    AI
    Report

    A 15-hexagon shape reportedly covers 251 of 254 cells in a fifth ring

    A post traces the problem to 1968: how many rings of copies can surround a shape that cannot tile indefinitely?

    Danielle Fong 🔆DF
    Pratik GandhiPG
    2 Sources, ,

    TLDR

    A post describes Heinrich Heesch’s 1968 question: How many rings of copies can surround a shape that cannot tile a floor forever? It says a 15-hexagon shape completes four rings and covers 251 of the fifth ring’s 254 cells, but a machine-checked proof rules out finishing that ring with this shape. Researchers and contributors are publicly testing candidates, with humans and AI agents taking shots at the problem, according to the post.

    Combined views

    5K

    2 Sources, first seen 8h ago

    Combined views

    5K

    2 Sources, first seen 8h ago

    86 likes
    8h ago
    first seen 8h ago
    86 likes
    7 comments
    29 saves
    20 reposts
    7 comments
    29 saves
    20 reposts
    Featured Source

    Sentiment

    Positive——Negative

    Summary

    Not enough discussion yet.

    No sentiment analysis available yet.

    Sentiment

    Positive——Negative

    Summary

    Not enough discussion yet.

    No sentiment analysis available yet.

    Today's Rank

    —

    Not ranked yet

    Today's Rank

    —

    Not ranked yet

    2 Sources

    Pratik Gandhi@pratikgUNSOLVED SINCE 1968: A QUESTION ABOUT ODD LITTLE SHAPES Back in 1968, the German mathematician Heinrich Heesch asked a question nobody needed answered. If a shape can't tile a floor forever, how many times can you surround it with copies of itself before the rings jam? Most shapes jam fast. For shapes built only from squares, hexagons or triangles, the best anyone has found is 4 rings. The current best on http://yukon.org/heesch is a shape made of 15 hexagons. It gets through 4 full rings and covers 251 of the 254 cells in the 5th. Then a machine-checked proof says it can never go further. Now mathematicians and researchers are digging into what it would take to close those last few gaps. Dr. Bartosz Naskręcki, @nasqret, has been helping lead that effort, working through candidates and ideas with contributors in public. Getting to a complete 5th ring wouldn't just top the leaderboard. It would be a new mathematical result. Nearly 60 years on, people are still chasing it. Every attempt is rechecked from scratch and posted publicly and anyone can try. Multiplayer autoresearch, with humans and AI agents taking shots at the same unsolved problem.8h
    Danielle Fong 🔆@DanielleFongRT @pratikg: UNSOLVED SINCE 1968: A QUESTION ABOUT ODD LITTLE SHAPES Back in 1968, the German mathematician Heinrich Heesch asked a questi…3h

    2 Sources

    Pratik Gandhi@pratikgUNSOLVED SINCE 1968: A QUESTION ABOUT ODD LITTLE SHAPES Back in 1968, the German mathematician Heinrich Heesch asked a question nobody needed answered. If a shape can't tile a floor forever, how many times can you surround it with copies of itself before the rings jam? Most shapes jam fast. For shapes built only from squares, hexagons or triangles, the best anyone has found is 4 rings. The current best on http://yukon.org/heesch is a shape made of 15 hexagons. It gets through 4 full rings and covers 251 of the 254 cells in the 5th. Then a machine-checked proof says it can never go further. Now mathematicians and researchers are digging into what it would take to close those last few gaps. Dr. Bartosz Naskręcki, @nasqret, has been helping lead that effort, working through candidates and ideas with contributors in public. Getting to a complete 5th ring wouldn't just top the leaderboard. It would be a new mathematical result. Nearly 60 years on, people are still chasing it. Every attempt is rechecked from scratch and posted publicly and anyone can try. Multiplayer autoresearch, with humans and AI agents taking shots at the same unsolved problem.8h
    Danielle Fong 🔆@DanielleFongRT @pratikg: UNSOLVED SINCE 1968: A QUESTION ABOUT ODD LITTLE SHAPES Back in 1968, the German mathematician Heinrich Heesch asked a questi…3h