Search Strategies
Best-First Basics
Greedy Best-First
A Algorithm*
Heuristics & Evaluation
100

A general method in AI that explores paths from a start state to a goal.

What is a search strategy?

100

Best-First Search selects the node with the lowest value of this function.

What is h(n)?

100

Greedy Search does not guarantee this key property.

What is optimality?

100

A heuristic is admissible when it never does this to the actual cost.

What is overestimate?

100

This function estimates the cost from any node to the goal.

What is a heuristic function?

200

This type of search selects the most promising node based on evaluation.

What is Best-First Search?

200

One limitation of Best-First Search regarding the final path found.

What is it may not be optimal?

200

The main drawback of Greedy Search is that it ignores this.

What is the path cost (g(n))?

200

When the heuristic is both admissible and consistent, A* guarantees this.

What is optimality (and completeness)?

200

The method of designing heuristics by simplifying the original problem.

What is problem relaxation?

300

Search variant that explores neighbors without heuristic guidance.

What is Hill Climbing?

300

Greedy Best‑First focuses exclusively on what?

What is front‑end cost to goal?

300

A typical map navigation heuristic used is ___ distance.

 What is Euclidean distance?

300

A* is complete when the search space is ___.

What is finite?

300

Measurement of how many nodes are expanded during search.

What is time complexity?

400

A* uses this combined function to pick the next node.

What is f(n) = g(n) + h(n)?

400

Best‑First uses only this to pick which node to expand next.

What is heuristic h(n)?

400

Continues exploring until finding the goal without considering cost.

What is pure greedy?

400

A* is complete when the search space is ___.

What is admissible?

400

Condition h(n) ≤ c(n,n') + h(n') guarantees this property.

What is consistency?

500

search that uses the least path cost so far.

What is Uniform Cost Search?

500

Data structure commonly used to implement Best-First Search.

What is a priority queue?

500

The main drawback of Greedy Search is that it ignores this

What is the path cost (g(n))?

500

If a heuristic satisfies the triangle inequality, it is considered this.

What is consistent (or monotonic)?

500

The number of nodes explored during search is referred to as this.

What is time complexity?