The uniform-cost search is optimal.

The iterative deepening search is not complete even though the branching factor (b) is finite.

Depth-limited search is not optimal.

The depth-first search is not complete.

The breadth-first search is complete.