I made a code(test1.cpp) from an existing code of a game (ramble_shuffle.cpp) using classes...but the code gets stuck somewhere...Iam unable to find the fault...can some1 find please...the code hangs up....
Original game code : shuffle_game.cpp
my code : test1.cpp
// HEADER FILES
#include<stdio.h>
#include<iostream.h>
#include<conio.h>
#include<dos.h> // for delay function
#include<stdlib.h> // for rand , srand and itoa functions
#include<process.h>
#include<graphics.h> // for all graphics functions
#include<fstream.h>
#include<time.h>
#define MAX_MOVES 200
int movenum=0;
int moves=0;
// FUNCTION PROTOTYPES
class game
{
private:
int emp[2];// Initialize the matrix - box with 1 to 9 and then initialize the empty slot last element
int box[3][3];
int store3[150];
int key;
int ch;
int temp;
char mode;
public:
game()
{
emp[0]=2;
emp[1]=2;
box[0][0]=1;box[0][1]=2;box[0][2]=3;box[1][0]=4;
box[1][1]=5;box[1][2]=6;box[2][0]=7;box[2][1]=8;
box[2][2]=9;
ch=0;
temp=0;
}
int checkwin();
void decidelevel( );
void decidemode();
void drawbox(int);
void draw33array();
void getemp();
int getkey();
void working();
void randomit(int);
void simulate();
};
// FUNCTION DEFINITIONS
void thankyou();
void welcome();
void youwin();
void youlose();
int yousure();
void processingfunc();
void instructions();
main()
{
game play;
int i,j;
//int store[150];
int gd = DETECT , gm;
initwindow(900,650);
welcome();
instructions();
play.decidelevel();
play.drawbox(moves);
delay(3000);
play.decidemode();
cleardevice();
play.drawbox(0);
play.working();
exit(0);
getch();
}
// At each stage check the move is feasbile and in case then move and display the box
void game::simulate() // Open the file and take the moves and play
{ cleardevice(); //with each move call drawbox to display the box with the moves
int j,i=0, count=0;
int temp[150], emp[2];
fstream fp;
char ch;
fp.open("store1.txt",ios::in);
int a, move=movenum;
getemp();
fp.seekg(0);
while(!fp.eof()) //check till end of file
{
fp>>temp[i];
fp.get(ch);
i++;
}
--i;
for (j=0; j<i;j++)
{ a=temp[i-j-1];
switch(a)
{
case 2:
if (emp[0] != 2)
{ box[emp[0]][emp[1]] = box[emp[0]+1][emp[1]];
emp[0]++;
drawbox(++move);
}
break;
case 1:
if (emp[0] != 0)
{ box[emp[0]][emp[1]] = box[emp[0]-1][emp[1]];
emp[0]--;
drawbox(++move);
}
break;
case 4:
if (emp[1] != 2)
{ box[emp[0]][emp[1]] = box[emp[0]][emp[1]+1];
emp[1]++;
drawbox(++move);
}
break;
case 3:
if (emp[1] != 0)
{ box[emp[0]][emp[1]] = box[emp[0]][emp[1]-1];
emp[1]--;
drawbox(++move);
}
break;
}
delay(700);
cleardevice();
}
drawbox(move);
//getch();
delay(1000);
fp.close();
}
void game::randomit(int x) // This routine does defined number of moves by creating defined number of moves
{ int m,temp2,i,j,count=0;int store[150]; //some of the moves which are invalid are not stored. Also before storing check
fstream fp;
fp.open("store1.txt",ios::out);
srand(time(NULL));
for(m=0;m<x;m++)
{ temp2=(rand()%4)+1; // 1 to 4 defining up-down-left-right keys
switch(temp2)
{ case 1:
if (emp[0] != 2)
{ store[count]=temp2;
box[emp[0]][emp[1]] = box[emp[0]+1][emp[1]];
emp[0]++;
count++;
}
break;
case 2:
if (emp[0] != 0)
{ store[count]=temp2;
box[emp[0]][emp[1]] = box[emp[0]-1][emp[1]];
emp[0]--;
count++;
}
break;
case 3:
if (emp[1] != 2)
{ store[count]=temp2;
box[emp[0]][emp[1]] = box[emp[0]][emp[1]+1];
emp[1]++;
count++;
}
break;
case 4:
if (emp[1] != 0)
{ store[count]=temp2;
box[emp[0]][emp[1]] = box[emp[0]][emp[1]-1];
emp[1]--;
count++;
}
break;
}
}
box[emp[0]][emp[1]]=9;
int c2=0, c1=0, flag=0;
int store2[150]={9}; // ??? boundary condition
label1:
for(int w=0;w<count;w++) // check if 2 consequent moves are complementary up down right,left then they need not be stored
{ if((store[w]==1 && store[w+1]==2)||(store[w]==2 && store[w+1]==1)||(store[w]==3 && store[w+1]==4)||(store[w]==4 && store[w+1]==3))
{ w+=1;
flag=1;
}
else
store2[c2++]=store[w]; // store normalized array into store2
} //end of label1
if(flag) //doing 2nd level optimisation. after initial execution of label1 there may still be complementary moves left
{ flag=0;
for(int c4=0; c4<count; c4++)
if(c4<c2) // can also change c4<c2 in for loop and leave else statement blank
store[c4]=store2[c4]; //storing in store again as laabel1 has array store, not store2
else
store[c4]=0;
c2=0;
goto label1; // when you look for optimizing and you do one round there is a possibility what we have got in store2 has some
// complementary moves so till we get flag set keep optimizing till flag is 0
}
for(c1=0; store2[c1]!=0; c1++) // store the optimized moves table
fp<<store2[c1]<<endl;
// getch();
fp.close();
}
int game::getkey()
{ int temp , temp1;
temp = getch(); // Esc ASCII stored in temp
if (temp==27)
return 5; // For Esc Key
temp1 = getch(); // Up/Down/Left/Right ASCII stored in temp1
switch(temp1)
{ case 72: return 1; // For up key
case 80: return 2;// For down key
case 75: return 3;// For left key
case 77: return 4;// For right key
case 59: return 6; //storing s or S for calling simulate in between program
default: return 7;// Any random value indicating no relavent input from user
}
}
void game::getemp() //Empty the box wherever 9 is present
{ int i,j;
for (i=0;i<3;i++)
{ for (j = 0 ;j<3;j++)
cout<<box[i][j];
cout<<endl;
}
int c1,c2;
for (c1=0;c1<3;c1++)
for (c2 = 0 ;c2<3;c2++)
if (box[c1][c2] == 9)
{ emp[0] = c1;
emp[1] = c2;
}
}
// Check whether the array has values in order to decalre a win
int game::checkwin()
{ int temp = 1,c1,c2;
for (c1 = 0 ; c1 < 3;c1++)
for (c2 = 0 ; c2<2 ; c2 ++)
if (box[c1][c2] != ((c1*3)+c2+1))
temp = 0;
if (box[0][2] != 3 || box[1][2] != 6)
temp = 0;
return temp;
}
void game::drawbox(int moves)
{ int c1,c2;
char no[5];
setbkcolor(0);
if (moves == MAX_MOVES+1) // in case max move is reached exit after message
{ cleardevice();
settextstyle(10,0,3);
setcolor(15);
setbkcolor(BLACK);
outtextxy(250,250,"NO MORE MOVES ALLOWED");
delay(2000);
getch();
youlose();
exit(0);
}
draw33array(); // in case still moves are left
settextstyle(4,0,3);
setcolor(WHITE);
outtextxy(40,450,"( Press Escape to exit the game )");
setcolor(14);
settextstyle(4,0,6);
for (c1 = 0 ;c1 < 3;c1++)
for (c2=0 ; c2<3 ; c2++)
if (!(c1 == emp[0] && c2 == emp[1])) //This prevents output of 9 and creates a blank -----IMPORTANT
{ itoa((box[c1][c2]),no,10); // convert the integer to ascii in no
outtextxy((70+130*c2),(50+130*c1),no); // calculation of pixels positions
// (0,0), (0,1), (0,2) are (70,50) (200,50) (330,50)
// (1,0), (1,1), (1,2) are (70,180) (200,180) (330,180)
// (2,0), (2,1), (2,2) are (70,310) (200,310) (330,310)
}
setcolor(5);
settextstyle(4,0,4);
outtextxy(480,40,"MOVES");
itoa(moves,no,10);
setcolor(11);
outtextxy(550,90,no);
settextstyle(4,0,4);
setcolor(5);
outtextxy(435,160,"MAX MOVES");
itoa(MAX_MOVES,no,10);
setcolor(WHITE);
settextstyle(4,0,4);
outtextxy(530,210,no);
settextstyle(4,0,3);
outtextxy(40,550,"( Press F1 + S to simulate )");
}
void welcome() //Welcome Screen
{ int c1;
delay(1000);
cleardevice();
for (c1 = 0 ; c1<10;c1++)
{ setcolor(COLOR(100,250,0));
settextstyle(4,0,8);
outtextxy(c1*18+10,c1*10,"RUMBLE"); //to show movement of text
delay(20);
setcolor(0); //rewrite with black to hide former
outtextxy(c1*18+10,c1*10,"RUMBLE");
}
setcolor(COLOR(100,250,0));
settextstyle(4,0,8);
outtextxy(c1*18+10,c1*10,"RUMBLE"); //so that "shuffle" stays after the loop
delay(20);
for (c1 = 0 ; c1<18;c1++)
{ setcolor(COLOR(100,250,0));
settextstyle(4,0,8);
outtextxy(c1*10,220,"SHUFFLE"); //to show movement of text
delay(20);
setcolor(0);
outtextxy(c1*10,220,"SHUFFLE"); //rewrite with black to hide former
}
setcolor(COLOR(100,250,0));
settextstyle(4,0,8);
outtextxy(c1*10,220,"SHUFFLE"); //so that "game" stays after the loop
delay(500);
settextstyle(4,0,2);
setcolor(WHITE);
outtextxy(180,440,"( PRESS ANY KEY TO CONTINUE )");
getch();
cleardevice();
}
void youwin()
{ int c1;
delay(500);
cleardevice();
setbkcolor(BLACK);
settextstyle(4,0,7);
for (c1 = 0 ; c1 < 5 ; c1++)
{ setcolor(COLOR(100,250,0));
outtextxy(100,250,"CONGRATS !!");
delay(100);
setcolor(7);
outtextxy(100,250,"CONGRATS !!");
delay(75);
}
setcolor(COLOR(100,250,0));
outtextxy(100,250,"CONGRATS !!");
delay(100);
for (c1 = 0 ; c1<18;c1++)
{ setcolor(COLOR(100,250,0));
setbkcolor(BLACK);
outtextxy(c1*8,350,"YOU");
outtextxy(580-c1*8,350,"W0N");
delay(20);
setcolor(0);
setbkcolor(BLACK);
outtextxy(c1*8,350,"YOU");
outtextxy(580-c1*8,350,"W0N");
}
setcolor(COLOR(100,250,0));
outtextxy(c1*8,350,"YOU");
outtextxy(580-c1*8,350,"W0N");
dela// HEADER FILES
#include<stdio.h>
#include<iostream.h>
#include<conio.h>
#include<dos.h> // for delay function
#include<stdlib.h> // for rand , srand and itoa functions
#include<process.h>
#include<graphics.h> // for all graphics functions
#include<fstream.h>
#include<time.h>
#define MAX_MOVES 200
int movenum=0;
// FUNCTION PROTOTYPES
int checkwin(int [3][3]);
void decidelevel( int [3][3], int [2]);
char decidemode();
void drawbox(int [3][3],int[2],int);
void draw33array();
void getemp(int [2],int [3][3]);
int getkey();
void instructions();
void randomit(int [3][3], int [2], int);
void simulate(int [3][3]);
void thankyou();
void welcome();
void youwin();
void youlose();
int yousure();
// FUNCTION DEFINITIONS
main()
{ int i,j;
int box[3][3] = {{1,2,3},{4,5,6},{7,8,9}} ;
int store[150],store3[150];
int emp[2] = {2,2} ;// Initialize the matrix - box with 1 to 9 and then initialize the empty slot last element
int key , ch = 0,temp = 0 ;
int gd = DETECT , gm;
int moves = 0;
char mode;
fstream file;
file.open("storeplayermoves.txt",ios::out);
initwindow(900,650);
welcome();
instructions();
decidelevel(box,emp);
drawbox(box,emp,0);
int jumbledbox[3][3];
for(int u=0;u<3;u++)
for(int v=0;v<3;v++)
jumbledbox[u][v]=box[u][v];
delay(3000);
mode=decidemode();
cleardevice();
drawbox(box,emp,0);
if(mode=='1')
{
do
{
key = getkey();//get input up-down-left-right 1,2,3,4 : Depending on the key value make it right/left or up/down swap
switch(key)
{
case 1:
if (emp[0] != 2) // in case empty is box (2,*) then up arrow is invalid
{
box[emp[0]][emp[1]] = box[emp[0]+1][emp[1]];
emp[0]++;
cleardevice();
moves++;
file<<"1"<<endl;
drawbox(box,emp,moves);
}
break;
case 2:
if (emp[0] != 0) // in case empty is box (0,*) then down arrow is invalid
{
box[emp[0]][emp[1]] = box[emp[0]-1][emp[1]];
emp[0]--;
cleardevice();
moves++;
file<<"2"<<endl;
drawbox(box,emp,moves);
}
break;
case 3:
if (emp[1] != 2) // in case empty is box (*,2) then left arrow is invalid
{
box[emp[0]][emp[1]] = box[emp[0]][emp[1]+1];
emp[1]++;
cleardevice();
moves++;
file<<"3"<<endl;
drawbox(box,emp,moves);
}
break;
case 4:
if (emp[1] != 0) // in case empty is box (*,0) then right arrow is invalid
{
box[emp[0]][emp[1]] = box[emp[0]][emp[1]-1];
emp[1]--;
cleardevice();
moves++;
file<<"4"<<endl;
drawbox(box,emp,moves);
}
break;
case 5: // Incase ESC key take input whether to continue or exit
{
delay(500);
ch = yousure();
if (ch == 1)
{
thankyou();
closegraph();
exit(0);
}
else
{
drawbox(box,emp,moves);
break;
}
}
case 6:
{ file.close();
file.open("storeplayermoves.txt",ios::in);
cleardevice();
file.seekg(0,ios::beg);
int i,j,a;
for( i=0;i<moves;i++)
file>>store3[i];
//replace store2 by 4 ,replace store by 3
int c2=0, c1=0, flag=0;
fstream fpo;
fpo.open("storenew.txt",ios::out);
int store4[150]={9}; // ??? boundary condition
int count=moves;
label2:
for(int w=0;w<count;w++) // check if 2 consequent moves are complementary up down right,left then they need not be stored
{ if((store3[w]==1 && store3[w+1]==2)||(store3[w]==2 && store3[w+1]==1)||(store3[w]==3 && store3[w+1]==4)||(store3[w]==4 && store3[w+1]==3))
{ w+=1;
flag=1;
}
else
store4[c2++]=store3[w]; // store normalized array into store2
} //end of label1
if(flag) //doing 2nd level optimisation. after initial execution of label1 there may still be complementary moves left
{ flag=0;
for(int c4=0; c4<count; c4++)
if(c4<c2) // can also change c4<c2 in for loop and leave else statement blank
store3[c4]=store4[c4]; //storing in store again as laabel1 has array store, not store2
else
store3[c4]=0;
c2=0;
goto label2; // when you look for optimizing and you do one round there is a possibility what we have got in store2 has some
// complementary moves so till we get flag set keep optimizing till flag is 0
}
for(c1=0; store4[c1]!=0; c1++) // store the optimized moves table
fpo<<store4[c1]<<endl;
//getch();
for( j=i-1;j>=0;j--)
{ a=store4[j];
switch(a)
{ case 2:
if (emp[0] != 2)
{ box[emp[0]][emp[1]] = box[emp[0]+1][emp[1]];
emp[0]++;
drawbox(box,emp,++movenum);
}
break;
case 1:
if (emp[0] != 0)
{ box[emp[0]][emp[1]] = box[emp[0]-1][emp[1]];
emp[0]--;
drawbox(box,emp,++movenum);
}
break;
case 4:
if (emp[1] != 2)
{ box[emp[0]][emp[1]] = box[emp[0]][emp[1]+1];
emp[1]++;
drawbox(box,emp,++movenum);
}
break;
case 3:
if (emp[1] != 0)
{ box[emp[0]][emp[1]] = box[emp[0]][emp[1]-1];
emp[1]--;
drawbox(box,emp,++movenum);
}
break;
} //end of inside switch
delay(500);
cleardevice();
} //end of for loop
fpo.close();
file.close();
simulate(jumbledbox);
delay(500);
thankyou();
} //end of case 6
break;
case 7: exit(0);
}
temp = checkwin(box); // Check if the game is complteted then exit
}while(temp != 1);
delay(200);
youwin();
thankyou();
}
else if(mode=='2')
{ simulate(box);
thankyou();
}
exit(0);
getch();
}
// At each stage check the move is feasbile and in case then move and display the box
void simulate(int box[3][3]) // Open the file and take the moves and play
{ cleardevice(); //with each move call drawbox to display the box with the moves
int j,i=0, count=0;
int temp[150], emp[2];
fstream fp;
char ch;
fp.open("store1.txt",ios::in);
int a, move=movenum;
getemp(emp,box);
fp.seekg(0);
while(!fp.eof()) //check till end of file
{
fp>>temp[i];
fp.get(ch);
i++;
}
--i;
for (j=0; j<i;j++)
{ a=temp[i-j-1];
switch(a)
{
case 2:
if (emp[0] != 2)
{ box[emp[0]][emp[1]] = box[emp[0]+1][emp[1]];
emp[0]++;
drawbox(box,emp,++move);
}
break;
case 1:
if (emp[0] != 0)
{ box[emp[0]][emp[1]] = box[emp[0]-1][emp[1]];
emp[0]--;
drawbox(box,emp,++move);
}
break;
case 4:
if (emp[1] != 2)
{ box[emp[0]][emp[1]] = box[emp[0]][emp[1]+1];
emp[1]++;
drawbox(box,emp,++move);
}
break;
case 3:
if (emp[1] != 0)
{ box[emp[0]][emp[1]] = box[emp[0]][emp[1]-1];
emp[1]--;
drawbox(box,emp,++move);
}
break;
}
delay(500);
cleardevice();
}
drawbox(box,emp,move);
//getch();
delay(1000);
fp.close();
}
void randomit(int box[3][3], int emp[2], int x) // This routine does defined number of moves by creating defined number of moves
{ int m,temp2,i,j,count=0;int store[150]; //some of the moves which are invalid are not stored. Also before storing check
fstream fp;
fp.open("store1.txt",ios::out);
srand(time(NULL));
for(m=0;m<x;m++)
{ temp2=(rand()%4)+1; // 1 to 4 defining up-down-left-right keys
switch(temp2)
{ case 1:
if (emp[0] != 2)
{ store[count]=temp2;
box[emp[0]][emp[1]] = box[emp[0]+1][emp[1]];
emp[0]++;
count++;
}
break;
case 2:
if (emp[0] != 0)
{ store[count]=temp2;
box[emp[0]][emp[1]] = box[emp[0]-1][emp[1]];
emp[0]--;
count++;
}
break;
case 3:
if (emp[1] != 2)
{ store[count]=temp2;
box[emp[0]][emp[1]] = box[emp[0]][emp[1]+1];
emp[1]++;
count++;
}
break;
case 4:
if (emp[1] != 0)
{ store[count]=temp2;
box[emp[0]][emp[1]] = box[emp[0]][emp[1]-1];
emp[1]--;
count++;
}
break;
}
}
box[emp[0]][emp[1]]=9;
int c2=0, c1=0, flag=0;
int store2[150]={9}; // ??? boundary condition
label1:
for(int w=0;w<count;w++) // check if 2 consequent moves are complementary up down right,left then they need not be stored
{ if((store[w]==1 && store[w+1]==2)||(store[w]==2 && store[w+1]==1)||(store[w]==3 && store[w+1]==4)||(storePaste code here, People (including me) are too lazy to download
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.