4 ms·
Only within undirected graphs. Sadly, this won't revolutionize video games, where we still have to use the A* algorithm from 1968 that is the literal computing
by hypertele-Xii 1y ago
Only within undirected graphs. Sadly, this won't revolutionize video games, where we still have to use the A* algorithm from 1968 that is the literal computing bottleneck limiting us to mere hundreds of intelligent characters at once in a barely dynamic environment.
I got way too excited.
- CMay 1y agoIn the article it does talk about how they arrived at a partial solution that only worked on undirected graphs, but then they started taking a hybrid approach to get it to work on directed graphs. The paper also indicates it works on directed graphs: https://arxiv.org/abs/2504.17033 https://arxiv.org/abs/2504.17033 That said, it might only be faster for large, sparse graphs.
- seniortaco 1y agoJump point search is obscenely fast. It's technically an optimization of A* but the behavior and runtime looks nothing like it.
- mecsred 1y agoIt only worked on undirected graphs in 2023. This article is about the newest breakthrough that works on directed graphs as well.