Tower of Hanoi - A Graphical Representation - Computer Graphics Source Code in C++

Special : Web Developer's Collection CD-ROM
50,000+ Web Templates, Logos, Cliparts, Scripts. Order Now!

Add to Favorites Make Home Page

22033 Online

Language Categories

Source Codes Home
Project Ideas New!
Interview Questions
FAQs Home
ASP Home: ASP Source Codes; ASP Script Directory New!; ASP .Net Script Directory New!; ASP Interview Questions; ASP FAQs; ASP How Tos
C Home: C Source Codes; C Script Directory New!; C Interview Questions; C FAQs; C How Tos
C++ Home: C++ Source Codes; C++ Script Directory New!; C++ Interview Questions; C++ FAQs; C++ How Tos
Java Home: Java Source Codes; Java Directory New!; Java Interview Questions; Java FAQs; Java How Tos
JavaScript Home: JavaScript Directory New!; JavaScript Source Codes; JavaScript FAQs; JavaScript How Tos
COBOL Home: COBOL Source Codes; COBOL FAQs; COBOL How Tos
Pascal Home: Pascal Source Codes; Pascal FAQs; Pascal How Tos
PHP Script Directory New!
Python Script Directory New!
Perl & CGI Script Directory New!
Flash Script Directory New!
CFML Script Directory New!
Remotely Hosted Scripts New!
Tools & Utilities Directory New!
XML Script Directory New!
Best Programmers: Amit Mathur; Vishal Bhardwaj; Deepesh Jain
Vyom NetWork

Our Services

Get 9,000 Interview Questions & Answers in an eBook.

9500+ Pages
9000 Question & Answers
All Tech. Categories

14 MB Content

Get it now !!

Home » C++ Home » Computer Graphics Home » Tower of Hanoi - A Graphical Representation

A D V E R T I S E M E N T

Title	Tower of Hanoi - A Graphical Representation
Author	Rakesh Juyal
Author Email	Rakesh_In_Uk [at] Yahoo.com
Description	Tower of Hanoi Graphical Representation.
Category	C++ » Computer Graphics
Hits	392801
Code	Select and Copy the Code
// Towers Of Hanoi // // By: Rakesh Juyal // // I.T.S. Mohan Nagar, Gzb // // mailme: juyalrules@yahoo.com // // mailme: rakesh@mindless.com // // [ You can use more than 10 Disks too, just change the value of MAX ] // #include <graphics.h> #include <stdlib.h> #include <stdio.h> #include <conio.h> #define MAX 12 #define BegPos 105 #define AuxPos 305 #define EndPos 505 int width; typedef struct disc { char val1[MAX]; char top,pos; }; void push(disc tt,int x); pop(disc tt); void tower(int,disc ,disc ,disc ); void draw_stack(disc beg,disc ,disc ); int main(void) { int gdriver = DETECT, gmode, errorcode; int i,x=2; disc beg,end,aux; printf(" TOWER OF HANOI "); printf("======================================================="); printf(" How Many Disks[1-10]:- "); scanf("%d",&x); initgraph(&gdriver, &gmode, "d:\TC\BGI"); errorcode = graphresult(); if (errorcode != grOk) { printf("Graphics error: %s ", grapherrormsg(errorcode)); printf("Press any key to halt:"); getch(); exit(1); } width=50/x; beg.top=end.top=aux.top=0; beg.pos=1;end.pos=3;aux.pos=2; for(i=0;i<x;i++) push(&beg,(x-i)+1); draw_stack(&beg,&end,&aux); tower(x,&beg,&end,&aux); closegraph(); return 0; } void tower(int n,disc beg,disc aux,disc end) { if(n>0) / { push(end,pop(beg)); draw_stack(beg,end,aux); } else/ { tower(n-1,beg,end,aux); push(end,pop(beg)); draw_stack(beg,end,aux); tower(n-1,aux,beg,end); } // } void push(disc tt,int x) { tt->val1[tt->top]=x; tt->top++; } pop(disc tt) { int a; tt->top--; a=tt->val1[tt->top]; tt->val1[tt->top]=0; return a; } void draw_stack(disc beg,disc end,disc aux) { int ypos=295,i,height=10,xpos; int ver=0; cleardevice(); setfillstyle(1,2); bar(20,300,580,310); bar(100,100,110,300); bar(300,100,310,300); bar(500,100,510,300); rectangle(20,300,580,310); rectangle(100,100,110,300); rectangle(300,100,310,300); rectangle(500,100,510,300); /* END TOWER/ ypos=295; if(end->pos==1) xpos=BegPos; else if(end->pos==2) xpos=AuxPos; else if(end->pos==3) xpos=EndPos; for(i=0;i<end->top;i++) { setfillstyle(end->val1[i],end->val1[i]); bar(xpos-(end->val1[i]width),ypos,xpos+(end->val1[i]width),ypos-height); rectangle(xpos-(end->val1[i]width),ypos,xpos+(end->val1[i]width),ypos-height); ypos-=(height+2); } ver=end->pos; / BEG TOWER/ if(beg->pos==1) xpos=BegPos; else if(beg->pos==2) xpos=AuxPos; else if(beg->pos==3) xpos=EndPos; ypos=295; for(i=0;i<beg->top;i++) { setfillstyle(beg->val1[i],beg->val1[i]); bar(xpos-(beg->val1[i]width),ypos,xpos+(beg->val1[i]width),ypos-height); rectangle(xpos-(beg->val1[i]width),ypos,xpos+(beg->val1[i]width),ypos-height); ypos-=(height+2); } / AUX TOWER/ ver=ver10+beg->pos; if(ver<20) { if(ver%10==2) xpos=EndPos; else xpos=AuxPos; } else if(ver<30) { if(ver%10==1) xpos=EndPos; else xpos=BegPos; } else if(ver<40) { if(ver%10==1) xpos=AuxPos; else xpos=BegPos; } ypos=295; for(i=0;i<aux->top;i++) { setfillstyle(aux->val1[i],aux->val1[i]); bar(xpos-(aux->val1[i]width),ypos,xpos+(aux->val1[i]width),ypos-height); rectangle(xpos-(aux->val1[i]width),ypos,xpos+(aux->val1[i]width),ypos-height); ypos-=(height+2); } getch(); }

Related Source Codes

Script Name Author

Moving ball screen saver karlmarx

The Classic Game of Snake & Ladder Lakshmi Narayana .A

Railway seat reservation question which comes in sapient VyomWorld

To calculate percentile Ravi Mathur

Send to folder ANIMESH SAHU

Analog clock and calendar Nazia & Rida

HIGH/LOW GAME MOLLY ARORA

Data structure (stack Implimentation) Swapnil B Adsure

Memory Game AnirudhSanyal

Easy Calc Anirudh Sanyal

GK Quiz Anirudh Sanyal

Hangman Game Manish Jain

Snakeman Manish Jain

Full month Calendar Nigi

Cursor shapes nigi

A D V E R T I S E M E N T

Google Groups Subscribe to SourceCodesWorld - Techies Talk

Email:

Free eBook - Interview Questions: Get over 1,000 Interview Questions in an eBook for free when you join JobsAssist. Just click on the button below to join JobsAssist and you will immediately receive the Free eBook with thousands of Interview Questions in an ebook when you join.

Free Tutorials - HTML, Java, SQL, PHP, ASP, Perl, SQL Tutorials
Discuss Programming Problems and Freshers Jobs related issues here.
Discuss Final Year Project Ideas here.

Advertisements

L I N K S

Jobs & Career: Freshers Jobs; Jobs Newsletter; Placement Papers; Placement Papers
GATE Preparation: Analysis & Design Of Algo.; Operating System; Lexical Analysis
GRE Preparation: GRE Home; 1208 Antonyms Test; 5000 Word's List; Top 100 Words' List; Scholarships; Top 100 CS Univ.; Top 126 EE Univ.
Tutorials: Hardware Tutorial; 1500 Free eBooks; XML Tutorial
Webmaster Resources: EzTraffic; Articles
Fun: Send FREE SMS!; SMS Jokes; Love SMS; Funny Jokes

Google Search

Source Codes World.com is a part of Vyom Network.

Sitemap | Privacy Policy | Terms and Conditions | Important Websites
Copyright ©2003-2024 SourceCodesWorld.com, All Rights Reserved.
Page URL: http://www.sourcecodesworld.com/source/show.asp?ScriptID=822