Heuristics for Problem Solving (OCR A-Level Computer Science): Quizzes

Provide a quick, good enough solution

Actual cost to reach node $n$

$f(n) = g(n) + h(n)$

Estimated distance to the goal

$h(n) = |x_1 - x_2| + |y_1 - y_2|$

By reducing the search space

For complex or large-scale problems

They may not produce optimal solutions

Material balance and piece mobility

Straight-line distance estimate

Heuristic estimate to goal from $n$

Choosing poor heuristics