A* Pathfinder

A* Pathfinder MCP Connector for Claude

A+

Deterministic A* pathfinding for grid-based navigation.

3 tools Official Updated Oct 1, 2026 Official Vinkius Partner

This MCP server provides deterministic A* pathfinding capabilities for agents navigating 2D grid environments. It allows for precise movement planning using 4-directional or 8-directional movement types and various heuristics like Manhattan, Euclidean, or Chebyshev. Use find_shortest_path to calculate the most efficient route, find_k_shortest_paths to discover alternative routes, or analyze_grid_feasibility to validate if a path is possible before starting complex computations.

astargridpathfindingnavigationalgorithms

3 tools expose this connector's capabilities to your AI agent.

analyze_grid_feasibility

find_k_shortest_paths

find_shortest_path

See how to talk to your AI agent using A* Pathfinder.

Find the shortest path in this 3x3 grid: [[0,0,0],[1,1,0],[0,0,0]] from [0,0] to [2,2] using 4-directional movement and manhattan heuristic.

[ [0,0], [0,1], [0,2], [1,2], [2,2] ]

Is it possible to move from [0,0] to [2,2] in a grid where [1,1] is an obstacle?

Yes, a path is possible by navigating around the obstacle at [1,1].

Give me 2 alternative paths for a 5x5 grid from [0,0] to [4,4] using 8-directional movement.

Path 1: [[0,0], [1,1], [2,2], [3,3], [4,4]]. Path 2: [[0,0], [0,1], [1,2], [2,3], [3,4], [4,4]].

The server supports both 4-directional (cardinal) and 8-directional (cardinal and diagonal) movement.

Related Connectors