& Lab Task $1$:

Problem $1$:

Assume the intial node is $\text{'}A\text{'}$ and you want to reach node $\text{'}F\text{'}.$ Implement the solution of the

given problem using Greedy$-$best first search?

Hints for solution:

Implement the tree according to start point

Write the python program

Include output screenshots.

Analyze Results

Solution

Tree:

Greedy$-$best first search $($Place Code Text Here$)$:

Greedy$-$best first search Output $($Place Screen Shot$($s$)$ here$)$:

Results Analysis:

Mac Al$-$Lab $05$ Tasks $-$ AnswerSheet $(1)$

Lab task $2$:

Problem $2$:

Solve the problem given in Task $1$ using $A^{*}$ search. Then compare between $A^{*}$ and greedy in

terms of:

What are the paths given by $A^{*}$ and greedy best first search?

What is the path cost of each algorithm? Which algorithm gives a better solution?

Formulate the problem formally by defining: initial state, possible actions, transition

model, goal test, and path cost.

Hints for solution:

Implement the tree according to start point

Write the python program

Include output screenshots.

Analyze Results $($Compare according to illustration in task$2$ the two algorithms$)$

Solution

Tree:

A$*$ search $($Place Code Text Here$)$:

A$*$ search Output $($Place Screen Shot$($s$)$ here$)$: