Problem Solving and Uninformed Search

AI, Artificial and Computational Intelligence

AI, ACI, Problem Solving, Uninformed Search, BFS, DFS, UCS, IDS

Problem Solving and Uninformed Search #

A problem-solving agent converts a goal into a precisely defined search problem. An uninformed search algorithm then explores the state space using only the information in that problem definition.

Problem Solving Agent
Problem Formulation - Examples
From Uninformed to Informed Search Algorithms

Learning Objectives #

formulate a search problem using five components
distinguish a state-space graph from a search tree
explain nodes, frontiers and node expansion
compare tree search with graph search when states repeat
compare BFS, DFS, UCS, DLS and IDS
select an appropriate uninformed strategy for a problem
distinguish offline and online search

Big Picture #

flowchart TD
    G["Goal"] --> F["Formulate problem"]
    F --> S["Search for actions"]
    S --> X["Execute solution"]

    style G fill:#E1F5FE
    style F fill:#C8E6C9
    style S fill:#FFF9C4
    style X fill:#EDE7F6

1. Problem-Solving Agents ☆ #

A problem-solving agent normally follows three stages: