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

Practical method to find solutions quickly, not always optimal

Find 'good enough' solutions rather than optimal ones

Complex problems where perfect solution takes too long

Pathfinding, optimisation problems, game strategies

Dijkstra's algorithm with a heuristic for efficiency

Actual cost to reach node $n$ from start

Heuristic estimate of cost to reach goal from node $n$

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

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

Estimates distance to goal in grid-based pathfinding

Reduces time and computational resources required

May not always produce the optimal solution

Material balance, piece mobility, control of centre