- A heuristic is some measure that can optimise the solution
- Using heuristics
- “When an algorithm uses a heuristic, it no longer needs to exhaustively search every possible solution, so it can find approximate solutions more quickly. A heuristic is a shortcut that sacrifices accuracy and completeness”
- This of it as a best guess that can not guarantee the best outcome, but will save enormous time
- Some solutions are not possible in probable time without one, when scaled to large problems