Question

The minimum number of moves in the tower of haoni problem is

Answer 1

1. The puzzle can be played with any number of disks, although many toy versions have around 7 to 9 of them.
2. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.

$accurate answer ☑️$

$MARK \: \: AS \: \: BRAINLIEST$

Answer 2

$\huge{\mathtt{{\blue{\boxed{\tt{\pink{\orange{A}\purple{n}\blue{s}\red{w}\green{e}\pink{r᭄}}}}}}}}$

$2^{n}-1$$\text{is the minimal no of moves to solve the Tower of Hanoi.}$

$\large\mathsf\color{lightgreen}useful?\: \color{white}\longrightarrow\: \color{orange}brainliest!$