Artificial Intelligence (CS 370D) Princess Noura bint Abdulrahman University College of Computer and Information Sciences Artificial Intelligence (CS 370D) Uninformed Search Algorithms ( examples) L. Maram ALShablan

Breadth First Search L. Maram ALShablan

Breadth First Search Given the following state space (tree search), traverse this tree to find node O and give the sequence of visited nodes when using BFS. A B C E D F G H I J K L O M N L. Maram ALShablan

Breadth First Search A, A B C E D L. Maram ALShablan

Breadth First Search A, B A B C E D F G L. Maram ALShablan

Breadth First Search A, B,C A B C E D F G H L. Maram ALShablan

Breadth First Search A,B,C,D A B C E D F G H I J L. Maram ALShablan

Breadth First Search A,B,C,D,E A B C E D F G H I J L. Maram ALShablan

Breadth First Search A,B,C,D,E,F, A B C E D F G H I J L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G A B C E D F G H I J K L L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G,H A B C E D F G H I J K L L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G,H,I A B C E D F G H I J K L M L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G,H,I,J, A B C E D F G H I J K L M N L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G,H,I,J,K, A B C E D F G H I J K L M N L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G,H,I,J,K,L A B C E D F G H I J K L O M N L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G,H,I,J,K,L,M, A B C E D F G H I J K O M N L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G,H,I,J,K,L,M,N, A B C E D F G H I J O M N L. Maram ALShablan

Breadth First Search A,B,C,D,E,F,G,H,I,J,K,L,M,N, O A B C E D F G H I L. Maram ALShablan

Breadth First Search Answer: The sequence of visited nodes: A,B,C,D,E,F,G,H,I,J,K,L,M,N, O Success A B C E D F G H I J K L O M N L. Maram ALShablan

Depth First Search DFS L. Maram ALShablan

Depth First Search (DFS) Given the following state space (tree search), traverse this tree to find node O and give the sequence of visited nodes when using DFS. A B C E D F G H I J K L O M N L. Maram ALShablan

Depth First Search A, A B C E D L. Maram ALShablan

Depth First Search A,B, A B C E D F G L. Maram ALShablan

Depth First Search A,B,F, A B C E D F G L. Maram ALShablan

Depth First Search A,B,F, B,G, A B C E D F G K L L. Maram ALShablan

Depth First Search A,B,F, B,G,K, A B C E D F G K L L. Maram ALShablan

Depth First Search A,B,F, B,G,K, G,L, A B C E D F G K L O L. Maram ALShablan

Depth First Search A,B,F, B,G,K, G,L, O: Goal State A B C E D F G K L L. Maram ALShablan

Depth First Search Answer: The sequence of visited nodes: A,B,F,B, G,K, G,L, O Success A B C E D F G K L O L. Maram ALShablan

Depth-Limited Search DLS L. Maram ALShablan

Depth-Limited Search (DLS) Given the following state space (tree search), traverse this tree to find node O and give the sequence of visited nodes when using DLS (Limit = 2) Limit = 0 A B C E D F G H I J K L O M N Limit = 1 Limit = 2 L. Maram ALShablan

Depth-Limited Search (DLS) B C D E Limit = 2 L. Maram ALShablan

Depth-Limited Search (DLS) A,B, A B C E D F G Limit = 2 L. Maram ALShablan

Depth-Limited Search (DLS) A,B,F cutoff A B C E D F G Limit = 2 L. Maram ALShablan

Depth-Limited Search (DLS) A,B,F cutoff B,G, cutoff A B C D E Limit = 2 F G L. Maram ALShablan

Depth-Limited Search (DLS) A,B,F cutoff B,G, cutoff A B C E D F G H Limit = 2 L. Maram ALShablan

Depth-Limited Search (DLS) A,B,F cutoff B,G, cutoff B, A, C, H cutoff A B C D E Limit = 2 F G H L. Maram ALShablan

Depth-Limited Search (DLS) Maram M. Alshablan Depth-Limited Search (DLS) A,B,F cutoff B,G, cutoff B, A, C, H cutoff A B C D E Limit = 2 F G H I J L. Maram ALShablan

Depth-Limited Search (DLS) A,B,F cutoff B,G, cutoff B, A, C, H cutoff C,A,D,I cutoff A B C D E Limit = 2 F G H I J L. Maram ALShablan

Depth-Limited Search (DLS) A,B,F cutoff B,G, cutoff B, A, C, H cutoff C,A,D,I cutoff D,J cutoff A B C D E Limit = 2 F G H I J L. Maram ALShablan

Depth-Limited Search (DLS) B C D E Limit = 2 F G H I J L. Maram ALShablan

Depth-Limited Search (DLS) A,B,F cutoff B,G, cutoff B, A, C, H cutoff C,A,D,I cutoff D,J cutoff D,A,E Failure A B C D E Limit = 2 F G H I J L. Maram ALShablan

Depth-Limited Search (DLS) Answer: Failure (no solution) Because the goal is beyond the limit 2 (the goal depth is 4) A B C E D F G H I J K L O M N Limit = 2 L. Maram ALShablan

Iterative Deepening Search IDS L. Maram ALShablan

Iterative Deepening Search (IDS) Given the following state space (tree search), traverse this tree to find node O and give the sequence of visited nodes when using IDS till limit 4 Limit = 0 A B C E D F G H I J K L O M N Limit = 1 Limit = 2 Limit = 3 L. Maram ALShablan Limit = 4

Limit = 0 A L. Maram ALShablan

Iteration# Answer A, Failure Limit = 0 A L. Maram ALShablan

A Limit = 1 B C D E L. Maram ALShablan

A, Failure A, B cutoff A Limit = 1 B C D E Iteration# Answer 1 A, Failure 1 A, B cutoff A Limit = 1 B C D E L. Maram ALShablan

A, Failure A, B cutoff A, C cutoff A Limit = 1 B C D E Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A Limit = 1 B C D E L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A Limit = 1 B C D E L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure A Limit = 1 B C D E L. Maram ALShablan

A Limit = 1 B C D E L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A B C D E Limit = 2 L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A B C D E Limit = 2 F G L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff A B C D E Limit = 2 F G L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff A B C D E Limit = 2 F G L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff A B C D E Limit = 2 F G H L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff B, A, C, H cutoff A B C D E Limit = 2 F G H L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff B, A, C, H cutoff A B C D E Limit = 2 F G H I J L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff B, A, C, H cutoff C,A,D,I cutoff A B C D E Limit = 2 F G H I J L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff B, A, C, H cutoff C,A,D,I cutoff D, J cutoff A B C D E Limit = 2 F G H I J L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff B, A, C, H cutoff C,A,D,I cutoff D, J cutoff D,A,E failure A B C D E Limit = 2 F G H I J L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff B, A, C, H cutoff C,A,D,I cutoff D, J cutoff D,A,E failure A B C E D F G H I J K L O M N Limit = 2 L. Maram ALShablan

A, B cutoff A, C cutoff A,D cutoff A, E failure Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff B, A, C, H cutoff C,A,D,I cutoff D, J cutoff D,A,E failure 3 A B C D E Limit = 3 L. Maram ALShablan

A B C D E F G Limit = 3 L. Maram ALShablan

A B C D E F G Limit = 3 L. Maram ALShablan

A B C D E F G Limit = 3 K L L. Maram ALShablan

A B C D E F G Limit = 3 K L L. Maram ALShablan

A,B,F B,G,K cutoff G,L cutoff Iteration# Answer 3 A,B,F B,G,K cutoff G,L cutoff A B C D E F G Limit = 3 K L L. Maram ALShablan

A B C D E F G H Limit = 3 K L L. Maram ALShablan

A,B,F cutoff B,G,K cutoff G,L cutoff G,B,A,C,H cutoff Iteration# Answer 3 A,B,F cutoff B,G,K cutoff G,L cutoff G,B,A,C,H cutoff A B C D E F G H Limit = 3 K L L. Maram ALShablan

A B C D E F G H I J Limit = 3 K L L. Maram ALShablan

A B C D E F G H I J Limit = 3 K L M L. Maram ALShablan

A,B,F cutoff B,G,K cutoff G,L cutoff G,B,A,C,H cutoff C,A,D,I,M cutoff Iteration# Answer 3 A,B,F cutoff B,G,K cutoff G,L cutoff G,B,A,C,H cutoff C,A,D,I,M cutoff A B C D E F G H I J Limit = 3 K L M L. Maram ALShablan

A B C D E F G H I J N Limit = 3 K L M L. Maram ALShablan

Iteration# Answer 3 A,B,F cutoff B,G,K cutoff G,L cutoff G,B,A,C,H cutoff C,A,D,I,M cutoff I,D,J,N cutoff A B C D E F G H I J N Limit = 3 K L M L. Maram ALShablan

A B C D E F G H I J N Limit = 3 K L M L. Maram ALShablan

Iteration# Answer 3 A,B,F cutoff B,G,K cutoff G,L cutoff G,B,A,C,H cutoff C,A,D,I,M cutoff I,D,J,N cutoff J,D,A,E failure A B C E D F G H I J K L O M N Limit = 3 L. Maram ALShablan

Iteration# Answer 3 A,B,F cutoff B,G,K cutoff G,L cutoff G,B,A,C,H cutoff C,A,D,I,M cutoff I,D,J,N cutoff J,D,A,E failure 4 A B C D E L. Maram ALShablan Limit = 4

A B C D E F G L. Maram ALShablan Limit = 4

A,B,F cutoff A B C D E F G Limit = 4 Iteration# Answer 4 L. Maram ALShablan Limit = 4

A B C D E F G K L L. Maram ALShablan Limit = 4

A,B,F cutoff B,G,K cutoff A B C D E F G K L Limit = 4 Iteration# Answer 4 A,B,F cutoff B,G,K cutoff A B C D E F G K L L. Maram ALShablan Limit = 4

A,B,F cutoff B,G,K cutoff A B C D E F G K L Limit = 4 O Iteration# Answer 4 A,B,F cutoff B,G,K cutoff A B C D E F G K L L. Maram ALShablan Limit = 4 O

A,B,F cutoff B,G,K cutoff G,L,O Success Iteration# Answer 4 A,B,F cutoff B,G,K cutoff G,L,O Success A B C D E F G K L L. Maram ALShablan Limit = 4 O

Iterative Deepening Search (IDS) Answer: Iteration# Answer A, Failure 1 A, B cutoff A, C cutoff A,D cutoff A, E failure 2 A, B,F cutoff B, G cutoff B, A, C, H cutoff C,A,D,I cutoff D, J cutoff D,A,E failure 3 A,B,F cutoff B,G,K cutoff G,L cutoff G,B,A,C,H cutoff C,A,D,I,M cutoff I,D,J,N cutoff J,D,A,E failure 4 A,B,F cutoff B,G,K cutoff G,L,O Success L. Maram ALShablan

Uniform Cost Search UCS L. Maram ALShablan

Uniform Cost Search (UCS) Consider the search space of Figure 1, where state a is the initial state and G is the goal state. Assume that the actions are ordered according to their resulting state alphabetically. For example the action (a; b) comes before (a; c). L. Maram ALShablan

L. Maram ALShablan

The final explored list: a-d-c-f-b-e-G The final frontier list: empty. The solution found: (a,d,c,b,e,G). The cost of the solution: 6. L. Maram ALShablan