#uninformed-search

Question 1: Single choice

A path-search problem has a very large branching factor, all actions cost the same, and every solution is a fairly short (but unknown) number of steps. You want a path with the fewest steps and memory is the bottleneck. Which search fits best?

Breadth-first search with a visited list1
Uniform-cost search with a strict expanded list2
Depth-first search with a visited list3
Iterative deepening with no visited list4

Timed test