** Features of Heuristic Functions**

A heuristic function * h(n) * satisfies the * monotone restriction*
if for all nodes * n*_{i} and * n*_{j} ,

* h(n*_{i}) &le h(n_{j}) + c(n_{i},n_{j})

If * h(n) * satisfies this restriction (similar to the triangle
inequality), then a node never has to be moved from ` closed`
back to ` open`. In this case, ` closed`
could be eliminated, saving storage.

The effectiveness of a heuristic can be expressed as the
* effective branching factor*, *b*^{*}.
*b*^{*} is the inferred branching factor that would produce the actual
number of nodes searched at the solution depth *d*.

Contents
Page-10
Prev
Next
Page+10
Index