Made for academic presentation pursope

1. A* (Aster) Search
o Best First Search
o Avoid Expensive Path
o Cost & Heuristic Value

2. f(n) = g(n) + h(n)
f(n) = Cost to reach the node
h(n) = Heuristic value
f(n) = Estimated total path to reach goal
A
B
2 g(n)

3. S
A B
CD
1
3
512
2
2
4
S 7
A 6
B 2
C 1
D 0
f(n) = g(n) + h(n)
Start
Goal

4. Advantages
o Convert Into Flowchart
o Step Wise Representation
o Easy To Debug
o Own Logic Sequence

5. Disadvantages
o Difficult To Show Branching
o Time Consuming
o Big Task To Implement