For the 8 puzzle problem, it has been proved that if h(n) = number of tiles on wrong place. h(n) is an admissible heuristic as every tile which is in wrong place must be moved out at least once.
But if h(n) = number of tiles on correct place. h(n) is not an admissible heuristic. Can anybody please explain.