Write a program to apply the primary heuristic search algorithms, described in Figure 3.18 (that is, hill climbing, beam search, best-first search, branch and bound with and without underestimates, and the A* algorithm).

 

12 D:9 15 10 J:31 B:14 13 18 G:0 E:12 16 K:34 A:18 F:1 1:21 Figure 3.18 Tree with both node-to-node distances (on the branches) and heuristic estimates to the goal (inside the nodes). L:21 M:18 C:4 N:8 H:3 G:0