Build custom trees and watch algorithms explore them step-by-step
Draw mazes and discover how algorithms find the shortest path
Explores all neighbors at the current depth before going deeper. Guarantees shortest path in unweighted graphs.
Goes as deep as possible down one path before backtracking. Fast but doesn't guarantee shortest path.
Always expands the lowest-cost path first. Finds optimal path in weighted graphs.
Uses both actual cost and estimated distance to goal. Most efficient informed search algorithm.
Only considers estimated distance to goal. Fast but not always optimal.
Combines benefits of BFS and DFS. Memory efficient with guaranteed shortest path.