167 views
In the tower of Hanoi $x , y , z$ are the positions and we are to move 10 disks from $x$ to $y$. What are the $128$th and $768$th moves ?

(A) $x\rightarrow y$ and $x\rightarrow z$

(B) $x\rightarrow z$ and $z\rightarrow x$

(C) $x\rightarrow z$ and $z\rightarrow y$

(D) $x\rightarrow y$ and $z\rightarrow y$
edited | 167 views
just 4 level + 2 level traverse
it should be $X$ to $Y$ ( for $128$th move)   and $Z$ to $Y$ ( for $768$th move).
......

H(n,x,y,z) means currently we have 10 disks on x and we need to move all of them from x to y using z.

$H(n,x,y,z) \text{ needs } (2^{n} - 1) \text{ moves using recursion}$

selected