Skip to content
ml-recall

#backtracking

3 questions from Search & Planning, Probabilistic & Graphical Models

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 depth-first search with backtracking and an extended list on the graph below (ignore the costs and hh values), from H to the goal G. Neighbors are tried alphabetically and a path never revisits a state already on it. Which path is found?

State letters along the path, e.g. H A B G