Scribd
Upload
45 views

Ai Ass2

The document discusses applying uninformed breadth first search and informed A* search to find the optimal path between an initial node S and goal node G in a search space. BFS finds the optimal path of S -> C -> G. A* also finds the optimal path of S -> C -> G. The key difference observed is that A* explores fewer nodes than BFS to find the optimal path.

Uploaded by

Mulugeta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
45 views

Ai Ass2

The document discusses applying uninformed breadth first search and informed A* search to find the optimal path between an initial node S and goal node G in a search space. BFS finds the optimal path of S -> C -> G. A* also finds the optimal path of S -> C -> G. The key difference observed is that A* explores fewer nodes than BFS to find the optimal path.

Uploaded by

Mulugeta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Given the attached search space, with 

initial node S and goal node G, find the optimal path using: (i) Uninformed search, Breadth First
Search and (ii) Informed search, A* search. (iii) What do you observe in the process of applying the two searching approaches.
Note: that: numbers with in the nodes are h(n) & edges labels are g(n).
BFS

Open list Closed list


{S} {}
{DS, CS, AS} {S}
{BSA, DS, CS } {S, A}
{GSC, BSA, BSc, DS} {S,A,C}
{GSD, GSC, BSA, BSc} {S,A,C,D}
{GSBC, GSD, GSC, BSA} {S,A,C,D,B}
{GSAB, GSBC, GSD, , GSD, GSC } {S,A,C,D,B}

Optimal path: S -> C -> G

A*

Open list Closed list


{ S(4) } {}
{ AS(6), CS(6), DS(6) } {S}
{ BSA(7), CS(6), DS(6) } {S, A}
{ BSC(8), BSA(7), DS(6) GSC(5)} {S,A,C}

Optimal path: S -> C -> G

You might also like