Please enable JavaScript.
Coggle requires JavaScript to display documents.
Uniformed Search Strategies, :star:Expand the shallowest expanded node.
…
-
-
:star:Always expand deepest node current search tree.
:star:Searching tree or graph data structures.
:star:The algorithm starts at the root node the each branches before backtracking.
:star:Expanding the lowest cost node.
:star:BFS path cost are always equal.
Implementation:The fringe is a priority queue:lowest cost node has the highest priority.
:star:General strategy often used in combination with depth first tree search.
:star:When the optimal path cost is non-decreasing function depth of node.
-
:star:Finding the graph search algorithm smallest path form source to goal vertex & it runs two simultaneous search.
:star: Both forward from the initial state and backward from the goal hoping searches meet in the middle.