The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+6 votes
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$
asked in DS by Veteran (57.4k points)
edited by | 288 views
just 4 level + 2 level traverse
what is the answer?
it should be $X$ to $Y$ ( for $128$th move)   and $Z$ to $Y$ ( for $768$th move).

1 Answer

+7 votes
Best answer

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}$

answered by Veteran (57.4k points)
selected by

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,831 questions
36,676 answers
34,638 users