PATHFINDER — AI Planning Agent

◈

PATHFINDER

AI Planning Agent

ALGORITHM

BFS Breadth-First Search Optimal

UCS Uniform Cost Search Optimal

Dijkstra Weighted Shortest Path Optimal

A* Heuristic Search Fastest

Greedy Best-First Search Not Optimal

DFS Depth-First Search Not Optimal

GRID TOOLS

Weighted cells cost ×3 to traverse

SPEED

Slow Fast

PRESETS

—

NODES EXPLORED

—

PATH LENGTH

—

TOTAL COST

—

TIME (ms)

Start

Goal

Wall

Weight ×3

Explored

Path

◈ Ready — Select an algorithm and click RUN