Pregunta:
Admissible heuristics
Autor: Christian NRespuesta:
Example: the 8-puzzle h1(n) = number of misplaced tiles h2(n) = total Manhattan distance (i.e. no. of squares from desired location of each tile)
0 / 5 (0 calificaciones)
1 answer(s) in total
Autor
Christian N