Breaking News: Grepper is joining You.com. Read the official announcement!

Tower of Hanoi using recursion

Add Answer

Unusual Unicorn answered on August 14, 2022 Popularity 9/10 Helpfulness 1/10

answer Tower of Hanoi using recursion

related tower of hanoi c++ using recursion

Tower of Hanoi using recursion

Comment

-1

// C++ recursive function to 
// solve tower of hanoi puzzle 
#include <bits/stdc++.h>
using namespace std;
  
void towerOfHanoi(int n, char from_rod,
                    char to_rod, char aux_rod) 
{ 
    if (n == 0) 
    {
        return; 
    } 
    towerOfHanoi(n - 1, from_rod, aux_rod, to_rod); 
    cout << "Move disk " << n << " from rod " << from_rod <<
                                " to rod " << to_rod << endl; 
    towerOfHanoi(n - 1, aux_rod, to_rod, from_rod); 
} 
  
// Driver code
int main() 
{ 
    int n = 4; // Number of disks 
    towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods 
    return 0; 
} 
  
// This is code is contributed by rathbhupendra

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: www.geeksforgeeks.org

Tags: recursion using whatever

Link to this answer
Share Copy Link

Contributed on Aug 14 2022

Unusual Unicorn

0 Answers Avg Quality 2/10

Closely Related Answers

tower of hanoi c++ using recursion

Comment

/*Intitial	|| 1	|| 2	|| 3	Goal	|| 1	|| 2	|| 3
  		   ----     ||		||				||		||	   ----
  		  ------	||      ||              ||      ||    ------
  		 --------   ||      ||   			||      ||  ----------

Rule 1: One Disc Can Be Moved At A Time
RUle 2: At An Instance No Bigger Disc Should Be Above Smaller Disc
*/

// Tower of hanoi using recursion
#include <iostream>
using namespace std;

void TOH(int n, int A, int B, int C){
    if(n>0){
        TOH(n-1,A,C,B);
        cout << A << " , " << C << endl;
        TOH(n-1,B,A,C);
    }
}
/*
n = Number Of Disc
A = Source
B = Helper
C = Destination
*/
int main() {
    
    TOH(3,1,2,3);
    return 0;
}

Popularity 8/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++ recursion recursio

Link to this answer
Share Copy Link

Contributed on Feb 06 2023

isuro

0 Answers Avg Quality 2/10

Tower of Hanoi using recursion

Contents

More Related Answers

Tower of Hanoi using recursion

Closely Related Answers

tower of hanoi c++ using recursion

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.