ml-recall

#expanded-list

10 questions from Search & Planning

Timed test

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

Take a test

Q 1 / 10Score 0 / 0

Shuffle questions

Question 1: Short answer

mediumAI-checkedSearch & Planning

In the directed graph below (link costs on the arrows) you search from A to the goal G with A* and a strict expanded list (a state is never extended twice). The heuristic is

state	A	B	C	D	G
$h_1$	3	6	4	3	0

What is the total cost of the path that A* returns?

Enter: check / next