Current Slide
Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
Best-First Search: Algorithm
List open, closed, successors={};
Node root_node, current_node;
insert-last(
root_node,open)
while not-empty (open );
-
current_node= remove-first(open);
insert-last ( current_node,closed);
if ( goal (current_node)) return current_node;
else
-
successors=
estimationOrderedSuccessorsOf
(current_node);
for(x in successors)
- if(
not-in
(x,closed))
insert-last
(x,open);
estimationOrderedSuccessorsOf
returns the list of direct
descendants of the current
node in shortest cost order
N.B.= this version is not saving the path for simplicity
Speaker notes:
Content Tools
Tools
Sources (0)
Tags (0)
Comments (0)
History
Usage
Questions (0)
Playlists (0)
Quality
Sources
There are currently no sources for this slide.