luc051.c

Metadata

• Author — Amit Dutta
• Last updated — 08 Feb 2026
• License — MIT License (See the LICENSE file for details)

Problem Statement

Problem Statement

Tower of Hanoi: Write a program to print out the sequence in which 4 disks should be moved from peg A to peg C using peg B.

Source Code

View on GitHub Download Raw

Printing the code

To print this file, open it on GitHub and click Raw before printing, or use the Download Raw button above and print directly from that page.

#include <stdio.h>
#include <math.h>
#include <stdlib.h>

void hanoi(int, char, char, char);

int main()
{
    int n = 4; 

    printf("Sequence of moves for %d disks:\n\n", n);
    hanoi(n, 'A', 'B', 'C');

    return 0;
}

void hanoi(int n, char from_rod, char aux_rod, char to_rod)
{
    if (n == 1)
    {
        printf("Move disk 1 from rod %c to rod %c\n", from_rod, to_rod);
        return;
    }
    hanoi(n - 1, from_rod, to_rod, aux_rod);
    printf("Move disk %d from rod %c to rod %c\n", n, from_rod, to_rod);
    hanoi(n - 1, aux_rod, from_rod, to_rod);
}