Skip to content
ml-recall

#tree-search

3 questions from Search & Planning

Timed test

3 questions · 3 min · score and explanations at the end

Take a test
Q 1 / 3Score 0 / 0

Question 1: Short answer

mediumAI-checkedSearch & Planning

Run uniform-cost search on the tree below (arc lengths on the edges) from A to the goal G, with no visited or expanded list. Ties in path cost are broken alphabetically by state name. List the states in the order they are expanded, ending with G.

State letters in order, e.g. A B C D