Pregunta:
Optimality of A*
Autor: Christian NRespuesta:
Theorem:The tree-search version of A* is optimal if h(n) is admissibleThe graph-search version of A* is optimal if h(n) is consistent
0 / 5 (0 calificaciones)
1 answer(s) in total
Autor
Christian N