ConceptAI & ML
Backtracking search
A search algorithm for CSPs that builds a solution incrementally by assigning values to variables and backtracking when a constraint is violated.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Pieter Abbeel
Hal Abelson & Gerald Jay Sussman
A standard AI algorithm paradigm that incrementally builds candidates to a problem, and abandons a candidate ("backtracks") as soon as it determines the candidate cannot possibly be completed to a valid solution.Brian Yu
A search algorithm that builds assignments incrementally and reverses course ("backtracks") when it encounters a dead end that violates constraints.
Lectures that assume it
1Connections
14The lectures that define it or assume it, and the concepts next to it.