Sign inSign in
ConceptSystems & CS

Towers of Hanoi

A game and recursive problem where n disks must be moved between spikes following specific rules.
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.

Recursion2Wishful thinking1Wishful thinking in problem-solving1

Lecturers

1
  • Hal Abelson & Gerald Jay Sussman

    MIT · Undergraduate

    • 47:18Procedures and Processes; Substitution Model (SICP Lecture 1b)

Connections

4

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

Concepts2

Lectures2

1 lecturer. 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.