#completeness

Question 1: Select all that apply

All edges cost 1 and the state graph is finite but may contain cycles. A visited list means a state is never put on the queue twice; without one, the search does not check for repeated states at all. Which statements are true? Select all that apply.

Breadth-first search with a visited list is guaranteed to find a shortest path if one exists1
Breadth-first search without a visited list is guaranteed to find a path if one exists2
Depth-first search with a visited list is guaranteed to find a shortest path if one exists3
Depth-first search without a visited list is guaranteed to find a path if one exists4
Iterative deepening typically needs far less memory than breadth-first search5

Timed test