Please enable JavaScript.

Coggle requires JavaScript to display documents.

Problem Solving (Problem Formulationtext (An initial state (state from…

- - - - Use only the information available in the problem definition
      - Breadth-first search
        
        Expand shallowest unexpanded node
      - Uniform-cost search
        
        Expand least-cost unexpanded node
      - Iterative deepening search
        
        Depth-first search with depth limit
      - Depth-first search
        
        Expand deepest unexpanded node
    - - generates the search tree using domain specific knowledge
      - Best First Search
        
        usually gives an estimates to goal
      - Greedy Best First Search
        
        Expands the node that seems to be closest to the goal
        node.
  - - - An algorithm is said to be complete if it definitely finds solution to the problem, if exist.
    - - How long does it take to find a solution? Usually measured in
        terms of the number of nodes expanded
    - - How much space is used by the algorithm? measured in terms of maximum number of nodes in memory at a time.
    - - If a solution is found, is it guaranteed to be an optimal one?