Finding Search Heuristics Henry Kautz. if State[node] is not in closed OR g[node] < g[LookUp(State[node],closed)] then A* Graph Search for Any Admissible.
![Finding Search Heuristics Henry Kautz. if State[node] is not in closed OR g[node] < g[LookUp(State[node],closed)] then A* Graph Search for Any Admissible.](https://static.fdocuments.in/doc/330x215/56649c7c5503460f94930750/finding-search-heuristics-henry-kautz-if-statenode-is-not-in-closed-or-gnode.jpg)
