Let S be the initial state and G be the (only) goal state in the following graph.

Apply

Depth-First Search

as implemented via best-first search to compute a solution path.

NOTE: Add nodes to the frontier such that the preferred expansion is given "from left to the right" when multiple nodes with same evaluation function value are added.

2. Provide the resulting solution path as well as the path cost of the resulting solution path.

As an example, for 1., the first two lines are

Frontier Reached Visited

{S:(0,0)} {S:0} { }

{A:(-1,1),B:(-1,5),C:(-1,8)} {S:0,A:1,B:5,C:8} {S:0}