Informed and Uninformed Search
- If a search algorithm makes an attempt to evaluate a search
tree state's children by comparing them with respect to the goal, it
is informed
- If a search algorithm is not informed, it is uninformed
or blind
- Breadth-first and depth-first graph search and state space search are
uninformed
- Informed search requires the concept of an evaluation function