Please enable JavaScript.
Coggle requires JavaScript to display documents.
Types of searching algorithms (Uniform Search (Uniform cost search,…
-
-
-
-
Usually passes the return value as a parameter , move at depth , start search and then return at back
-
This is the best way to search problem, BFS process any items while expanding , choose, minimum cost
Try to correct as much, search through a tree one leave at a time horizontally.
Its find a shortest path through graph on two direction at a same time, one forward from the initial state and other backward from the goal
Real time problem-solving in dynamic environment. , before start select the no of paths , solve infinite path problem
-
-