05_uninformed_search2013

Frontier if node contains goal state then return

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: add resulting nodes to the frontier Metrics for comparing search strategies n༆  n༆  A strategy is defined by the order of node expansion. Problem-solving performance is measured in four ways: Completeness: Does it always find a solution if one exists? Optimality: Does it always find the least-cost solution? q༇  Time Complexity: Number of nodes generated/expanded. q༇  Space Complexity: Number of nodes stored in memory during search. Time and space complexity are measured in terms of: q༇  b - maximum branching factor of the search tree q༇  d - depth of the least-cost solution q༇  m - maximum depth of the state space (may be ∞) n༆  n༆  n༆  n༆  n༆  Uninformed search strategies n༆  q༇  q༇  n༆  State Parent Action (the action that got us from the parent) Depth Path-Cost n༆  a.k.a. blind search = use only information available in problem definition. q༇  When strategies can determine whether one non-goal state is better than another...
View Full Document

This note was uploaded on 02/10/2014 for the course CS 440 taught by Professor Staff during the Fall '08 term at Colorado State.

Ask a homework question - tutors are online