The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
0 votes
The tower of Hanoi puzzle with n (n > 1) different dimensional disks stacked on peg A in the decreasing order of their size with largest dimensional disk at the bottom and smallest dimensional disk at the top.
The disks are to be transferred from peg A to Peg B using peg C with one disk at a time such that under no circumstance larger disk should be stacked on smaller disk. The total between attributes number of disk transfers is given by 
  1. 2T(n − 1) +2
  2. 2T(n-1) + 1 
  3. T(n-1) +T(n − 2)
  4. 2T(n)
in Others by Veteran (400k points) | 0 views

Please log in or register to answer this question.

Related questions

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
49,781 questions
53,593 answers
70,880 users