`luc051.c`¶

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.

Metadata¶

Property	Detail
Author	Amit Dutta amitdutta4255@gmail.com
Date	08 Feb 2026
License	MIT License (See the LICENSE file for details)
Difficulty	Beginner (index: 1 / 10)

Concepts¶

Beta Feature

This concept detection system is still in beta and may occasionally show incorrect or incomplete results.

Recursion

Actions¶

Raw View on GitHub

You can print or save this file by opening Raw and using your browser.

Source Code¶

#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);
}

Explanation¶

Explain with AI

Copy the prompt below and paste it into any AI assistant.

    You are explaining a C programming code to a beginner.

    STRICT RULES:

    - Only use the given code. Do NOT assume anything not present.

    - Do NOT add extra examples.

    - Keep explanation clear and short.

    - If something is unclear, say "Not clear from code".

    - Follow the exact format below. Do NOT change headings.

    FORMAT:

    [START]

    ## What it does

    (Explain the overall purpose in 1-2 sentences)

    ## Step-by-step

    (Explain how the code works in steps, simple language)

    ## Key Concepts

    (List concepts like loop, condition, function, etc.)

    ## Notes

    (Mention any limitations, errors, or assumptions)

    [END]

    CODE (luc051.c):

    #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);
    }

luc051.c¶