javascript-astar

A* Search / Pathfinding Algorithm in Javascript

Web Development Libraries & SDKs

Explore on GitHub Read Hacker News discussions

2Distinct people

2Mentions

0Explicit recommenders

1.4KGitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

What it is

A* Search / Pathfinding Algorithm in Javascript

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 6:01:08 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year2 dated mentions

Observed mentions: 2011-08-18 15:20:35 UTC to 2014-09-22 15:07:56 UTC.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges

UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Comments
2011	2011-01-01 00:00:00 UTC	2012-01-01 00:00:00 UTC	1	1
2012	2012-01-01 00:00:00 UTC	2013-01-01 00:00:00 UTC	0	0
2013	2013-01-01 00:00:00 UTC	2014-01-01 00:00:00 UTC	0	0
2014	2014-01-01 00:00:00 UTC	2015-01-01 00:00:00 UTC	1	1

What Hacker News says

1 sources

noiv·Sep 22, 2014

The above pathfinder is much faster with a binary heap, https://github.com/bgrins/javascript-astar and can be heavily optimized if you know your engine. With SpiderMonkey I get fixed cost of around 1ms for initialization and it checks nearly 2000 nodes in 1ms on a 3Ghz Core Duo with a relative costly euclidean heuristic. So worst case on a 40x50 map is ~2ms. If worst case can be avoided upfront you'll always get a response within 2ms even with a 2000 nodes long path on most maps. It is amazing what one can do with JS nowadays.

In PathFinding.js