qiao/PathFinding.js

Health v2 · maintenance only

Flags: no_license

Adoption not part of the score

8712 stars · 1362 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-29, confidence not recorded

A comprehensive JavaScript path-finding library for 2D grid-based games, implementing algorithms such as A*, IDA*, BFS, Best-First Search, Dijkstra, and Jump Point Search. It runs in both Node.js and the browser and includes an online visual demo.

Use cases

• find shortest path on a grid in a browser game
• implement A* pathfinding in a JavaScript game
• compare pathfinding algorithms like Dijkstra and jump point search
• add NPC movement routing to a 2D tile map
• visualize how pathfinding algorithms explore a grid

When to choose

• you are building a 2D grid-based web game and need well-tested pathfinding algorithms
• you want to run the same pathfinding code in Node.js and the browser
• you need multiple algorithms and heuristics (diagonal movement, corner crossing, bidirectional search) in one library

When to avoid

• you need 3D pathfinding rather than 2D grid search
• you need continuous-space navigation meshes instead of grid maps
• you require a project with an explicit license or very active development

Facets

library · maturity maintenance

game-engine math developer-tools web-development browser pathfinding a-star grid-based 2d-games jump-point-search dijkstra game-development algorithms nodejs javascript

Member repositories

For agents

markdown · JSON · MCP: product_card(name="qiao/PathFinding.js")