radarfor.blogg.se

Move the bottom disk to the destination peg. Let us prove that the number of steps in 2 𝑁−1 For a given 𝑁 number of disks, the way to accomplish the task in a minimum number of steps is: Move the top 𝑁−1 disks to an intermediate peg. So, the number of steps almost double every time you insert another disk in the stack. Number of moves =15 Tower of Hanoi maths explainedīy now, you might have identified that to move N disks from one peg to another, you need 2 𝑁−1. Move disc 3 from peg t to peg d move disc 1 from peg s to peg t Move disc 2 from peg t to peg s move disc 1 from peg d to peg s Move disc 4 from peg s to peg d move disc 1 from peg t to peg d #include void TofH(int,char,char,char,int*) int main() # You can easily move this stack from peg B to any other peg using these 3 steps. Then move disk 2 from peg A to peg B and, finally, move disk 1 from peg C to peg B. The target is to move both these disks to peg B. Take an example with 2 disks: Disk 1 on top of Disk 2 at peg A. Let’s try to solve a puzzle – Tower of Hanoi using recursion. No disk can be placed on top of the smaller disk.The objective of the puzzle is to move the stack to another peg following these simple rules. Tower of Hanoi consists of three pegs or towers with n disks placed one over the other.