Snake and Ladder Table - Games and 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

1180 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 » Games and Graphics Home » Snake and Ladder Table

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

Title	Snake and Ladder Table
Author	Dinesh Kumar
Author Email	dineshbillawa [at] rediffmail.com
Description	This is a program for displaying Snake and Ladder table
Category	C » Games and Graphics
Hits	396400
Code	Select and Copy the Code
Code : /* Snake and Ladder Table --DINESH KUMAR */ #include<stdio.h> #include<graphics.h> #include<conio.h> void main() { int i=0,j=0,k=5; int gd=DETECT,gm; void ladder1(); void ladder2(); void snake1(); void snake2(); void snake3(); void numbering(); initgraph(&gd,&gm,"c:\tc\bgi"); for(i=0;i<=360;i+=40) for(j=0;j<=360;j+=40) { setfillstyle(1,k); bar(50+j,30+i,90+j,70+i); k+=2; } ladder1(); ladder2(); snake1(); snake2(); snake3(); numbering(); getch(); } void ladder1() { int m,n; for(m=0;m<=250;m+=250) for(n=0;n<=m;n+=250) { setcolor(8); line(53+m,57+n,55+m,55+n); line(53+m,57+n,133+m,137+n); line(55+m,55+n,135+m,135+n); line(133+m,137+n,135+m,135+n); setfillstyle(1,14); floodfill(55+m,58+n,8); line(68+m,42+n,70+m,40+n); line(68+m,42+n,148+m,122+n); line(70+m,40+n,150+m,120+n); line(148+m,122+n,150+m,120+n); floodfill(70+m,43+n,8); line(65+m,65+n,78+m,52+n); line(68+m,68+n,81+m,55+n); floodfill(79+m,54+n,8); line(75+m,75+n,88+m,62+n); line(78+m,78+n,91+m,65+n); floodfill(89+m,64+n,8); line(85+m,85+n,98+m,72+n); line(88+m,88+n,101+m,75+n); floodfill(99+m,74+n,8); line(95+m,95+n,108+m,82+n); line(98+m,98+n,111+m,85+n); floodfill(109+m,84+n,8); line(105+m,105+n,118+m,92+n); line(108+m,108+n,121+m,95+n); floodfill(119+m,94+n,8); line(115+m,115+n,128+m,102+n); line(118+m,118+n,131+m,105+n); floodfill(129+m,104+n,8); line(125+m,125+n,138+m,112+n); line(128+m,128+n,141+m,115+n); floodfill(139+m,114+n,8); } } void ladder2() { int p,q=0; for(p=0;p<=180;p+=155) { line(100+p,330-q,140+p,290-q); line(100+p,330-q,102+p,332-q); line(102+p,332-q,142+p,292-q); line(142+p,292-q,140+p,290-q); floodfill(141+p,292-q,8); line(115+p,345-q,155+p,305-q); line(115+p,345-q,117+p,347-q); line(117+p,347-q,157+p,307-q); line(157+p,307-q,155+p,305-q); floodfill(155+p,307-q,8); line(112+p,322-q,125+p,335-q); line(114+p,320-q,127+p,333-q); floodfill(125+p,334-q,8); line(122+p,312-q,135+p,325-q); line(124+p,310-q,137+p,323-q); floodfill(135+p,324-q,8); line(132+p,302-q,145+p,315-q); line(134+p,300-q,147+p,313-q); floodfill(145+p,314-q,8); q+=95; } } void snake1() { int x,y=0,h=2; for(x=0;x<=200;x+=125) { arc(120+x,110+y,10,85,60); arc(258+x,85+y,190,240,80); arc(112+x,118+y,10,80,60); arc(250+x,93+y,190,290,80); arc(275+x,100+y,250,270,70); line(250+x,170+y,250+x,165+y); line(250+x,165+y,230+x,160+y); line(230+x,160+y,218+x,155+y); line(130+x,50+y,115+x,47+y); line(121+x,59+y,106+x,52+y); line(106+x,52+y,114+x,48+y); circle(114+x,52+y,1); setfillstyle(1,h); floodfill(116+x,52+y,8); y+=230; h+=8; } } void snake2() { arc(130,220,150,180,40); arc(130,220,180,253,40); arc(105,328,273,80,70); arc(143,220,150,180,40); arc(143,215,180,230,40); arc(112,328,265,50,75); arc(80,354,45,72,115); line(102,400,104,402); line(102,400,107,399); line(95,200,110,185); line(110,185,109,200); line(110,185,111,182); circle(104,198,1); setfillstyle(1,12); floodfill(103,199,8); } void snake3() { arc(255,118,320,0,170); arc(265,118,305,0,170); line(384,229,361,260); line(425,120,429,105); line(428,105,435,120); line(428,105,429,100); circle(430,115,1); setfillstyle(1,6); floodfill(430,117,8); } void numbering() { outtextxy(50,393,"1 2 4 5 6 7 8 10"); outtextxy(50,353,"20 19 18 16 15 1 13 11"); outtextxy(50,313,"21 22 25 26 29 30"); outtextxy(50,273,"40 39 38 37 36 35 34 33 32 31"); outtextxy(50,233,"41 43 44 45 47 48 50"); outtextxy(50,193,"60 58 57 56 55 53 52 "); outtextxy(50,153,"61 62 63 64 66 67 68 69 "); outtextxy(50,113,"80 79 76 75 74 73 71"); outtextxy(50,73, "81 83 84 85 86 87 89 90"); outtextxy(50,33, "100 99 98 97 96 95 94 93 92 91"); setcolor(15); outtextxy(500,40," DINESH KUMAR"); }

Related Source Codes

Script Name Author

The Game Opposite as seen on Nokia 2300 Mobile Manikanta

RECURSIVE BALANCED QUICK SORT ashish

Radix Sort ashish

Change your mouse pointer Ashim

The blinking star Shashank

Data Validation Crylittlebaby

To search a file by giving file type like mp3 or mpeg or doc Prashanth SR

Menus Demonstration B.Chidhambaram

Employee Database Project Using C. Reenku Raman Nayak

Creating a Lexical Analyzer in c fahad bader al-buhairi �դ ?�� ??��

Calendar Program Omkar & Devendra

Stop double Process for start in C Cedrik Jurak

Stop double Process for start in C Cedrik Jurak

Time Scheduler Atiq Anwar

A timepass game between atmost two players Rahul Roy

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.