AO* Search Algorithm

• A: And
• O: OR
• AO* is best Algorithm for Solving Cyclic AND-OR Graph
• The Problem is divided into a set of subproblems where subproblems
can be solved separately
• Eg If you want to Pass in Examination.
• Hyper Edge : Work Together and provide solution for the same.
• AO* does not explore all the solution paths once solution is found
Then terminate the search

• Here * means step at Movement

• In above figure we want to go to leaf node.
1. Two option available i.e BC & D
2. Cost from BC to A i.e 6+12+2=20
3. Here AND operation is there so we treat whole ABC
4. Cost From D to A ie 10+1=11
5. Now pick up the minimum i.e 11(D to A Path)
6. Now how to reach node D we have option available i.e GH to D
7. GH to D , 4+4+1+1= 10 is cost
8. Now again check D to A with updated value 10+1=11
9. Here we reach Last node so our Search is Complete
10. Compare the cost from other side then compare this is for
experiment to enhance the knowledge.
Simple Hill Cllimbing Algorithm
• i.e Theoretical Idea
Problems
Local Search
Greedy Algo
No Bracktracking
• Algorithm
1. Evaluate the initial state
2. Loop until a solution is found or there are no operation List
Select and Apply new operator
Evaluate the New State
3. If Gol state then Quit
Else if better then current state then it is now Current state.
Problems in Hill Climbing
1. Local Maximization
2. Platen / Flat Maximization
3. Ridge
STEEPEST ASCENT HILL CLIMBING
• OPTIMAL SOLUTIO
• Time Consuming