Simple 2D Pathfinder


Optimized simple pathfinder based on A* algorithm


by Kwaaktje


Price History +

Documentation


This package uses the A* algorithm with a heap-optimized priority queue for ultra-fast pathfinding on grid-based maps. Supports rectangular and hexagonal grids, weighted tiles, and obstacles. Perfect for strategy games, RPGs, and AI-driven navigation.

  • Find path with only two lines of code
  • Optimized - uses heap 
  • Rectangular and hexagonal grids
  • Obstacles and difficult terrain
  • Source code included