Tower of Hanoi

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 them all stacked on the last peg.

Parameters

$n$ : number of discs
$p$ : number of pegs

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 5 of 5 algorithms


Hanoi graph	2008	$O(3^n)$	$O(3^n)$
Iteration based	1883	$O(2^n)$	$O(n)$
Recursion based	1883	$O(2^n)$	$O(n \log n)$
Non-recursion based	1883	$O(2^n)$	$O(n)$
Gray-code based	1883	$O(2^n)$	$O(n)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms