Sign inSign in
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.
as Pieter Abbeel defines itUC BerkeleyThe wording closest to all 4 definitions
Watch it explained

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

3

Each in their own terms, from the easiest level.

  • Pieter Abbeel

    UC Berkeley · Undergraduate

    • 35:14Constraint Satisfaction Problems (CSPs) Part 1/2
  • Hal Abelson & Gerald Jay Sussman

    MIT · Undergraduate

    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

    Harvard University · Undergraduate

    A search algorithm that builds assignments incrementally and reverses course ("backtracks") when it encounters a dead end that violates constraints.
    • 6:51:09Harvard CS50’s Artificial Intelligence with Python – Full University Course

Lectures that assume it

1

Connections

14

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.