ml-recall

#optimal-search

1 question from Search & Planning

Timed test

1 question · 1 min · score and explanations at the end

Take a test

Q 1 / 1Score 0 / 0

Shuffle questions

Question 1: Single choice

easyAI-checkedSearch & Planning

A path-search problem has a very large branching factor and fairly short solutions, but the actions have widely varying costs and you have no useful heuristic. You need a minimum-cost path. Which search should you use?

Breadth-first search with a visited list1
Greedy best-first search on the cost of the last action2
Uniform-cost search (branch and bound on path cost)3
Iterative deepening on the number of steps4

Keys: 1–9 select · Enter check / next