News for hackers. Stuff that matters.
Re:Ask HN: Have you ever seen a pathfinding algorithm of thi... by Tossrock on Tuesday January 07, 2025 @02:20PM (#42626209)
It sounds like you're looking for Any Angle pathfinding. The fastest known algorithm for 2D grids is ANYA: https://ojs.aaai.org/index.php/ICAPS/article/view/13609
Re:Ask HN: Have you ever seen a pathfinding algorithm of thi... by gpm on Tuesday January 07, 2025 @02:24PM (#42626253)
And for non-grids (arbitrary constant cost 2d meshes) you can use polyanya.
Re:Ask HN: Have you ever seen a pathfinding algorithm of thi... by Farer on Tuesday January 07, 2025 @10:24PM (#42630560)
Oh! This seems like something even AIs haven’t suggested before. The fact that it attempts paths in real-time without preprocessing is what I like the most! I definitely need to research this further! I’ll definitely take a look at it. Thank you!