Uninformed Search Algorithms

Preliminaries A search algorithm takes a search problem as input and returns a solution, or an in...

When all actions have the same cost, an appropriate strategy is breadth-first search, in which th...

When actions have different costs, an obvious choice is to use best-first search where the evalua...

Depth-first search always expands the deepest node in the frontier first. It could be implemented...

Depth-limited To keep depth-first search from wandering down an infinite path, we can use depth-l...

Simultaneously searches forward from the initial state and backwards from the goal state(s), hopi...