'প্রযুক্তিতে নতুনের ছোঁয়া'

Tower of Hanoi

<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: center;">
::Tower of Hanoi ::</h2>
<div style="text-align: center;">
<div style="text-align: left;">
The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower,[1] and sometimes pluralized) is amathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape</div>
</div>
<div style="text-align: center;">
. </div>
<div style="text-align: center;">
<img border="0" height="175" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgBg-fJU4k1Ymag-1XXiOBqWCuXfLJv1eziu_z30ddH-EwbnfxO_cb-9zUBltWEps0CZOLNV51dg7TDJhxeioHcoPhvGPnm-aD9E7Q58YGCvEup6El7_bclH8cnUroHKyNOAuQhoeubvY4g/s1600/Tower_of_Hanoi.jpeg" width="400" />

</div>
<div style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px; margin-bottom: 0.5em; margin-top: 0.5em;">
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:</div>
<ol style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px; list-style-image: none; margin: 0.3em 0px 0px 3.2em; padding: 0px;">
<li style="margin-bottom: 0.1em;">Only one disk can be moved at a time.</li>
<li style="margin-bottom: 0.1em;">Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.</li>
<li style="margin-bottom: 0.1em;">No disk may be placed on top of a smaller disk.</li>
</ol>
<div style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px; margin-bottom: 0.5em; margin-top: 0.5em;">
With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2<sup style="font-size: 11.1999998092651px; line-height: 1;"><i>n</i></sup> - 1, where <i>n</i> is the number of disks.</div>
<div style="background-color: white; color: #252525; font-family: sans-serif; font-size: 14px; line-height: 22.3999996185303px; margin-bottom: 0.5em; margin-top: 0.5em;">
<br /></div>
<br />
<div style="text-align: center;">
<img border="0" height="155" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjqshUUkCwTImb-YMwKx4BMlc_lKXy5KWFt-yS8Tw4s2851AUTB4brJmYs6FaU6mJYzIAQzJSS-UosSR7A-54e-h19bKN0l5xStWpIu3uXJZEx2vHzh2wNgFNT-SpUAuQZVih0rf7Z0Rt8w/s1600/300px-Tower_of_Hanoi_4.gif" width="400" />
</div>
<pre class="brush:cpp;"> 
#include <iostream>
 using namespace std;
void towers(int, char, char, char);

int main()
{
    int num;

cout<<"Enter the number of disks : "<<endl;
    cin>>num;
    cout<<"The sequence of moves of the Tower of Hanoi are :\n"<<endl;
    towers(num, 'A', 'C', 'B');
    return 0;
}
void towers(int num, char A, char B, char C)
{
    if (num == 1)
    {
        cout<<"\nMove disk "<<num<<" from peg "<< A<<" to peg "<< B<<endl;
        return ;
    }
    towers(num - 1, A, C, B);

cout<<"Move disk "<< num <<" from peg "<< A<<" to peg "<<B;
    towers(num - 1, C, B, A);
}

</pre>
<h2 style="text-align: center;">
::Output ::</h2>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi-rmgQBwiw0QNRhEWkJCuEoWtW7Gymuu7LEiv-S86nFQSZ3HlbuSwFHsdQypHsm4YAPOrLLQPJqBRiZhc9pDCLOJwTiBOT9vkAQm2WQn6W35AftuNP-QDv7YlwX0AtCtOP_DQ7klfBN5_9/s1600/Screenshot_4.png" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" height="295" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi-rmgQBwiw0QNRhEWkJCuEoWtW7Gymuu7LEiv-S86nFQSZ3HlbuSwFHsdQypHsm4YAPOrLLQPJqBRiZhc9pDCLOJwTiBOT9vkAQm2WQn6W35AftuNP-QDv7YlwX0AtCtOP_DQ7klfBN5_9/s1600/Screenshot_4.png" width="400" /></a></div>
<div>
<br /></div>
</div>