Informed Search Quiz

Before you start

Quiz for Lab 02: Informed Search. Answer every task, then press Check answers at the bottom: each answer is marked, the explanations appear, and you get a score per skill.

Assumptions unless stated otherwise

• Children are considered left-to-right.
• Lower heuristic values \(h(n)\) mean a node is estimated to be closer to the goal.
• A*: \(g(n)\) is the path cost from the start to \(n\), \(h(n)\) the estimated remaining cost from \(n\) to a goal, and \(f(n) = g(n) + h(n)\).
• Goal heuristic values are \(h(G) = 0\).
• Complexity expressions follow the conventions used in the course notes.

How answers are scored

• Sequences: click the nodes of the tree in order (or type the letters into the highlighted box). A sequence scores only if it is exactly right.
• Numbers: type the value; a decimal point or comma both work.
• Rows: one choice per row; each correct row earns its share of the points.
• Select all that apply: scores only when the selection is exactly right.
• Your answers are saved in this browser only, so you can leave and come back. Nothing is sent anywhere.