Tower of Hanoi - Classic Problems | Repovive

CLS35. Tower of Hanoi

1s256 MB

The Tower of Hanoi puzzle has three pegs A, B, C and $n$ disks of different sizes stacked on peg A (largest at bottom, smallest at top).

Move all disks from peg A to peg C using peg B as auxiliary, following these rules:

Print the sequence of moves. Each move is two characters: source peg followed by destination peg.

$n$

\begin{array}{l} move_1 \\ move_2 \\ \vdots \\ move_{2^n-1} \end{array}

move_i \in \{\texttt{AB}, \texttt{AC}, \texttt{BA}, \texttt{BC}, \texttt{CA}, \texttt{CB}\}

Input

Explanation

For this input, the required output is AC.

Output

AC

Input

Explanation

For this input, the required output is AB AC BC.

Output

AB
AC
BC

Input

Explanation

For this input, the required output is AC AB CB AC BA BC AC.

Output

AC
AB
CB
AC
BA
BC
AC

The Tower of Hanoi puzzle has three pegs A, B, C and $n$ disks of different sizes stacked on peg A (largest at bottom, smallest at top).

Move all disks from peg A to peg C using peg B as auxiliary, following these rules:

Print the sequence of moves. Each move is two characters: source peg followed by destination peg.

$n$

\begin{array}{l} move_1 \\ move_2 \\ \vdots \\ move_{2^n-1} \end{array}

move_i \in \{\texttt{AB}, \texttt{AC}, \texttt{BA}, \texttt{BC}, \texttt{CA}, \texttt{CB}\}