C语言实现贪吃蛇游戏
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<sys/times.h>
#include<sys/types.h>
#include<unistd.h>
#include<ncurses.h> #define TBool int
#define True 1
#define False 0
#define SHAPE_FOOD '@'
#define SHAPE_SNAKE '#'
#define GAMEWIN_YLEN 20
#define GAMEWIN_XLEN 60
#define LOGWIN_YLEN 7
#define LOGWIN_XLEN (GAMEWIN_XLEN)
#define LOGBUF_NUM (LOGWIN_YLEN - 2)
#define LOGBUF_LEN (GAMEWIN_XLEN - 2)
#define MAXLEVEL 12 #define GetSnakeTail(s) ((s)->head->front) WINDOW *logwin; //declare a windows for displaying message
#define INITRUNLOG() logwin = newlogw()
#define RUNLOG(str) runlog(logwin, str)
#define DESTROYRUNLOG() delwin(logwin) int g_level; //level of player enum TDirection
{
DIR_UP,
DIR_DOWN,
DIR_LEFT,
DIR_RIGHT
}; struct TFood
{
int x;
int y;
}; struct TSnakeNode
{
int y;
int x;
struct TSnakeNode *front;
}; struct TSnake
{
int length;
struct TSnakeNode *head;
enum TDirection dir;
}; int refreshgamew(WINDOW *win, struct TSnake *psnake);
void movesnake(struct TSnake *psnake);
int checksnake(struct TFood *pfood, struct TSnake *psnake);
void snakegrowup(struct TFood *pfood, struct TSnake *psnake);
void gameover(WINDOW *win, char *str);
struct TSnakeNode *newsnakenode(struct TSnakeNode **ppsnode, int y, int x);
struct TSnake *initsnake();
void destroysnake(struct TSnake *psnake);
void drawsnakew(WINDOW *win, struct TSnake *psnake);
void drawfoodw(WINDOW *win, struct TFood *pfood, struct TSnake *psnake);
TBool checkfood(struct TFood *pfood, struct TSnake *psnake);
WINDOW* newgamew();
WINDOW* newlogw();
void runlog(WINDOW* win, char *str);
void cleanline(WINDOW *win, int y, int x); int main()
{
initscr();
raw();
noecho();
keypad(stdscr, TRUE);
curs_set();
refresh(); g_level = ;
INITRUNLOG(); RUNLOG(" press 'q' or 'Q' to quit.");
RUNLOG(" press 'w/s/a/d' or 'W/S/A/D' to move the snake.");
RUNLOG("info:"); WINDOW *gwin = newgamew(); struct TSnake *psnake = initsnake();
drawsnakew(gwin, psnake); while(refreshgamew(gwin, psnake) >= )
; getch();
destroysnake(psnake);
delwin(gwin);
DESTROYRUNLOG();
endwin(); return ;
} WINDOW* newlogw()
{
WINDOW *win = newwin(LOGWIN_YLEN, LOGWIN_XLEN, GAMEWIN_YLEN + , );
box(win, , );
mvwprintw(win, , , " LOG ");
wrefresh(win); return win;
} WINDOW *newgamew()
{
WINDOW *win = newwin(GAMEWIN_YLEN, GAMEWIN_XLEN, , );
box(win, , );
mvwprintw(win, , , " GAME ");
mvwprintw(win, GAMEWIN_YLEN - , , " Level: %d ", g_level);
mvwprintw(win, GAMEWIN_YLEN - , , " Speed: %d ", (int)(g_level/));
wrefresh(win);
return win;
} void runlog(WINDOW *win, char *str)
{
static char logbuf[LOGBUF_NUM][LOGBUF_LEN] = {};
static int index = ;
strcpy(logbuf[index], str); int i = ; for (; i < LOGBUF_NUM; ++i)
{
cleanline(win, i+, );
mvwprintw(win, i+, , logbuf[(index + i) % LOGBUF_NUM]);
wrefresh(win);
}
index = (index + LOGBUF_NUM - ) % LOGBUF_NUM;
} //将窗口win的坐标(x,y)清空
void cleanline(WINDOW *win, int y, int x)
{
char EMPTYLINE[LOGBUF_LEN] = {}; //LOGBUF_LEN = 57 //置空数组 0-56个位置
memset(EMPTYLINE, ' ', LOGBUF_LEN-); //将光标移动到窗口win(y,x)然后打印字符串EMPTYLINE
mvwprintw(win, y, x, EMPTYLINE); //在指定窗口上显示内容
wrefresh(win);
}
int refreshgamew(WINDOW *win, struct TSnake *psnake)
{
static TBool ffood = False;
struct TFood pfood; if (!ffood)
{
drawfoodw(win, &pfood, psnake);
ffood = True;
} int key = -; fd_set set;
FD_ZERO(&set);
FD_SET(, &set); struct timeval timeout;
timeout.tv_sec = ;
timeout.tv_usec = ( - (int)(g_level/)) * * ; if (select(, &set, NULL, NULL, &timeout) < )
{
return -;
} if (FD_ISSET(, &set))
{
while ((key = getch()) == -);
switch(key)
{
case 'w':
case 'W':
(psnake->dir == DIR_DOWN) ? : (psnake->dir = DIR_UP);
break;
case 's':
case 'S':
(psnake->dir == DIR_UP) ? : (psnake->dir = DIR_DOWN);
break; case 'a':
case 'A':
(psnake->dir == DIR_RIGHT) ? : (psnake->dir = DIR_LEFT);
break; case 'd':
case 'D':
(psnake->dir == DIR_LEFT) ? : (psnake->dir = DIR_RIGHT);
break; case 'q':
case 'Q':
RUNLOG("Quit Game!");
gameover(win, "Quit Game!");
return -; default:
break;
}
} movesnake(psnake);
drawsnakew(win, psnake);
switch(checksnake(&pfood, psnake))
{
case :
break; case :
ffood = False;
if (++g_level > MAXLEVEL)
{
RUNLOG("Win!!!");
gameover(win, "Win!!!");
return -;
} mvwprintw(win, GAMEWIN_YLEN-, , " Level: %d ", g_level);
mvwprintw(win, GAMEWIN_YLEN-, , " Speed: %d ", (int)(g_level/));
wrefresh(win);
RUNLOG("Level UP!");
snakegrowup(&pfood, psnake);
break; default:
RUNLOG("Game over!");
gameover(win, "Game over!");
return -;
}
return ;
} /**
* stuct TSnake是一个倒置的首尾相连的链表,head->front指向snake的尾部
* 如: [a]<-[b]<-[c]<-[d] a为head
* | ^ snake移动的时候,只用head指向d,
* `--------------' 并且修改d的(y,x)为snake头移动到的位置.
*/
void movesnake(struct TSnake *psnake)
{
int hy = psnake->head->y;
int hx = psnake->head->x; psnake->head = GetSnakeTail(psnake);
switch(psnake->dir)
{
case DIR_UP:
psnake->head->y = hy - ;
psnake->head->x = hx;
break; case DIR_DOWN:
psnake->head->y = hy + ;
psnake->head->x = hx;
break; case DIR_LEFT:
psnake->head->y = hy;
psnake->head->x = hx - ;
break; case DIR_RIGHT:
psnake->head->y = hy;
psnake->head->x = hx + ;
break; default:
break;
}
} int checksnake(struct TFood *pfood, struct TSnake *psnake)
{
int hy = psnake->head->y;
int hx = psnake->head->x;
if (hy <= || hy >= GAMEWIN_YLEN || hx <= || hx >= GAMEWIN_XLEN)
{
return -;
} struct TSnakeNode *pnode = GetSnakeTail(psnake);
int i = ;
for (; i < psnake->length - ; ++i, pnode = pnode->front)
{
if (hy == pnode->y && hx == pnode->x)
{
return -;
} }
if (hy == pfood->y && hx == pfood->x)
{
return ;
}
return ;
} void snakegrowup(struct TFood *pfood, struct TSnake *psnake)
{
struct TSnakeNode *pnode = (struct TSnakeNode *)malloc(sizeof(struct TSnakeNode)); switch(psnake->dir)
{
case DIR_UP:
pnode->y = psnake->head->y - ;
pnode->x = psnake->head->x;
break; case DIR_DOWN:
pnode->y = psnake->head->y + ;
pnode->x = psnake->head->x;
break; case DIR_LEFT:
pnode->y = psnake->head->y ;
pnode->x = psnake->head->x - ;
break; case DIR_RIGHT:
pnode->y = psnake->head->y;
pnode->x = psnake->head->x + ;
break; default:
break;
} pnode->front = GetSnakeTail(psnake);
psnake->head->front = pnode;
psnake->head = pnode;
++psnake->length;
} void gameover(WINDOW *win, char *str)
{
mvwprintw(win, (int)(GAMEWIN_YLEN/), (GAMEWIN_XLEN/ - strlen(str)/), str);
mvwprintw(win, (int)(GAMEWIN_YLEN/ + ), , "Please any key to quit...");
wrefresh(win);
} struct TSnakeNode *newsnakenode(struct TSnakeNode **ppsnode, int y, int x)
{
*ppsnode = (struct TSnakeNode *)malloc(sizeof(struct TSnakeNode));
(*ppsnode)->y = y;
(*ppsnode)->x = x;
(*ppsnode)->front = NULL; return *ppsnode;
} struct TSnake *initsnake()
{
struct TSnake *psnake = (struct TSnake *)malloc(sizeof(struct TSnake)); psnake->dir = DIR_LEFT;
psnake->length = ; newsnakenode(&newsnakenode(&newsnakenode(&newsnakenode(&psnake->head, , )->front,
, )->front, , )->front,
, )->front = psnake->head; return psnake;
} void destroysnake(struct TSnake *psnake)
{
struct TSnakeNode *psnode = GetSnakeTail(psnake);
struct TSnakeNode *ptmp = NULL; int i = ;
for (; i < psnake->length; ++i)
{
ptmp = psnode;
psnode = psnode->front;
free(ptmp);
} free(psnake);
psnake = NULL;
} void drawsnakew(WINDOW *win, struct TSnake *psnake)
{
static int taily = ;
static int tailx = ;
if (taily != && tailx != )
{
//将光标移动到指定窗口的指定位置(taily, tailx)然后输出字符
mvwaddch(win, taily, tailx, ' ');
} struct TSnakeNode *psnode = GetSnakeTail(psnake); int i = ;
for (; i < psnake->length; ++i)
{
mvwaddch(win, psnode->y, psnode->x, SHAPE_SNAKE);
psnode = psnode->front;
} taily = GetSnakeTail(psnake)->y;
tailx = GetSnakeTail(psnake)->x; wrefresh(win);
} void drawfoodw(WINDOW *win, struct TFood *pfood, struct TSnake *psnake)
{
do
{
pfood->y = random() % (GAMEWIN_YLEN - ) + ;
pfood->x = random() % (GAMEWIN_XLEN - ) + ;
}while(False == checkfood(pfood, psnake)); checkfood(pfood, psnake);
mvwaddch(win, pfood->y, pfood->x, SHAPE_FOOD);
wrefresh(win);
} //检查food出现的位置不能在snake上
TBool checkfood(struct TFood *pfood, struct TSnake *psnake)
{
struct TSnakeNode *pnode = GetSnakeTail(psnake); int i = ;
for (; i < psnake->length; ++i, pnode = pnode->front)
{
if (pfood->y == pnode->y && pfood->x == pnode->x)
{
return false;
}
} return true;
}
两个重点:
1.整个窗口的坐标以(0,0)为原点,x轴,y轴建立坐标点,x轴正向和y轴负向作为数值增大的方向,所以坐标移动时向下y轴坐标+1,反之-1
2.蛇移动时,每次只移动一个单位距离,所以只需要将最后一个节点拿走,放到要移动的那个位置上就整体上有移动的感觉了,至于移动的位置会有函数检测是否合法。
注意:
程序用到了ncurses库,如果没有的话需要下载:
# 更新软件源中的所有软件列表
$ sudo apt-get update # 安装 `curses` 库
$ sudo apt-get install libncurses5-dev
编译时最后要加上-lncurses
C语言实现贪吃蛇游戏的更多相关文章
- 小项目特供 贪吃蛇游戏(基于C语言)
C语言写贪吃蛇本来是打算去年暑假写的,结果因为ACM集训给耽搁了,因此借寒假的两天功夫写了这个贪吃蛇小项目,顺带把C语言重温了一次. 是发表博客的前一天开始写的,一共写了三个版本,第一天写了第一版,第 ...
- 贪吃蛇游戏——C语言双向链表实现
采用了双向链表结点来模拟蛇身结点: 通过C语言光标控制函数来打印地图.蛇身和食物: /************************** *************************** 贪吃 ...
- 【C语言项目】贪吃蛇游戏(上)
目录 00. 目录 01. 开发背景 02. 功能介绍 03. 欢迎界面设计 3.1 常用终端控制函数 3.2 设置文本颜色函数 3.3 设置光标位置函数 3.4 绘制字符画(蛇) 3.5 欢迎界面函 ...
- 贪吃蛇游戏(printf输出C语言版本)
这一次我们应用printf输出实现一个经典的小游戏—贪吃蛇,主要难点是小蛇数据如何存储.如何实现转弯的效果.吃到食物后如何增加长度. 1 构造小蛇 首先,在画面中显示一条静止的小蛇.二维数组canva ...
- 使用Love2D引擎开发贪吃蛇游戏
今天来介绍博主近期捣腾的一个小游戏[贪吃蛇],贪吃蛇这个游戏相信大家都不会感到陌生吧.今天博主将通过Love2D这款游戏引擎来为大家实现一个简单的贪吃蛇游戏,在本篇文章其中我们将会涉及到贪吃蛇的基本算 ...
- Android快乐贪吃蛇游戏实战项目开发教程-01项目概述与目录
一.项目简介 贪吃蛇是一个很经典的游戏,也很适合用来学习.本教程将和大家一起做一个Android版的贪吃蛇游戏. 我已经将做好的案例上传到了应用宝,无病毒.无广告,大家可以放心下载下来把玩一下.应用宝 ...
- 用C++实现的贪吃蛇游戏
我是一个C++初学者,控制台实现了一个贪吃蛇游戏. 代码如下: //"贪吃蛇游戏"V1.0 //李国良于2016年12月29日编写完成 #include <iostream& ...
- WebGL实现HTML5的3D贪吃蛇游戏
js1k.com收集了小于1k的javascript小例子,里面有很多很炫很酷的游戏和特效,今年规则又增加了新花样,传统的classic类型基础上又增加了WebGL类型,以及允许增加到2K的++类型, ...
- 100行JS实现HTML5的3D贪吃蛇游戏
js1k.com收集了小于1k的javascript小例子,里面有很多很炫很酷的游戏和特效,今年规则又增加了新花样,传统的classic类型基础上又增加了WebGL类型,以及允许增加到2K的++类型, ...
随机推荐
- react 练习参考
项目地址:https://gitee.com/dhclly/icedog.react React 练习项目 相关资源链接 React官方 https://reactjs.org React 中国 ht ...
- 镭神激光雷达对于Autoware的适配
1. 前言 我们的自动驾驶采用镭神激光雷达,在使用Autoware的时候,需要对镭神激光雷达的底层驱动,进行一些改变以适配Autoware. 2. 修改 (1)首先修改lslidar_c32.laun ...
- 【07】Nginx:状态统计 / 状态码统计
写在前面的话 在 nginx 中,有些时候我们希望能够知道目前到底有多少个客户端连接到了我们的网站.我们希望有这样一个页面来专门统计显示这些情况.这个需求在 nginx 中是可以实现的,我们可以通过简 ...
- FocusVisualStyle
<Style x:Key="MyFocusVisual"> <Setter Property="Control.Template"& ...
- Python - 输入和输出 - 第十七天
Python 输入和输出 在前面几个章节中,我们其实已经接触了 Python 的输入输出的功能.本章节我们将具体介绍 Python 的输入输出. 输出格式美化 Python两种输出值的方式: 表达式语 ...
- Docker(二)-在Docker中部署Nginx实现负载均衡(视频教程)
本教程介绍利用Docker部署Nginx服务实现负载均衡. (双击全屏播放)
- 中国爬虫违法违规案例汇总github项目介绍
中国爬虫违法违规案例汇总github项目介绍 GitHub - 本项目用来整理所有中国大陆爬虫开发者涉诉与违规相关的新闻.资料与法律法规.致力于帮助在中国大陆工作的爬虫行业从业者了解我国相关法律,避免 ...
- 深入Java源码剖析之Set集合
Java的集合类由Collection接口和Map接口派生,其中: List代表有序集合,元素有序且可重复 Set代表无序集合,元素无序且不可重复 Map集合存储键值对 那么本篇文章将从源码角度讨论一 ...
- Arthas实践--抽丝剥茧排查线上应用日志打满问题
现象 在应用的 service_stdout.log里一直输出下面的日志,直接把磁盘打满了: 23:07:34.441 [TAIRCLIENT-1-thread-1] DEBUG io.netty.c ...
- Confluence 邮箱设置
Confluence有两种方法设置邮箱 原理: confluence服务器配置好邮箱信息,用户触发邮件发送规则时,confluence服务使用已配置的邮箱信息登录到邮箱服务器,进行发件服务. 那么我们 ...