https://www.myziyuan.com/
- 893811145
- #include<graphics.h> #include<stdlib.h> #include<dos.h> #define LEFT 0x4b00 #define RIGHT 0x4d00 #define DOWN 0x5000 #define UP 0x4800 #define ESC 0x011b int i,key; int score=0; int gamespeed=32000; struct Food /*食物的结构体*/ { int x; /*食物的横坐标*/ int y; /*食物的纵坐标*/ int yes; /*食物是否出现的变量*/ }food; struct Snack /*蛇的结构体*/ { int x[N]; int y[N]; int node; /*蛇的节数*/ int direction; /*蛇的方向*/ int life; /*蛇的生命，0活着，1死亡*/ }snake; void Init(void); /*图形驱动*/ void Close(void); /*关闭游戏函数*/ void DrawK(void); /*画图函数*/ void GameOver(void);/*输出失败函数*/ void GamePlay(); /*游戏控制函数 主要程序*/ void PrScore(void); /*分数输出函数*/ DELAY(char ch)/*调节游戏速度*/ { if(ch=='3') { delay(gamespeed); /*delay是延迟函数*/ delay(gamespeed); } else if(ch=='2') { delay(gamespeed); } } Menu()/*游戏开始菜单*/ { char ch; printf("Please choose the gamespeed:\n"); printf("1-Fast 2-Normal 3-Slow\n"); printf("\nPlease Press The numbers..\n"); do {ch=getch();} while(ch!='1'&&ch!='2'&&ch!='3'); clrscr(); return(ch); } /*主函数*/ void main(void) { int ch; ch=Menu(); Init(); DrawK(); GamePlay(ch); Close(); } void Init(void) { int gd=DETECT,gm; initgraph(&gd,&gm,"c:\\tc"); cleardevice(); } void DrawK(void) { setcolor(11); setlinestyle(SOLID_LINE,0,THICK_WIDTH); for(i=50;i<=600;i+=10) { rectangle(i,40,i+10,49); /*画出上边框*/ rectangle(i,451,i+10,460); /*画出下边框*/ } for(i=40;i<=450;i+=10) { rectangle(50,i,59,i+10); /*画出左边框*/ rectangle(601,i,610,i+10); /*画出右边框*/ } } void GamePlay(char ch) { randomize(); /*随机数发生器*/ food.yes=1; /*1代表要出现食物，0表示以存在食物*/ snake.life=0; snake.direction=1; snake.x[0]=100;snake.y[0]=100; snake.x[1]=110;snake.y[1]=100; snake.node=2; PrScore(); while(1) /*可以重复游戏*/ { while(!kbhit()) /*在没有按键的情况下蛇自己移动*/ { if(food.yes==1) /*需要食物*/ { food.x=rand()%400+60; food.y=rand()%350+60; /*使用rand函数随机产生食物坐标*/ while(food.x%10!=0) food.x++; while(food.y%10!=0) food.y++; /*判断食物是否出现在整格里*/ food.yes=0; /*现在有食物了*/ } if(food.yes==0) /*有食物了就要显示出来*/ { setcolor(GREEN); rectangle(food.x,food.y,food.x+10,food.y-10); } for(i=snake.node-1;i>0;i--) /*贪吃蛇的移动算法*/ { snake.x[i]=snake.x[i-1]; snake.y[i]=snake.y[i-1]; /*贪吃蛇的身体移动算法*/ } switch(snake.direction) /*贪吃蛇的头部移动算法，以此来控制移动*/ { case 1:snake.x[0]+=10;break; case 2:snake.x[0]-=10;break; case 3:snake.y[0]-=10;break; case 4:snake.y[0]+=10;break; } for(i=3;i<snake.node;i++) /*判断是否头部与身体相撞*/ { if(snake.x[i]==snake.x[0]&&snake.y[i]==snake.y[0]) { GameOver(); snake.life=1; break; } } /*下面是判断是否撞到墙壁*/ if(snake.x[0]<55||snake.x[0]>595||snake.y[0]<55||snake.y[0]>455) { GameOver(); snake.life=1; } if(snake.life==1) /*如果死亡就退出循环*/ break; if(snake.x[0]==food.x&&snake.y[0]==food.y) /*判断蛇是否吃到食物*/ { setcolor(0); rectangle(food.x,food.y,food.x+10,food.y-10); /*吃的食物后用黑色将食物擦去*/ snake.x[snake.node]=-20;snake.y[snake.node]=-20; /*现把增加的一节放到看不到的地方去*/ snake.node++; food.yes=1; score+=10; PrScore(); } setcolor(4); /*每次移动后将后面的身体擦去*/ for(i=0;i<snake.node;i++) rectangle(snake.x[i],snake.y[i],snake.x[i]+10,snake.y[i]-10); delay(gamespeed); DELAY(ch); setcolor(0); rectangle(snake.x[snake.node-1],snake.y[snake.node-1],snake.x[snake.node-1]+10,snake.y[snake.node-1]-10); } if(snake.life==1) break; key=bioskey(0); /*接受按键*/ if(key==ESC) break; else if(key==UP&&snake.direction!=4)/*判断是否改变方向*/ snake.direction=3; else if(key==RIGHT&&snake.direction!=2) snake.direction=1; else if(key==LEFT&&snake.direction!=1) snake.direction=2; else if(key==DOWN&&snake.direction!=3) snake.direction=4; } } void GameOver(void) { cleardevice(); setcolor(RED); settextstyle(0,0,4); outtextxy(200,200,"GAME OVER"); getch(); } void PrScore(void) { char str[10]; setfillstyle(SOLID_FILL,YELLOW); bar(50,15,220,35); setcolor(6); settextstyle(0,0,2); sprintf(str,"scord:%d",score); outtextxy(55,20,str); } void Close(void) { getch(); closegraph(); } 贪吃蛇
- 2021-02-22 03:55:01
- 225548545
- 首先要有X管理器然后Mobile C（编程），用X打开游戏内部，然后复制出来，再用C打开。这种方式仅限于C语言基础，若想完全弄懂可以上论坛看专帖，谢谢
- 2021-02-11 19:45:28
- 亚亚
- 用C++编写的小游戏源代码,五子棋的代码：#include#include#include#include using namespace std;const int N=15; //15*15的棋盘const char ChessBoardflag = ' '; //棋盘标志const char flag1='o'; //玩家1或电脑的棋子标志const char flag2='X'; //玩家2的棋子标志typedef struct Coordinate //坐标类{ int x; //代表行int y; //代表列}Coordinate;class GoBang //五子棋类{ public:GoBang() //初始化{InitChessBoard();}void Play() //下棋{Coordinate Pos1; // 玩家1或电脑Coordinate Pos2; //玩家2int n = 0;while (1){int mode = ChoiceMode();while (1){if (mode == 1) //电脑vs玩家{ComputerChess(Pos1,flag1); // 电脑下棋if (GetVictory(Pos1, 0, flag1) == 1) //0表示电脑,真表示获胜break;PlayChess(Pos2, 2, flag2); //玩家2下棋if (GetVictory(Pos2, 2, flag2)) //2表示玩家2break;}else //玩家1vs玩家2{PlayChess(Pos1, 1, flag1); // 玩家1下棋if (GetVictory(Pos1, 1, flag1)) //1表示玩家1break;PlayChess(Pos2, 2, flag2); //玩家2下棋if (GetVictory(Pos2, 2, flag2)) //2表示玩家2break;}}cout > c;if (c == 'n')break;} }protected:int ChoiceMode() //选择模式{int i = 0;system("cls"); //系统调用，清屏InitChessBoard(); //重新初始化棋盘cout > i;if (i == 0) //选择0退出exit(1);if (i == 1 || i == 2)return i;cout > pos.x >> pos.y;if (JudgeValue(pos) == 1) //坐标合法break;cout 0 && pos.x 0 && pos.y 0 ? begin = (pos.y - 4) : begin = 1;(pos.y + 4) >N ? end = N : end = (pos.y + 4);for (int i = pos.x, j = begin; j + 4 0 ? begin = (pos.x - 4) : begin = 1;(pos.x + 4) > N ? end = N : end = (pos.x + 4);for (int j = pos.y, i = begin; i + 4 pos.y ? len = pos.y - 1 : len = pos.x - 1;if (len > 4)len = 4;begin = pos.x - len; //横坐标的起始位置begin1 = pos.y - len; //纵坐标的起始位置pos.x > pos.y ? len = (N - pos.x) : len = (N - pos.y);if (len>4)len = 4;end = pos.x + len; //横坐标的结束位置end1 = pos.y + len; //纵坐标的结束位置for (int i = begin, j = begin1; (i + 4 (N - pos.y) ? len = (N - pos.y) : len = pos.x - 1;if (len > 4)len = 4;begin = pos.x - len; //横坐标的起始位置begin1 = pos.y + len; //纵坐标的起始位置(N - pos.x) > (pos.y - 1) ? len = (pos.y - 1) : len = (N - pos.x);if (len>4)len = 4;end = pos.x + len; //横坐标的结束位置end1 = pos.y - len; //纵坐标的结束位置for (int i = begin, j = begin1; (i + 4 = end1); ++i, --j){if (_ChessBoard[i][j] == flag&&_ChessBoard[i + 1][j - 1] == flag&&_ChessBoard[i + 2][j - 2] == flag&&_ChessBoard[i + 3][j - 3] == flag&&_ChessBoard[i + 4][j - 4] == flag)return 1;}for (int i = 1; i < N + 1; ++i) //棋盘有没有下满{for (int j =1; j < N + 1; ++j){if (_ChessBoard[i][j] == ChessBoardflag)return 0; //0表示棋盘没满} }return -1; //和棋}bool GetVictory(Coordinate& pos, int player, int flag) //对JudgeVictory的一层封装，得到具体那个玩家获胜{int n = JudgeVictory(pos, flag); //判断有没有人获胜if (n != 0) //有人获胜，0表示没有人获胜{PrintChessBoard();if (n == 1) //有玩家赢棋{if (player == 0) //0表示电脑获胜，1表示玩家1,2表示玩家2printf("***电脑获胜***\n");elseprintf("***恭喜玩家%d获胜***\n", player);}elseprintf("***双方和棋***\n");return true; //已经有人获胜}return false; //没有人获胜}private:char _ChessBoard[N+1][N+1]; };扩展资料：设计思路1、进行问题分析与设计，计划实现的功能为，开局选择人机或双人对战，确定之后比赛开始。2、比赛结束后初始化棋盘，询问是否继续比赛或退出，后续可加入复盘、悔棋等功能。3、整个过程中，涉及到了棋子和棋盘两种对象，同时要加上人机对弈时的AI对象，即涉及到三个对象。
- 2021-02-11 19:45:28
开通会员