Birbla

Join the discussion

Write your take first — we'll ask for email only when you're ready to publish.

Sign in
  • Hacker News
  • I see redblobgames, I click
    by dested
  • Finally an interesting article about AI!
    by layer8
  • Damn, isn't A* fun and intuitive?

    I'd be interesting to dive into bounds and good properties for sets of landmarks.

    I imagine that if, - Every node is at least X cost/distance away from a landmark - Landmarks are no closer than Y cost/distance from each other

    You can start promising a lot about the size of your open set on any execution.

    A* on h* (perfect heuristic) takes O(l) where l is the length of the solution (could expand exactly l nodes, but solving/guessing ties incorrectly might bump this to a multiple around the avg edges per vertex). I imagine that having good bounds mean you'll take no longer than a certain amount of expansions/depth before you lock-into the railway that h* provides (and you need some extra work to get off it too).

    by dietr1ch
  • There has been a lot of progress in this field in the research community. Two good papers:

    * https://ojs.aaai.org/index.php/AAAI/article/view/11027 * https://arxiv.org/abs/2212.03978

    by mpmisko
  • In the event this helps a random developer with some fun experimentation: I had once accidentally independently reinvented drunken pathfinding by adding random additional weights to the node costs, which has the side effect of making an object seeking a path end wander "drunkenly."
    by bellowsgulch
  • Incredible write-up, as usual. I still fondly remember discovering Red Blob Games' Hexagonal Grids [1] guide while building an implementation of the Tzaar board game [2]. The illustrations are enormously helpful!

    [1] https://www.redblobgames.com/grids/hexagons

    [2] https://boardgamegeek.com/boardgame/31999/tzaar

    by tkocmathla
  • Red Blob Games has quite a few S-tier posts, highly recommend exploring further if this is at all interesting to you
    by Groxx
  • > I learned about this technique in 2007, then tried writing it up in 2015. I realized that I didn’t understand it enough to be able to explain it. I studied it off and on in 2016, 2018, 2019, 2022, 2024, and 2026. I abandoned and restarted this page many times. And by 2026 I think I understand it well enough to write this page.

    Outstanding.

    by simonw

Explore Birbla archives