g*****n
发帖数: 239 | 1 有什么好方法可以让A* behaves like BFS吗？ | z*l
发帖数: 30 | 2 ...too simple
let h(n)=0 all the time.
【在 g*****n 的大作中提到】
: 有什么好方法可以让A* behaves like BFS吗？
| g*****n
发帖数: 239 | 3 That's not true. f(n)=g(n)+h(n). Just let h(n)=0, cannot guarantee g(n) is
larger than the f(Z), where Z is the upper level nodes.
【在 z*l 的大作中提到】
: ...too simple
: let h(n)=0 all the time.
| g*****n
发帖数: 239 | 4 OK, I see. If let g(n)=depth(n), then we done.
【在 g*****n 的大作中提到】
: That's not true. f(n)=g(n)+h(n). Just let h(n)=0, cannot guarantee g(n) is
: larger than the f(Z), where Z is the upper level nodes.
|
|
