Back to Projects
AI AUTOMATIONCOMPLETE▶ PLAYABLE

A* Path Planner

Interactive pathfinding visualizer with BFS, Greedy, Uniform Cost, and A* algorithms on a grid.

SOLO DEVELOPER  ·  Mar 1, 2025

// LIVE DEMO

An interactive pathfinding algorithm visualizer, originally built as a C++ Windows application during Full Sail AI coursework using hexagonal grids. Re-implemented as a web canvas component with square grids for accessibility. Supports four search algorithms — BFS, Greedy Best-First, Uniform Cost Search, and A* (with 1.2x heuristic weight) — with step-by-step visualization of the search process.

// TECH STACK

LANGC++SYSTEMAIPathfindingA*AlgorithmsLANGJavaScriptCanvas

Contributions

  • 01Implemented four pathfinding algorithms with priority queue-based open lists
  • 02Built hexagonal grid adjacency system with even/odd row offset handling
  • 03Created cost calculation system with terrain weights and Euclidean distance
  • 04Ported to canvas-based web visualizer with interactive wall placement and maze generation

Technical Highlights

  • ▸A* with configurable heuristic weight (1.2x) and cost-based tie-breaking
  • ▸Node pool allocation pattern for efficient memory management
  • ▸Real-time visualization of open set, closed set, and solution path