Total distance Heuristic
Can use Manhattan as basis of excellent heuristic
The result will in fact be the A* algorithm
- sorry about the name
- pronounced “A star”
Total distance heuristic takes account of moves so far
- Manhattan distance + moves to reach this position
This must be a lower bound on #moves from start state to goal state via the current state