Uninformed Search

perception (+ memory)
no consideration of the consequences

quick response
not rational (optimal)

the space is too large!

we want to search as small as possible, yet find the destination

fringe: frontier nodes to be explored

a small search tree actual search tree

actual search tree is too large!

(note: the graph has no circle)

next: the direction of search

randomly pick one, if no heuristic

DFS: better memory properties (much less memory usage)
BFS: good at finding an optimal solution

The last layer of BFS is too large!

~> optimal cost
~> minimal cost for each step