Tower of Hanoi: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 11:2611:26, 15 February 2023‎ Admin talk contribs‎ 1,798 bytes +1,798‎ Created page with "{{DISPLAYTITLE:Tower of Hanoi (Tower of Hanoi)}} == Description == The Tower of Hanoi puzzle consists of $n$ discs, no two of the same size, stacked on $p \geq 3$ vertical pegs, in such a way that no disc lies on top of a smaller disc. A permissible $move$ is to take the top disc from one of the pegs and move it to one of the other pegs, as long as it is not placed on top of a smaller disc. Initially, they are all stacked on the first peg. The goal is to end up with th..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Tower_of_Hanoi"