Module
Uninformed Search
Sign in to add this module to your path and practice.
About
State-space formulation, BFS, DFS, iterative deepening, uniform-cost search; completeness, optimality, time/space trade-offs.
Goal
Given a problem, formulate states/actions/goal test/path cost; implement and compare uninformed algorithms on grid/pathfinding and puzzle domains; prove/argue completeness and optimality.
Unlocks
Tutor
Ask questions about this module.
Hi — I'm your tutor for Uninformed Search. Ask about the concepts, goal, or where you're stuck.