See how search algorithms actually think.

Explore a maze one ripple at a time, nearest first.

Always expand the cheapest-so-far path first — guaranteed lowest total cost.

Always expand the closest unvisited node — that's the shortest path.

Go as deep as you can, then back up and try the next path.

DFS with a leash — explore deep, but never past the fence.

Repeatedly dive deeper until you find the goal — DFS memory, BFS answers.

Dig from both ends of the tunnel and meet in the middle.

Always chase the node that looks closest to the goal.

A* finds the shortest path by being smart about which way to look.

Turn a speed dial: trade a little optimality for a lot of speed.

DFS on a leash: raise the cost limit until the goal appears.

Keep only the best k options at each level and race ahead.

Two A* searches race from both ends and meet in the middle.

A* smarts on a shoestring memory budget.

Always step toward the best-looking neighbour until nothing looks better.

Wander boldly at first, then settle down to find the best spot.

Search with a team of k explorers who share their best leads.

Evolve a crowd of guesses until the fittest survives.

Assume the worst opponent, then play your best move.

Minimax's clever twin that skips moves it already knows won't matter.

Minimax for games with dice: average over luck instead of fearing the worst.

Play thousands of random games, then trust what actually wins.

Fill in one variable at a time, undo when you hit a wall.

Backtracking with a lookout: prune bad values before you trip over them.

AC-3 cleans up a puzzle by deleting choices that can never work.

A turbocharged A* that skips over boring empty cells on grids.

A* that cuts corners: straight-line shortcuts for natural-looking paths.

Re-plan a path fast when the world changes, without starting over.