贪吃蛇

1.首先是做一个能够移动的蛇

**#include

include

include

include

include

define SNAKE_MAX_LENGTH 20

define SNAKE_HEAD ‘H’

define SNAKE_BODY ‘X’

define BLANK_CELL ’ ‘

define SNAKE_FOOD ‘$’

define WALL_CELL ‘‘*

void snakeMove(int,int);//控制蛇的移动
void output(void);//输出蛇的位置
int gameover(void);//判断游戏结束条件

char map[12][12]={“**”,
“XXXXH “,
“* *”,
“* *”,
“* *”,
“* *”,
“* *”,
“* *”,
“* *”,
“* *”,
“* *”,
“**”};

int snakeX[SNAKE_MAX_LENGTH]={1,2,3,4,5};
int snakeY[SNAKE_MAX_LENGTH]={1,1,1,1,1};
int snakeLength=5;

2.根据伪代码写出大体思路

输出字符矩阵
WHILE not 游戏结束 DO
ch＝等待输入
CASE ch DO
‘A’:左前进一步，break
‘D’:右前进一步，break
‘W’:上前进一步，break
‘S’:下前进一步，break
END CASE
输出字符矩阵
END WHILE
输出 Game Over!!!

3.最终的代码

int main()
{
char input;
output();
while(1)
{
input=getch();//使用getch()函数是因为输入无回显，且无需enter结束输入
switch(input)
{
case’A’:snakeMove(-1,0);break;
case’D’:snakeMove(1,0);break;
case’W’:snakeMove(0,-1);break;
case’S’:snakeMove(0,1);break;
default:break;
}
fflush(stdin);
if(gameover()!=0)
{
output();
continue;
}
return 0;
}
}

snakeMove函数

void snakeMove(int dx,int dy)/*假设地图是一个坐标轴,蛇的移动表示在当前点(x,y)加上dx,dy
‘W’:dx=0,dy=-1
‘A’:dx=-1,dy=0
‘S’:dx=0,dy=1
‘D’:dx=1,dx=0*/
{
int turn=0;
int tempX=snakeX[snakeLength-1];
int tempY=snakeY[snakeLength-1];
int tempX1=0;
int tempY1=0;
snakeY[snakeLength-1]+=dy;
snakeX[snakeLength-1]+=dx;
for(turn=snakeLength-2;turn>=0;turn–)
{
tempX1=snakeX[turn];
tempY1=snakeY[turn];
snakeX[turn]=tempX;
snakeY[turn]=tempY;
tempX=tempX1;
tempY=tempY1;
}
}

output函数

void output(void)
{
int turnx=0;
int turny=0;
for(turnx=1;turnx<11;turnx++)
{
for(turny=1;turny<11;turny++)
{
map[turnx][turny]=BLANK_CELL;
}
}
for(turnx=0,turny=0;turnx