CS540 L3: Informed Search

preview_player
Показать описание
Algorithms to Gready best-first search, A search, A* search, IDA* search methods.

Рекомендации по теме
Комментарии
Автор

In 2:28, I said "for uninformed search, it only cares about g(s) (cost)". However, it is not an accurate expression. The accurate expression should be: "uninformed search does not care h(s) (heuristic value)". Therefore, UCS (uniform cost search) belongs to uninformed search as it does not consider state's h(s) value.

NianLi
Автор

In 14 min, it is actually G(10 + 0) instead of G(10 + inf)!!! Please remember heuristic value for ALL goal nodes are always 0 !!!

NianLi