| Heuristic Searches - Possible Heuristics |
|
|
|
|
|
|
|
|
|
| H1
= the number of tiles that are in the |
||||||||
| wrong
position (=7) |
||||||||
| H2
= the sum of the distances of the tiles |
||||||||
| from
their goal positions using the |
||||||||
| Manhattan
Distance (=18) |
||||||||
| Both
are admissible but which one is |
||||||||
| best? |
||||||||
