Lecture 13: Artificial intelligence: 8 puzzle problem solution using heuristic value in AI
There are two ways two calculate the heuristic value
h1 = the number of misplaced tiles.
h1 = 8.
h1 is an admissible heuristic because it is clear that any tile that is out of place must be moved at least once.
h2 = the sum of the distances of the tiles from their goal positions.
h2 = 3+1 + 2 + 2+ 2 + 3+ 3 + 2 = 18
Manhattan distance
#8puzzleProblem #8puzzleProbleminArtificialintelligence #8puzzleProblemSolutionUsingHeuristci #Heuristic