Navigation überspringen
Adding a little serendipity into your A* path finding makes it 4x-9x faster at cost of accuracy.
0:00 / 0:31

Adding a little serendipity into your A* path finding makes it 4x-9x faster at cost of accuracy.

Andrei Kashcha

@anvaka9864 Follower

Auf X besuchen

33.677 Aufrufe

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 Kommentare

Kommentare aus dem Originalbeitrag auf X (Twitter)

  • Profilbild von Andrei Kashcha 🇺🇦

    @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 Likes

  • Profilbild von Grant Slatton

    @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 Likes

  • Profilbild von nikolay

    @nikkyhammer40k

    Damn

    1 Like

  • Profilbild von rshinra

    @rshinra

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

  • Profilbild von araz.dev ☀️

    @ArazDev

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

  • Profilbild von Andrei Kashcha 🇺🇦

    @anvaka

    Thank you, I really appreciate that.