টাওয়ার অব হানয়

সমাধান

সুডোকোডে আলগরিদম

 A = [5,4,3,2,1]
 B = []
 C = []
 
 def move(n, source, target, auxiliary):
 <nowiki> </nowiki> if n > 0:
 <nowiki> </nowiki> # move n-1 disks from source to auxiliary, so they are out of the way 
 <nowiki> </nowiki> move(n-1, source, auxiliary, target)
 
 <nowiki> </nowiki> # move the nth disk from source to target
 <nowiki> </nowiki> target.append(source.pop())
 
 <nowiki> </nowiki> # Display our progress
 <nowiki> </nowiki> print(A, B, C, '##############', sep='\n') 
 <nowiki> </nowiki> 
 <nowiki> </nowiki> # move the n-1 disks that we left on auxiliary onto target
 <nowiki> </nowiki> move(n-1, auxiliary, target, source)
 
 <nowiki>#</nowiki> initiate call from source A to target C with auxiliary B 
 move(5, A, C, B)

সি++ কোড

#include<iostream>
usingnamespacestd;
voidtower_hannoi(intdisk,chartower1,chartower2,chartower3)
{
if(disk==1)
{
cout<<"Move disk "<<disk<<" from "<<tower1<<" to "<<tower3<<endl;
}
else
{
tower_hannoi(disk-1,tower1,tower3,tower2);
cout<<"Move disk "<<disk<<" from "<<tower1<<" to "<<tower3<<endl;
tower_hannoi(disk-1,tower2,tower1,tower3);
}
}
intmain()
{
intdisk;
chartower1='A';
chartower2='B';
chartower3='C';
cin>>disk;
tower_hannoi(disk,tower1,tower2,tower3);
return0;
}

পাইথন কোড

def hanoi(n, a='A', b='B', c='C'): 
 if n == 1:
 print('move', a, '-->', c)
 return
 hanoi(n-1, a, c, b)
 print('move', a, '-->', c)
 hanoi(n-1, b, a, c)
print(hanoi(5))

গ্যালারি

তথ্যসূত্র

1. ↑ Hofstadter, Douglas R. (১৯৮৫)। Metamagical themas : questing for the essence of mind and pattern। Internet Archive। New York : Basic Books। আইএসবিএন 978-0-465-04540-2। 

বহিঃসংযোগ