- Prof. Dancy's Site - Course Site -

Heuristic Tree Search Practice

Given the h(x) & the g(x) (given by the numbers above the connections), give the paths that result from greedy best-first search and the A* search.

{(x, h(x))} = {(B, 253), (C, 160), (D, 242), (G, 176), (H, 329), (L, 244), (M, 374), (N, 100), (O, 380), (S, 0), (U, 366), (V, 193), (X, 241)}