bidvertiser01

Monday, November 25, 2013

C code for Tower of Hanoi Problem.

#include "stdio.h"

void towers(int,char,char,char);

void towers(int n,char frompeg,char topeg,char auxpeg)
 { /* If only 1 disk, make the move and return */
   if(n==1)
     { printf("\nMove disk 1 from peg %c to peg %c",frompeg,topeg);
       return;
     }
   /* Move top n-1 disks from A to B, using C as auxiliary */
   towers(n-1,frompeg,auxpeg,topeg);
   /* Move remaining disks from A to C */
   printf("\nMove disk %d from peg %c to peg %c",n,frompeg,topeg);
   /* Move n-1 disks from B to C using A as auxiliary */
   towers(n-1,auxpeg,topeg,frompeg);
 }
main()
 { int n;
   printf("Enter the number of disks : ");
   scanf("%d",&n);
   printf("The Tower of Hanoi involves the moves :\n\n");
   towers(n,'A','C','B');
   return 0;
 }
OutPut IN TC is as follows:
Programming Geeks : Towers of Hanoi

5 comments:

  1. Please elaborate "What is / are Uninformed Search and Informed Search" With example or reference link/book.

    ReplyDelete
  2. Please Elaborate "What is and are : Uninformed Search and Informed Search with example / reference link/ book."

    ReplyDelete
  3. How can I get in touch of the author of this paper?
    ThomasRoberts@Reagan.com

    ReplyDelete
  4. How can I get in touch with the Author of this paper on ANN.

    ReplyDelete

  5. This is great revealing content. Thank you I really appreciate the unique articles you write. makoprogram provide this
    Speech recognition programs like dragon

    ReplyDelete