X solves the tower of Hanoi problem, first with n disks in time t1 and then with n+2 disks in time t2. Assuming he takes same amount of time for each disk move and solves the problem in least steps possible, the relation between t1 and t2 is:
A. t2=t1+2 B. t2=2t1+2 C. t2=3t1+2 D. t2=4t1+3
Answers
Answered by
0
Minimum number of moves required in solving a Tower of Honoi problem with n disks is
If he takes same amount of time for each disk move and solves the problem in least steps possible,
where k is some constant. and
Relation between the times are:
Correct answer is D.
If he takes same amount of time for each disk move and solves the problem in least steps possible,
where k is some constant. and
Relation between the times are:
Correct answer is D.
Similar questions