πŸš€ Pathfinding Algorithms Visualizer

20Γ—20 A*

πŸ“Š Path Statistics

0
Steps
0
Minutes
0
Cost
0%
Efficiency

⚑ Algorithm Info

  • Algorithm:A*
  • Grid Size:20Γ—20
  • Total Cells:400
  • Path Coverage:0%

πŸ—ΊοΈ Terrain Types

  • Grass
    Cost: 1
  • Road
    Cost: 0.5
  • Water
    Cost: 2
  • Mountain
    Cost: 3

🧠 Algorithm Details

A* Algorithm

A* is an informed search algorithm that uses a heuristic function to estimate the cost to reach the goal. It combines the actual cost from start (g) with an estimated cost to goal (h) to find the most efficient path.

  • Best for: Finding shortest paths with terrain costs
  • Guarantee: Optimal solution
  • Heuristic: Manhattan distance