9 If you are playing a new game where you have one hunter, H1, who is trying to catch all of the animals, A1....An. The hunter can only move horizontally or vertically. The animals are all in different squares and cannot move. An animal disappears when the hunter and the animal are in the same grid square. The game ends when the last animal has disappeared.
h(n) = the number of remaining animals times the maximum Manhattan distance between the player and an every animal.
This heuristic is?
Select one alternative:
o just consistent
o neither admissible or consistent
o just admissible
o both admissible and consistent
