Consider the following path-finding problem

Subject:Computer SciencePrice: Bought3

Share With

 Consider the following path-finding problem. One can move from one small triangle to another if they share a vertex (e.g., A can go to B and C). However, the goal G can only be accessed from F. The number after the letter is the heuristic function value for that state. The actual cost of each move is as follows: 

1)• A move down one level (e.g. A → C or B → E) costs 1 

2)• A move sideways on the same level (e.g. C → B or E → F) costs 2 

3)• A move up one level (e.g. B → A or C → A ) costs 3 

 

4)e) Draw a full state space tree with cost of moving as describe above.