Adding a little serendipity into your A* path finding makes it 4x-9x faster at cost of accuracy.
Andrei Kashcha
在 X 上查看@anvaka9864 位关注者
33,677 次观看
Adding a little serendipity into your A* path finding makes it 4x-9x faster at cost of accuracy. In some cases this might be an acceptable tradeoff.
6 条评论
评论来自 X (Twitter) 上的原帖

@anvaka
Here is how you can reproduce the results and explore alternatives: * Checkout and * Symlink ngraph.path into node_modules of the demo. * Change the ngraph.path like in the video and `npm build` it
13 个赞

@GrantSlatton
Is there a good reason one would prefer this vs. always relaxing the heuristic estimate by some fixed percent as is traditionally done (e.g.
6 个赞

@nikkyhammer40k
Damn
1 个赞

@rshinra
When you're talking >.1s, no, it's not acceptable.

@ArazDev
Cant stop being amazed every time i see a project by you

@anvaka
Thank you, I really appreciate that.
