SlideShare a Scribd company logo

AI Uninformed Search Strategies by Examples

•
•
Ahmed Gad
Ahmed Gad

Explaining how uninformed search strategies in Artificial Intelligence (AI) works by examples. Five different uninformed search strategies presented: Breadth-First Search (BFS). Depth-First Search (DFS). Uniform Cost Search. Depth-Limited Search. Iterative Deepening Search. Find me on: AFCIT http://www.afcit.xyz YouTube https://www.youtube.com/channel/UCuewOYbBXH5gwhfOrQOZOdw Google Plus https://plus.google.com/u/0/+AhmedGadIT SlideShare https://www.slideshare.net/AhmedGadFCIT LinkedIn https://www.linkedin.com/in/ahmedfgad/ ResearchGate https://www.researchgate.net/profile/Ahmed_Gad13 Academia https://www.academia.edu/ Google Scholar https://scholar.google.com.eg/citations?user=r07tjocAAAAJ&hl=en Mendelay https://www.mendeley.com/profiles/ahmed-gad12/ ORCID https://orcid.org/0000-0003-1978-8574 StackOverFlow http://stackoverflow.com/users/5426539/ahmed-gad Twitter https://twitter.com/ahmedfgad Facebook https://www.facebook.com/ahmed.f.gadd Pinterest https://www.pinterest.com/ahmedfgad/

Education
1 of 216
Download to read offline
AI Uninformed Search Strategies by Examples MENOUFIA UNIVERSITY FACULTY OF COMPUTERS AND INFORMATION ALL DEPARTMENTS ARTIFICIAL INTELLIGENCE ‫المنوفية‬ ‫جامعة‬ ‫والمعلومات‬ ‫الحاسبات‬ ‫كلية‬ ‫األقسام‬ ‫جميع‬ ‫الذكاء‬‫اإلصطناعي‬ ‫المنوفية‬ ‫جامعة‬ Ahmed Fawzy Gad ahmed.fawzy@ci.menofia.edu.eg
Breadth-First Search Goal - Node J A --- Current Waiting
Breadth-First Search Goal - Node J A --- Current Waiting A
Breadth-First Search Goal - Node J A --- Current Waiting A A
Breadth-First Search Goal - Node J A --- Current Waiting A B, C A
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B A
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C A
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C A B
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B A B
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D A B
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C A B
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D A B
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D A B C
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D C A B C
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D C D, E, F A B C
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D C D, E, F D A B C
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D C D, E, F D E, F A B C
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D C D, E, F D E, F A B C D
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D C D, E, F D E, F D A B C D
Breadth-First Search Goal - Node J A --- Current Waiting A B, C B C B C, D C D C D, E, F D E, F D E, F, G, H A B C D
Breadth-First Search Goal - Node J Current Waiting D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, H D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, HE D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, H E E D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J E D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F E D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J E D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J E D E, F, G, H F
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F E D E, F, G, H F
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L E F D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, L
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG H
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG H I, J, K, L
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG H I, J, K, LH
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG H I, J, K, LH I
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG H I, J, K, LH I J, K, L
Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG H I, J, K, LH I J, K, LI
J Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG H I, J, K, LH I J, K, LI
J Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F D E, F, G, H H, I, J, K, LG H I, J, K, LH I J, K, LI K, L
J Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F J D E, F, G, H H, I, J, K, LG H I, J, K, LH I J, K, LI K, L
J Breadth-First Search Goal - Node J Current Waiting E F, G, H E F, G, H, I, J F G, H, I, J F G, H, I, J, K, L G E F JGOAL D E, F, G, H H, I, J, K, LG H I, J, K, LH I J, K, LI K, L
Depth-First Search Goal - Node J Current
Depth-First Search Goal - Node J Current A
Depth-First Search Goal - Node J Current AA
Depth-First Search Goal - Node J Current A B A
Depth-First Search Goal - Node J Current A B A B
Depth-First Search Goal - Node J Current A B D A B
Depth-First Search Goal - Node J Current A B D A B D
Depth-First Search Goal - Node J Current A B D G A B D
Depth-First Search Goal - Node J Current A B D G A B D G
Depth-First Search Goal - Node J Current A B D G A B D G D
Depth-First Search Goal - Node J Current A B D G A B D G D H
Depth-First Search Goal - Node J Current A B D G A B D G D HH
Depth-First Search Goal - Node J Current A B D G A B D G D HH D
Depth-First Search Goal - Node J Current A B D G A B D G D HH D B
Depth-First Search Goal - Node J Current A B D G A B D G D HH D B A
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E I J C E D B A
Depth-First Search Goal - Node J Current A B D G A B D G D HH C D B A
Depth-First Search Goal - Node J Current A B D G A B D G D HH CC D B A
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E C D B A
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E C E D B A
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E I C E D B A
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E I C E I D B A
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E I C E I D B A E
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E I J C E I D B A E
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E I J C E I J D B A E
Depth-First Search Goal - Node J Current A B D G A B D G D HH C E I J C E I J D B A E GOAL
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑺 𝟎
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑺 𝟎
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑺 𝟎
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑺 𝟎
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑺 𝟎 𝑨 𝟏
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑺 𝟎 𝑨 𝟏
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑺 𝟎 𝑨 𝟏
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑺 𝟎 𝑨 𝟏
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑺 𝟎 𝑨 𝟏
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑺 𝟎 𝑨 𝟏 𝑪 𝟐
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑺 𝟎 𝑨 𝟏 𝑪 𝟐
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑫 𝟑, 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑺 𝟎 𝑨 𝟏 𝑪 𝟐
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑫 𝟑, 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑫 𝟑 𝑺 𝟎 𝑨 𝟏 𝑪 𝟐
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑫 𝟑, 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑫 𝟑 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑺 𝟎 𝑨 𝟏 𝑪 𝟐
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑫 𝟑, 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑫 𝟑 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑺 𝟎 𝑨 𝟏 𝑪 𝟐 𝑫 𝟑
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑫 𝟑, 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑫 𝟑 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑫 𝟑 𝑺 𝟎 𝑨 𝟏 𝑪 𝟐 𝑫 𝟑
Uniform Cost Search Goal - Node G 𝑺 𝟎 --- Current Waiting Ordered 𝑺 𝟎 𝑨 𝟏, 𝑮 𝟏𝟐 𝑨 𝟏 𝑮 𝟏𝟐 𝑨 𝟏 𝑪 𝟐, 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑩 𝟒, 𝑮 𝟏𝟐 𝑪 𝟐 𝑫 𝟑, 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑫 𝟑 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟏𝟐 𝑫 𝟑 𝑩 𝟒, 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐 𝑺 𝟎 𝑨 𝟏 𝑪 𝟐 𝑫 𝟑
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑩 𝟒 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑮 𝟒 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑮 𝟒 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑮 𝟒 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑩 𝟒 𝑮 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑮 𝟒 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑩 𝟒 𝑮 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐 GOAL
Uniform Cost Search Goal - Node G 𝑩 𝟒 Current Waiting Ordered 𝑩 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑮 𝟒 𝑮 𝟔, 𝑫 𝟕, 𝑮 𝟏𝟐 𝑩 𝟒 𝑮 𝟒 𝑮 𝟒, 𝑮 𝟔, 𝑮 𝟏𝟐 GOAL Solve using BFS & DFS Compare Costs
Depth-Limited Search Depth – 3, Goal – Node J Current 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current AA 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B A 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B A 0 1 2 3 B
Depth-Limited Search Depth – 3, Goal – Node J Current A B D A B 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D A B 0 1 2 3 D
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D H 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH D 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH D 0 1 2 3 B
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH D 0 1 2 3 B A
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C D 0 1 2 3 B A
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH CC D B 0 1 2 3 A
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E C D B 0 1 2 3 A
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E C D B A 0 1 2 3 E
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I C E D B A 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I C E I D B A 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I C E I D B A E 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I J C E I D B A 0 1 2 3 E
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I J C E I J D B A 0 1 2 3 E
Depth-Limited Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I J C E I J D B A E GOAL 0 1 2 3
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current AA
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B A
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B A B
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D A B
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D A B D
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D H
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D HH
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D HH D
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D HH D B
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D HH D B A
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D HH C D B A
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D HH CC D B A
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Current A B D G A B D G D HH CC D B A GOAL
Depth-Limited Search Depth – 3, Goal – Node C 0 1 2 3 Depth is Large Current A B D G A B D G D HH CC D B A GOAL
Depth-Limited Search Depth – 2, Goal – Node J Current 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current AA 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B A 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A 0 1 2 3 B
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D B 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D B A 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C B 0 1 2 3 A
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D CC B A 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E C B A 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E C E B A 0 1 2 3
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E C E B A 0 1 2 3 C
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E F C E B A 0 1 2 3 C
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E F C E FB A 0 1 2 3 C
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E F C E FB A Search Finished NO GOAL 0 1 2 3 C
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E F C E FB A Search Finished NO GOAL 0 1 2 3 Depth is Small C
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E F C E FB A Search Finished NO GOAL 0 1 2 3 Depth is Small Increase Depth Iteratively C
Depth-Limited Search Depth – 2, Goal – Node J Current A B D A B D C E F C E FB A 0 1 2 3 Depth is Small Increase Depth Iteratively C Search Finished NO GOAL
Iterative Deepening Search Depth – 0, Goal – Node J Current 0 1 2 3
Iterative Deepening Search Depth – 0, Goal – Node J Current A 0 1 2 3
Iterative Deepening Search Depth – 0, Goal – Node J Current AA 0 1 2 3
Iterative Deepening Search Depth – 0, Goal – Node J Current AA 0 1 2 3 Search Finished NO GOAL Increase Depth by 1
Iterative Deepening Search Depth – 1, Goal – Node J Current 0 1 2 3
Iterative Deepening Search Depth – 1, Goal – Node J Current A 0 1 2 3
Iterative Deepening Search Depth – 1, Goal – Node J Current AA 0 1 2 3
Iterative Deepening Search Depth – 1, Goal – Node J Current A B A 0 1 2 3
Iterative Deepening Search Depth – 1, Goal – Node J Current A B A B 0 1 2 3
Iterative Deepening Search Depth – 1, Goal – Node J Current A B A B 0 1 2 3 A
Iterative Deepening Search Depth – 1, Goal – Node J Current A B A B C 0 1 2 3 A
Iterative Deepening Search Depth – 1, Goal – Node J Current A B A B CC 0 1 2 3 A
Iterative Deepening Search Depth – 1, Goal – Node J Current A B A B CC 0 1 2 3 A Search Finished NO GOAL Increase Depth by 1
Iterative Deepening Search Depth – 2, Goal – Node J Current 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current A 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current AA 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current A B A 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current A B A 0 1 2 3 B
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D B 0 1 2 3 A
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D C B 0 1 2 3 A
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D CC B A 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D C E C B A 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D C E C E B A 0 1 2 3
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D C E C E B A 0 1 2 3 C
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D C E C E FB A 0 1 2 3 C
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D C E C E FB A 0 1 2 3 C
Iterative Deepening Search Depth – 2, Goal – Node J Current A B D A B D C E C E FB A 0 1 2 3 Search Finished NO GOAL Increase Depth by 1 C
Iterative Deepening Search Depth – 3, Goal – Node J Current 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current AA 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B A 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B A 0 1 2 3 B
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D A B 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D A B 0 1 2 3 D
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D H 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH D 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH D 0 1 2 3 B
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH D 0 1 2 3 B A
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C D 0 1 2 3 B A
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH CC D B 0 1 2 3 A
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E C D B 0 1 2 3 A
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E C D B A 0 1 2 3 E
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I C D B A 0 1 2 3 E
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I C E I D B A 0 1 2 3
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I C E I D B A 0 1 2 3 E
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I J C E I D B A 0 1 2 3 E
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I J C E I J D B A 0 1 2 3 E
Iterative Deepening Search Depth – 3, Goal – Node J Current A B D G A B D G D HH C E I J C E I J D B A E GOAL 0 1 2 3

Recommended

AI Greedy & A* Informed Search Strategies by Example
AI Greedy & A* Informed Search Strategies by ExampleAI Greedy & A* Informed Search Strategies by Example
AI Greedy & A* Informed Search Strategies by ExampleAhmed Gad
 
Informed search (heuristics)
Informed search (heuristics)Informed search (heuristics)
Informed search (heuristics)Bablu Shofi
 
Artificial Intelligence -- Search Algorithms
Artificial Intelligence -- Search Algorithms Artificial Intelligence -- Search Algorithms
Artificial Intelligence -- Search Algorithms Syed Ahmed
 
Lecture 16 memory bounded search
Lecture 16 memory bounded searchLecture 16 memory bounded search
Lecture 16 memory bounded searchHema Kashyap
 
Uninformed search /Blind search in AI
Uninformed search /Blind search in AIUninformed search /Blind search in AI
Uninformed search /Blind search in AIKirti Verma
 
Uninformed search
Uninformed searchUninformed search
Uninformed searchMegha Sharma
 
Informed and Uninformed search Strategies
Informed and Uninformed search StrategiesInformed and Uninformed search Strategies
Informed and Uninformed search StrategiesAmey Kerkar
 
Uninformed search
Uninformed searchUninformed search
Uninformed searchBablu Shofi
 

Recommended

AI Greedy & A* Informed Search Strategies by Example
AI Greedy & A* Informed Search Strategies by ExampleAI Greedy & A* Informed Search Strategies by Example
AI Greedy & A* Informed Search Strategies by ExampleAhmed Gad
 
Informed search (heuristics)
Informed search (heuristics)Informed search (heuristics)
Informed search (heuristics)Bablu Shofi
 
Artificial Intelligence -- Search Algorithms
Artificial Intelligence -- Search Algorithms Artificial Intelligence -- Search Algorithms
Artificial Intelligence -- Search Algorithms Syed Ahmed
 
Lecture 16 memory bounded search
Lecture 16 memory bounded searchLecture 16 memory bounded search
Lecture 16 memory bounded searchHema Kashyap
 
Uninformed search /Blind search in AI
Uninformed search /Blind search in AIUninformed search /Blind search in AI
Uninformed search /Blind search in AIKirti Verma
 
Uninformed search
Uninformed searchUninformed search
Uninformed searchMegha Sharma
 
Informed and Uninformed search Strategies
Informed and Uninformed search StrategiesInformed and Uninformed search Strategies
Informed and Uninformed search StrategiesAmey Kerkar
 
Uninformed search
Uninformed searchUninformed search
Uninformed searchBablu Shofi
 
search strategies in artificial intelligence
search strategies in artificial intelligencesearch strategies in artificial intelligence
search strategies in artificial intelligenceHanif Ullah (Gold Medalist)
 
Informed search
Informed searchInformed search
Informed searchAmit Kumar Rathi
 
Hill climbing
Hill climbingHill climbing
Hill climbingMohammad Faizan
 
A* Algorithm
A* AlgorithmA* Algorithm
A* AlgorithmDr. C.V. Suresh Babu
 
Artificial Intelligence Notes Unit 1
Artificial Intelligence Notes Unit 1 Artificial Intelligence Notes Unit 1
Artificial Intelligence Notes Unit 1 DigiGurukul
 
AI Lecture 3 (solving problems by searching)
AI Lecture 3 (solving problems by searching)AI Lecture 3 (solving problems by searching)
AI Lecture 3 (solving problems by searching)Tajim Md. Niamat Ullah Akhund
 
Heuristic Search Techniques Unit -II.ppt
Heuristic Search Techniques Unit -II.pptHeuristic Search Techniques Unit -II.ppt
Heuristic Search Techniques Unit -II.pptkarthikaparthasarath
 
AI_Session 10 Local search in continious space.pptx
AI_Session 10 Local search in continious space.pptxAI_Session 10 Local search in continious space.pptx
AI_Session 10 Local search in continious space.pptxAsst.prof M.Gokilavani
 
A* algorithm
A* algorithmA* algorithm
A* algorithmKomal Samdariya
 
A* Search Algorithm
A* Search AlgorithmA* Search Algorithm
A* Search Algorithmvikas dhakane
 
I.BEST FIRST SEARCH IN AI
I.BEST FIRST SEARCH IN AII.BEST FIRST SEARCH IN AI
I.BEST FIRST SEARCH IN AIvikas dhakane
 
Problems, Problem spaces and Search
Problems, Problem spaces and SearchProblems, Problem spaces and Search
Problems, Problem spaces and SearchBMS Institute of Technology and Management
 
Uninformed Search technique
Uninformed Search techniqueUninformed Search technique
Uninformed Search techniqueKapil Dahal
 
State Space Search in ai
State Space Search in aiState Space Search in ai
State Space Search in aivikas dhakane
 
AI Informed Search Strategies by Examples
AI Informed Search Strategies by ExamplesAI Informed Search Strategies by Examples
AI Informed Search Strategies by ExamplesAhmed Gad
 
Artificial Intelligence Searching Techniques
Artificial Intelligence Searching TechniquesArtificial Intelligence Searching Techniques
Artificial Intelligence Searching TechniquesDr. C.V. Suresh Babu
 
Heuristic search-in-artificial-intelligence
Heuristic search-in-artificial-intelligenceHeuristic search-in-artificial-intelligence
Heuristic search-in-artificial-intelligencegrinu
 
I. Hill climbing algorithm II. Steepest hill climbing algorithm
I. Hill climbing algorithm II. Steepest hill climbing algorithmI. Hill climbing algorithm II. Steepest hill climbing algorithm
I. Hill climbing algorithm II. Steepest hill climbing algorithmvikas dhakane
 
Heuristc Search Techniques
Heuristc Search TechniquesHeuristc Search Techniques
Heuristc Search TechniquesJismy .K.Jose
 
Alpha beta pruning in ai
Alpha beta pruning in aiAlpha beta pruning in ai
Alpha beta pruning in aiSavyasachi14
 
Flexible Shape Matching
Flexible Shape MatchingFlexible Shape Matching
Flexible Shape MatchingAhmed Gad
 
Game Paper
Game PaperGame Paper
Game PaperSiddharth Gupta
 

More Related Content

What's hot

Artificial Intelligence Notes Unit 1
Artificial Intelligence Notes Unit 1 Artificial Intelligence Notes Unit 1
Artificial Intelligence Notes Unit 1 DigiGurukul
 
Heuristic Search Techniques Unit -II.ppt
Heuristic Search Techniques Unit -II.pptHeuristic Search Techniques Unit -II.ppt
Heuristic Search Techniques Unit -II.pptkarthikaparthasarath
 
AI_Session 10 Local search in continious space.pptx
AI_Session 10 Local search in continious space.pptxAI_Session 10 Local search in continious space.pptx
AI_Session 10 Local search in continious space.pptxAsst.prof M.Gokilavani
 
I.BEST FIRST SEARCH IN AI
I.BEST FIRST SEARCH IN AII.BEST FIRST SEARCH IN AI
I.BEST FIRST SEARCH IN AIvikas dhakane
 
Uninformed Search technique
Uninformed Search techniqueUninformed Search technique
Uninformed Search techniqueKapil Dahal
 
State Space Search in ai
State Space Search in aiState Space Search in ai
State Space Search in aivikas dhakane
 
AI Informed Search Strategies by Examples
AI Informed Search Strategies by ExamplesAI Informed Search Strategies by Examples
AI Informed Search Strategies by ExamplesAhmed Gad
 
Artificial Intelligence Searching Techniques
Artificial Intelligence Searching TechniquesArtificial Intelligence Searching Techniques
Artificial Intelligence Searching TechniquesDr. C.V. Suresh Babu
 
Heuristic search-in-artificial-intelligence
Heuristic search-in-artificial-intelligenceHeuristic search-in-artificial-intelligence
Heuristic search-in-artificial-intelligencegrinu
 
I. Hill climbing algorithm II. Steepest hill climbing algorithm
I. Hill climbing algorithm II. Steepest hill climbing algorithmI. Hill climbing algorithm II. Steepest hill climbing algorithm
I. Hill climbing algorithm II. Steepest hill climbing algorithmvikas dhakane
 
Heuristc Search Techniques
Heuristc Search TechniquesHeuristc Search Techniques
Heuristc Search TechniquesJismy .K.Jose
 
Alpha beta pruning in ai
Alpha beta pruning in aiAlpha beta pruning in ai
Alpha beta pruning in aiSavyasachi14
 

What's hot (20)

search strategies in artificial intelligence
search strategies in artificial intelligencesearch strategies in artificial intelligence
search strategies in artificial intelligence
 
Informed search
Informed searchInformed search
Informed search
 
Hill climbing
Hill climbingHill climbing
Hill climbing
 
A* Algorithm
A* AlgorithmA* Algorithm
A* Algorithm
 
Artificial Intelligence Notes Unit 1
Artificial Intelligence Notes Unit 1 Artificial Intelligence Notes Unit 1
Artificial Intelligence Notes Unit 1
 
AI Lecture 3 (solving problems by searching)
AI Lecture 3 (solving problems by searching)AI Lecture 3 (solving problems by searching)
AI Lecture 3 (solving problems by searching)
 
Heuristic Search Techniques Unit -II.ppt
Heuristic Search Techniques Unit -II.pptHeuristic Search Techniques Unit -II.ppt
Heuristic Search Techniques Unit -II.ppt
 
AI_Session 10 Local search in continious space.pptx
AI_Session 10 Local search in continious space.pptxAI_Session 10 Local search in continious space.pptx
AI_Session 10 Local search in continious space.pptx
 
A* algorithm
A* algorithmA* algorithm
A* algorithm
 
A* Search Algorithm
A* Search AlgorithmA* Search Algorithm
A* Search Algorithm
 
I.BEST FIRST SEARCH IN AI
I.BEST FIRST SEARCH IN AII.BEST FIRST SEARCH IN AI
I.BEST FIRST SEARCH IN AI
 
Problems, Problem spaces and Search
Problems, Problem spaces and SearchProblems, Problem spaces and Search
Problems, Problem spaces and Search
 
Uninformed Search technique
Uninformed Search techniqueUninformed Search technique
Uninformed Search technique
 
State Space Search in ai
State Space Search in aiState Space Search in ai
State Space Search in ai
 
AI Informed Search Strategies by Examples
AI Informed Search Strategies by ExamplesAI Informed Search Strategies by Examples
AI Informed Search Strategies by Examples
 
Artificial Intelligence Searching Techniques
Artificial Intelligence Searching TechniquesArtificial Intelligence Searching Techniques
Artificial Intelligence Searching Techniques
 
Heuristic search-in-artificial-intelligence
Heuristic search-in-artificial-intelligenceHeuristic search-in-artificial-intelligence
Heuristic search-in-artificial-intelligence
 
I. Hill climbing algorithm II. Steepest hill climbing algorithm
I. Hill climbing algorithm II. Steepest hill climbing algorithmI. Hill climbing algorithm II. Steepest hill climbing algorithm
I. Hill climbing algorithm II. Steepest hill climbing algorithm
 
Heuristc Search Techniques
Heuristc Search TechniquesHeuristc Search Techniques
Heuristc Search Techniques
 
Alpha beta pruning in ai
Alpha beta pruning in aiAlpha beta pruning in ai
Alpha beta pruning in ai
 

Viewers also liked

Flexible Shape Matching
Flexible Shape MatchingFlexible Shape Matching
Flexible Shape MatchingAhmed Gad
 
Creating a User-Friendly Search UI with Drupal - Presentation at DrupalCamp T...
Creating a User-Friendly Search UI with Drupal - Presentation at DrupalCamp T...Creating a User-Friendly Search UI with Drupal - Presentation at DrupalCamp T...
Creating a User-Friendly Search UI with Drupal - Presentation at DrupalCamp T...Suzanne Dergacheva
 
A* Path Finding
A* Path FindingA* Path Finding
A* Path Findingdnatapov
 
Ai for games seminar: N-Grams prediction + intro to bayes inference
Ai for games seminar: N-Grams prediction + intro to bayes inferenceAi for games seminar: N-Grams prediction + intro to bayes inference
Ai for games seminar: N-Grams prediction + intro to bayes inferenceAndrea Tucci
 
Artificial Intelligence in Computer and Video Games
Artificial Intelligence in Computer and Video GamesArtificial Intelligence in Computer and Video Games
Artificial Intelligence in Computer and Video GamesLuke Dicken
 
Artificial intelligence In Modern-Games.
Artificial intelligence In Modern-Games. Artificial intelligence In Modern-Games.
Artificial intelligence In Modern-Games. Nitish Kavishetti
 
Boolean Logic Searching: A Primer
Boolean Logic Searching: A PrimerBoolean Logic Searching: A Primer
Boolean Logic Searching: A Primercswetzel
 
Artificial intelligence in gaming.
Artificial intelligence in gaming.Artificial intelligence in gaming.
Artificial intelligence in gaming.Rishikese MR
 
Amit ppt
Amit pptAmit ppt
Amit pptamitp26
 
Bfs and dfs in data structure
Bfs and dfs in data structure Bfs and dfs in data structure
Bfs and dfs in data structure Ankit Kumar Singh
 
The Evolution of Search
The Evolution of SearchThe Evolution of Search
The Evolution of SearchTom Anthony
 
Game Playing in Artificial Intelligence
Game Playing in Artificial IntelligenceGame Playing in Artificial Intelligence
Game Playing in Artificial Intelligencelordmwesh
 
Adversarial search
Adversarial searchAdversarial search
Adversarial searchNilu Desai
 
Despierta tu creatividad
Despierta tu creatividad Despierta tu creatividad
Despierta tu creatividad Sandra Castillo
 
Brochure italfood russia_trk copia
Brochure italfood russia_trk copiaBrochure italfood russia_trk copia
Brochure italfood russia_trk copialestyle27
 
Estrategia metodológica para Finanzas I
Estrategia metodológica para Finanzas IEstrategia metodológica para Finanzas I
Estrategia metodológica para Finanzas IGuillermo Acevedo Cruz
 

Viewers also liked (20)

Flexible Shape Matching
Flexible Shape MatchingFlexible Shape Matching
Flexible Shape Matching
 
Game Paper
Game PaperGame Paper
Game Paper
 
Creating a User-Friendly Search UI with Drupal - Presentation at DrupalCamp T...
Creating a User-Friendly Search UI with Drupal - Presentation at DrupalCamp T...Creating a User-Friendly Search UI with Drupal - Presentation at DrupalCamp T...
Creating a User-Friendly Search UI with Drupal - Presentation at DrupalCamp T...
 
Facet and Search API
Facet and Search APIFacet and Search API
Facet and Search API
 
A* Path Finding
A* Path FindingA* Path Finding
A* Path Finding
 
Ai for games seminar: N-Grams prediction + intro to bayes inference
Ai for games seminar: N-Grams prediction + intro to bayes inferenceAi for games seminar: N-Grams prediction + intro to bayes inference
Ai for games seminar: N-Grams prediction + intro to bayes inference
 
Artificial Intelligence in Computer and Video Games
Artificial Intelligence in Computer and Video GamesArtificial Intelligence in Computer and Video Games
Artificial Intelligence in Computer and Video Games
 
Artificial intelligence In Modern-Games.
Artificial intelligence In Modern-Games. Artificial intelligence In Modern-Games.
Artificial intelligence In Modern-Games.
 
Boolean Logic Searching: A Primer
Boolean Logic Searching: A PrimerBoolean Logic Searching: A Primer
Boolean Logic Searching: A Primer
 
Artificial intelligence in gaming.
Artificial intelligence in gaming.Artificial intelligence in gaming.
Artificial intelligence in gaming.
 
Amit ppt
Amit pptAmit ppt
Amit ppt
 
Bfs and dfs in data structure
Bfs and dfs in data structure Bfs and dfs in data structure
Bfs and dfs in data structure
 
The Evolution of Search
The Evolution of SearchThe Evolution of Search
The Evolution of Search
 
Game Playing in Artificial Intelligence
Game Playing in Artificial IntelligenceGame Playing in Artificial Intelligence
Game Playing in Artificial Intelligence
 
Search engines
Search enginesSearch engines
Search engines
 
Adversarial search
Adversarial searchAdversarial search
Adversarial search
 
Problemas
ProblemasProblemas
Problemas
 
Despierta tu creatividad
Despierta tu creatividad Despierta tu creatividad
Despierta tu creatividad
 
Brochure italfood russia_trk copia
Brochure italfood russia_trk copiaBrochure italfood russia_trk copia
Brochure italfood russia_trk copia
 
Estrategia metodológica para Finanzas I
Estrategia metodológica para Finanzas IEstrategia metodológica para Finanzas I
Estrategia metodológica para Finanzas I
 

More from Ahmed Gad

ICEIT'20 Cython for Speeding-up Genetic Algorithm
ICEIT'20 Cython for Speeding-up Genetic AlgorithmICEIT'20 Cython for Speeding-up Genetic Algorithm
ICEIT'20 Cython for Speeding-up Genetic AlgorithmAhmed Gad
 
NumPyCNNAndroid: A Library for Straightforward Implementation of Convolutiona...
NumPyCNNAndroid: A Library for Straightforward Implementation of Convolutiona...NumPyCNNAndroid: A Library for Straightforward Implementation of Convolutiona...
NumPyCNNAndroid: A Library for Straightforward Implementation of Convolutiona...Ahmed Gad
 
Python for Computer Vision - Revision 2nd Edition
Python for Computer Vision - Revision 2nd EditionPython for Computer Vision - Revision 2nd Edition
Python for Computer Vision - Revision 2nd EditionAhmed Gad
 
Multi-Objective Optimization using Non-Dominated Sorting Genetic Algorithm wi...
Multi-Objective Optimization using Non-Dominated Sorting Genetic Algorithm wi...Multi-Objective Optimization using Non-Dominated Sorting Genetic Algorithm wi...
Multi-Objective Optimization using Non-Dominated Sorting Genetic Algorithm wi...Ahmed Gad
 
M.Sc. Thesis - Automatic People Counting in Crowded Scenes
M.Sc. Thesis - Automatic People Counting in Crowded ScenesM.Sc. Thesis - Automatic People Counting in Crowded Scenes
M.Sc. Thesis - Automatic People Counting in Crowded ScenesAhmed Gad
 
Derivation of Convolutional Neural Network from Fully Connected Network Step-...
Derivation of Convolutional Neural Network from Fully Connected Network Step-...Derivation of Convolutional Neural Network from Fully Connected Network Step-...
Derivation of Convolutional Neural Network from Fully Connected Network Step-...Ahmed Gad
 
Introduction to Optimization with Genetic Algorithm (GA)
Introduction to Optimization with Genetic Algorithm (GA)Introduction to Optimization with Genetic Algorithm (GA)
Introduction to Optimization with Genetic Algorithm (GA)Ahmed Gad
 
Derivation of Convolutional Neural Network (ConvNet) from Fully Connected Net...
Derivation of Convolutional Neural Network (ConvNet) from Fully Connected Net...Derivation of Convolutional Neural Network (ConvNet) from Fully Connected Net...
Derivation of Convolutional Neural Network (ConvNet) from Fully Connected Net...Ahmed Gad
 
Avoid Overfitting with Regularization
Avoid Overfitting with RegularizationAvoid Overfitting with Regularization
Avoid Overfitting with RegularizationAhmed Gad
 
Genetic Algorithm (GA) Optimization - Step-by-Step Example
Genetic Algorithm (GA) Optimization - Step-by-Step ExampleGenetic Algorithm (GA) Optimization - Step-by-Step Example
Genetic Algorithm (GA) Optimization - Step-by-Step ExampleAhmed Gad
 
ICCES 2017 - Crowd Density Estimation Method using Regression Analysis
ICCES 2017 - Crowd Density Estimation Method using Regression AnalysisICCES 2017 - Crowd Density Estimation Method using Regression Analysis
ICCES 2017 - Crowd Density Estimation Method using Regression AnalysisAhmed Gad
 
Backpropagation: Understanding How to Update ANNs Weights Step-by-Step
Backpropagation: Understanding How to Update ANNs Weights Step-by-StepBackpropagation: Understanding How to Update ANNs Weights Step-by-Step
Backpropagation: Understanding How to Update ANNs Weights Step-by-StepAhmed Gad
 
Computer Vision: Correlation, Convolution, and Gradient
Computer Vision: Correlation, Convolution, and GradientComputer Vision: Correlation, Convolution, and Gradient
Computer Vision: Correlation, Convolution, and GradientAhmed Gad
 
Python for Computer Vision - Revision
Python for Computer Vision - RevisionPython for Computer Vision - Revision
Python for Computer Vision - RevisionAhmed Gad
 
Anime Studio Pro 10 Tutorial as Part of Multimedia Course
Anime Studio Pro 10 Tutorial as Part of Multimedia CourseAnime Studio Pro 10 Tutorial as Part of Multimedia Course
Anime Studio Pro 10 Tutorial as Part of Multimedia CourseAhmed Gad
 
Brief Introduction to Deep Learning + Solving XOR using ANNs
Brief Introduction to Deep Learning + Solving XOR using ANNsBrief Introduction to Deep Learning + Solving XOR using ANNs
Brief Introduction to Deep Learning + Solving XOR using ANNsAhmed Gad
 
Operations in Digital Image Processing + Convolution by Example
Operations in Digital Image Processing + Convolution by ExampleOperations in Digital Image Processing + Convolution by Example
Operations in Digital Image Processing + Convolution by ExampleAhmed Gad
 
MATLAB Code + Description : Real-Time Object Motion Detection and Tracking
MATLAB Code + Description : Real-Time Object Motion Detection and TrackingMATLAB Code + Description : Real-Time Object Motion Detection and Tracking
MATLAB Code + Description : Real-Time Object Motion Detection and TrackingAhmed Gad
 
MATLAB Code + Description : Very Simple Automatic English Optical Character R...
MATLAB Code + Description : Very Simple Automatic English Optical Character R...MATLAB Code + Description : Very Simple Automatic English Optical Character R...
MATLAB Code + Description : Very Simple Automatic English Optical Character R...Ahmed Gad
 
Graduation Project - Face Login : A Robust Face Identification System for Sec...
Graduation Project - Face Login : A Robust Face Identification System for Sec...Graduation Project - Face Login : A Robust Face Identification System for Sec...
Graduation Project - Face Login : A Robust Face Identification System for Sec...Ahmed Gad
 

More from Ahmed Gad (20)

ICEIT'20 Cython for Speeding-up Genetic Algorithm
ICEIT'20 Cython for Speeding-up Genetic AlgorithmICEIT'20 Cython for Speeding-up Genetic Algorithm
ICEIT'20 Cython for Speeding-up Genetic Algorithm
 
NumPyCNNAndroid: A Library for Straightforward Implementation of Convolutiona...
NumPyCNNAndroid: A Library for Straightforward Implementation of Convolutiona...NumPyCNNAndroid: A Library for Straightforward Implementation of Convolutiona...
NumPyCNNAndroid: A Library for Straightforward Implementation of Convolutiona...
 
Python for Computer Vision - Revision 2nd Edition
Python for Computer Vision - Revision 2nd EditionPython for Computer Vision - Revision 2nd Edition
Python for Computer Vision - Revision 2nd Edition
 
Multi-Objective Optimization using Non-Dominated Sorting Genetic Algorithm wi...
Multi-Objective Optimization using Non-Dominated Sorting Genetic Algorithm wi...Multi-Objective Optimization using Non-Dominated Sorting Genetic Algorithm wi...
Multi-Objective Optimization using Non-Dominated Sorting Genetic Algorithm wi...
 
M.Sc. Thesis - Automatic People Counting in Crowded Scenes
M.Sc. Thesis - Automatic People Counting in Crowded ScenesM.Sc. Thesis - Automatic People Counting in Crowded Scenes
M.Sc. Thesis - Automatic People Counting in Crowded Scenes
 
Derivation of Convolutional Neural Network from Fully Connected Network Step-...
Derivation of Convolutional Neural Network from Fully Connected Network Step-...Derivation of Convolutional Neural Network from Fully Connected Network Step-...
Derivation of Convolutional Neural Network from Fully Connected Network Step-...
 
Introduction to Optimization with Genetic Algorithm (GA)
Introduction to Optimization with Genetic Algorithm (GA)Introduction to Optimization with Genetic Algorithm (GA)
Introduction to Optimization with Genetic Algorithm (GA)
 
Derivation of Convolutional Neural Network (ConvNet) from Fully Connected Net...
Derivation of Convolutional Neural Network (ConvNet) from Fully Connected Net...Derivation of Convolutional Neural Network (ConvNet) from Fully Connected Net...
Derivation of Convolutional Neural Network (ConvNet) from Fully Connected Net...
 
Avoid Overfitting with Regularization
Avoid Overfitting with RegularizationAvoid Overfitting with Regularization
Avoid Overfitting with Regularization
 
Genetic Algorithm (GA) Optimization - Step-by-Step Example
Genetic Algorithm (GA) Optimization - Step-by-Step ExampleGenetic Algorithm (GA) Optimization - Step-by-Step Example
Genetic Algorithm (GA) Optimization - Step-by-Step Example
 
ICCES 2017 - Crowd Density Estimation Method using Regression Analysis
ICCES 2017 - Crowd Density Estimation Method using Regression AnalysisICCES 2017 - Crowd Density Estimation Method using Regression Analysis
ICCES 2017 - Crowd Density Estimation Method using Regression Analysis
 
Backpropagation: Understanding How to Update ANNs Weights Step-by-Step
Backpropagation: Understanding How to Update ANNs Weights Step-by-StepBackpropagation: Understanding How to Update ANNs Weights Step-by-Step
Backpropagation: Understanding How to Update ANNs Weights Step-by-Step
 
Computer Vision: Correlation, Convolution, and Gradient
Computer Vision: Correlation, Convolution, and GradientComputer Vision: Correlation, Convolution, and Gradient
Computer Vision: Correlation, Convolution, and Gradient
 
Python for Computer Vision - Revision
Python for Computer Vision - RevisionPython for Computer Vision - Revision
Python for Computer Vision - Revision
 
Anime Studio Pro 10 Tutorial as Part of Multimedia Course
Anime Studio Pro 10 Tutorial as Part of Multimedia CourseAnime Studio Pro 10 Tutorial as Part of Multimedia Course
Anime Studio Pro 10 Tutorial as Part of Multimedia Course
 
Brief Introduction to Deep Learning + Solving XOR using ANNs
Brief Introduction to Deep Learning + Solving XOR using ANNsBrief Introduction to Deep Learning + Solving XOR using ANNs
Brief Introduction to Deep Learning + Solving XOR using ANNs
 
Operations in Digital Image Processing + Convolution by Example
Operations in Digital Image Processing + Convolution by ExampleOperations in Digital Image Processing + Convolution by Example
Operations in Digital Image Processing + Convolution by Example
 
MATLAB Code + Description : Real-Time Object Motion Detection and Tracking
MATLAB Code + Description : Real-Time Object Motion Detection and TrackingMATLAB Code + Description : Real-Time Object Motion Detection and Tracking
MATLAB Code + Description : Real-Time Object Motion Detection and Tracking
 
MATLAB Code + Description : Very Simple Automatic English Optical Character R...
MATLAB Code + Description : Very Simple Automatic English Optical Character R...MATLAB Code + Description : Very Simple Automatic English Optical Character R...
MATLAB Code + Description : Very Simple Automatic English Optical Character R...
 
Graduation Project - Face Login : A Robust Face Identification System for Sec...
Graduation Project - Face Login : A Robust Face Identification System for Sec...Graduation Project - Face Login : A Robust Face Identification System for Sec...
Graduation Project - Face Login : A Robust Face Identification System for Sec...
 

Recently uploaded

2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptxMaritesTamaniVerdade
 
Single or Multiple melodic lines structure
Single or Multiple melodic lines structureSingle or Multiple melodic lines structure
Single or Multiple melodic lines structuredhanjurrannsibayan2
 
How to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POSHow to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POSCeline George
 
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Pooja Bhuva
 
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Jisc
 
Towards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptxTowards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptxJisc
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfagholdier
 
Graduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - EnglishGraduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - Englishneillewis46
 
Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...
Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...
Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...pradhanghanshyam7136
 
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...ZurliaSoop
 
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsSalient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsKarakKing
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxPooja Bhuva
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxRamakrishna Reddy Bijjam
 
Exploring_the_Narrative_Style_of_Amitav_Ghoshs_Gun_Island.pptx
Exploring_the_Narrative_Style_of_Amitav_Ghoshs_Gun_Island.pptxExploring_the_Narrative_Style_of_Amitav_Ghoshs_Gun_Island.pptx
Exploring_the_Narrative_Style_of_Amitav_Ghoshs_Gun_Island.pptxPooja Bhuva
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxDenish Jangid
 
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdf
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdfUnit 3 Emotional Intelligence and Spiritual Intelligence.pdf
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdfDr Vijay Vishwakarma
 
Wellbeing inclusion and digital dystopias.pptx
Wellbeing inclusion and digital dystopias.pptxWellbeing inclusion and digital dystopias.pptx
Wellbeing inclusion and digital dystopias.pptxJisc
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...Nguyen Thanh Tu Collection
 
Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jisc
 

Recently uploaded (20)

2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
2024-NATIONAL-LEARNING-CAMP-AND-OTHER.pptx
 
Single or Multiple melodic lines structure
Single or Multiple melodic lines structureSingle or Multiple melodic lines structure
Single or Multiple melodic lines structure
 
How to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POSHow to Manage Global Discount in Odoo 17 POS
How to Manage Global Discount in Odoo 17 POS
 
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
 
Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)Accessible Digital Futures project (20/03/2024)
Accessible Digital Futures project (20/03/2024)
 
Towards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptxTowards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptx
 
Holdier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdfHoldier Curriculum Vitae (April 2024).pdf
Holdier Curriculum Vitae (April 2024).pdf
 
Graduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - EnglishGraduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - English
 
Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...
Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...
Kodo Millet PPT made by Ghanshyam bairwa college of Agriculture kumher bhara...
 
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
Jual Obat Aborsi Hongkong ( Asli No.1 ) 085657271886 Obat Penggugur Kandungan...
 
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functionsSalient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptx
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 
Exploring_the_Narrative_Style_of_Amitav_Ghoshs_Gun_Island.pptx
Exploring_the_Narrative_Style_of_Amitav_Ghoshs_Gun_Island.pptxExploring_the_Narrative_Style_of_Amitav_Ghoshs_Gun_Island.pptx
Exploring_the_Narrative_Style_of_Amitav_Ghoshs_Gun_Island.pptx
 
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
 
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdf
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdfUnit 3 Emotional Intelligence and Spiritual Intelligence.pdf
Unit 3 Emotional Intelligence and Spiritual Intelligence.pdf
 
Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024Mehran University Newsletter Vol-X, Issue-I, 2024
Mehran University Newsletter Vol-X, Issue-I, 2024
 
Wellbeing inclusion and digital dystopias.pptx
Wellbeing inclusion and digital dystopias.pptxWellbeing inclusion and digital dystopias.pptx
Wellbeing inclusion and digital dystopias.pptx
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
 
Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)
 

AI Uninformed Search Strategies by Examples