Press escape to exit fullscreen

{{sketch.instructions}}

CC {{sketch.licenseObject.short}}

Archived Sketch

This sketch is created with an older version of Processing,
and doesn't work on browsers anymore.

View Source Code

Capture Screenshot

A* Path Finding

{{$t('general.by')}}
Jacob
Haip
Click to choose the start and end nodes, and to clear your selection. Press any key to find the path. A simple path finding example using the A* algorithm for a game I may work on. It is completely node based and not grid dependent. The blue lines show each of the node's neighbors. **UPDATED: I added a cost multiplier so the path is found based off both distance and the cost to travel to the next node. The lighter the line the higher the cost multiplier. Setting the cost to 1.0 would make all neighbor paths normal.
We recovered an unsaved version of this sketch. Please review your changes below.

As a Plus+ Member feature, this source code is hidden by the owner.

  • {{co.title}}
    •
    {{$t('sketch.mode-pjs')}} {{$t('general.learnMore')}}
    Select mode or a template
    {{liveCodeLink}}
    • {{l.url.substr(l.url.lastIndexOf('/') + 1)}}
    {{$t('sketch.layoutDescription')}}

    {{k.category}}
    {{k.label}}
    {{k.description}}

    {{$t('sketch.seeMoreShortcuts')}}

    Versions are only kept for 7 days.
    Join Plus+ to keep versions indefinitely!

    {{$t('general.joinPlus')}}

    {{$t('sketch.versionsSummarized')}}

    {{ $t('general.joinPlus') }}