C語言實(shí)現(xiàn)貪吃蛇游戲
更新時(shí)間：2018年03月19日 11:25:01 作者：Johnny_Law
這篇文章主要為大家詳細(xì)介紹了C語言實(shí)現(xiàn)貪吃蛇游戲，文中示例代碼介紹的非常詳細(xì)，具有一定的參考價(jià)值，感興趣的小伙伴們可以參考一下
最近整理下電腦，看到了自己在上個(gè)學(xué)期打的貪吃蛇游戲的c代碼，覺得真的是略微有點(diǎn)冗長(zhǎng)，但是實(shí)現(xiàn)起來應(yīng)該也算是比較好理解，于是把自己的代碼搬上來，網(wǎng)絡(luò)上寫貪吃蛇的c語言的文章很多，我這篇也僅是給大家作為一個(gè)參考而已。
我的代碼是在Windows下運(yùn)行的，因?yàn)樾枰玫絯indows.h這個(gè)庫(kù)。
然后也做了一個(gè)簡(jiǎn)單的ai模式，這在沒有障礙物的情況下前期還是蠻不錯(cuò)的，但是到了后期蛇變長(zhǎng)了之后就會(huì)有bug了。
好了，直接上代碼吧：
1）頭文件和宏定義
#include<stdio.h> #include<stdlib.h> #include<time.h> #include<conio.h> #include<windows.h> #define SNAKE_MAX_LENGTH 20 #define SNAKE_HEAD 'H' #define SNAKE_BODY 'X' #define BLANK_CELL '' #define SNAKE_FOOD '$' #define WALL_CELL '*'
2）各種實(shí)現(xiàn)函數(shù)的聲明
/*snake stepping: dy = -1(up) 1(dowm) 0(no move); dx = -1(left), 1(right), 0(no move)*/ void snakemove(int, int); //to write dowm the current location of the snake void put_money(void); void output(void); // to put the current map on the screen void initial_the_game(void); void put_accelerate(void); // @ is a special food which can speed up your snake. int judge(int, int); /* when it comes to ai, it is used to judge whether the next step is movable. */ int dis(int, int); // when it coomes to ai, it is used to calculate the current distence //between the snake head and the food. void welcome(void); // the game introduction. void gameover(void); void edition_handed(void); // the edition in which you can play by yourself. void edition_presentation(void); // the edition in which the snake can go automatically.
3）各種全局變量
// define vars for snake,notice name of vars in c
int snakeX[SNAKE_MAX_LENGTH] = {1, 2, 3, 4, 5};
int snakeY[SNAKE_MAX_LENGTH] = {1, 1, 1, 1, 1};
int snakeLength = 5;
int gamestate = 1;
int current_speed = 600;
int score = 0;
char edition_choose; // for player to choose the edition.
int con = 1; // to judge the initial state of the game;
int energy = 0; // write down the condition to accelerate by eating $.
//the following part is to realize the simple ai .
const char movable[4] = {'a', 'd', 's', 'w'};
int distance[4] = {9999, 9999, 9999, 9999};
int fx = 6, fy = 6; // the coordinate of the food $
4）地圖
char map[12][12] =
{"************",
"*XXXXH *",
"* *",
"* *",
"* *",
"* *",
"* $ *",
"* *",
"* @ *",
"* *",
"* *",
"************"};
5）主函數(shù)（可選模式）
int main() {
while (con) {
welcome();
int flag = 1;
while (flag) {
edition_choose = getch(); //choose the edition
if (edition_choose == 'h') {
edition_handed();
flag = 0;
}
else if (edition_choose == 'p') {
edition_presentation();
flag = 0;
}
else {
printf("Please press the correct bottom -,- ...\n");
}
}
gameover();
}
return 0;
}
6）手動(dòng)模式實(shí)現(xiàn)
void edition_handed(void) {
system("cls");
output();
char ch = 'd';
while (gamestate) {
switch (ch) {
case 'a': // go left
while (1) {
snakemove(-1, 0);
Sleep(current_speed);
if (gamestate == 0) // to break the loop if the snake hit the wall or itself.
break;
if (kbhit() != 0) { // to change the direction
ch = getch();
if (ch == 's' || ch == 'w')
break;
else
ch = 'a';
}
}
break;
case 'd': // go right
while (1) {
snakemove(1, 0);
Sleep(current_speed);
if (gamestate == 0)
break;
if (kbhit() != 0)
ch = getch();
if (ch == 's' || ch == 'w')
break;
else
ch = 'd';
}
break;
case 's': // go down
while (1) {
snakemove(0, 1);
Sleep(current_speed);
if (gamestate == 0)
break;
if (kbhit() != 0)
ch = getch();
if (ch == 'a' || ch == 'd')
break;
else
ch = 's';
}
break;
case 'w': // go up
while (1) {
snakemove(0, -1);
Sleep(current_speed);
if (gamestate == 0)
break;
if (kbhit() != 0)
ch = getch();
if (ch == 'a' || ch == 'd')
break;
else
ch = 'w';
}
break;
}
if (gamestate == 0)
break;
}
return;
}
7）自動(dòng)模式實(shí)現(xiàn)
void edition_presentation(void) { // for ai
system("cls");
int i, min = 10000;
output();
char ch;
char quit = 'o';
int k;
while (gamestate) { // find the shortest way;
min = 10000;
if (judge(-1, 0)) distance[0] = dis(-1, 0);
if (judge(1, 0)) distance[1] = dis(1, 0);
if (judge(0, 1)) distance[2] = dis(0, 1);
if (judge(0, -1)) distance[3] = dis(0, -1);
for (i = 0; i < 4; i++) {
if (min >= distance[i]) {
min = distance[i];
k = i;
}
}
Sleep(current_speed);
switch (movable[k]) {
case 'a': // go left
snakemove(-1, 0);
break;
case 'd': // go right
snakemove(1, 0);
break;
case 's': // go down
snakemove(0, 1);
break;
case 'w': // go up
snakemove(0, -1);
break;
}
if (gamestate == 0)
break;
system("cls");
output();
}
return;
}
8）其他輔助函數(shù)
歡迎界面
void welcome(void) { // just for some introduction
printf("WELCOME TO THE SNAKE'S WORLD !!!!\n");
printf("\n");
printf("\n");
printf("Please choose the edition you want.\n");
printf("\n");
printf("\n");
printf("The 'h' is for the hand-operated and the 'p' is for the simple presentation\n");
printf("\n");
printf("\n");
printf("Attention: the presentation still has a liitle bug, while it can be moving right for a period of time...\n ");
return;
}
游戲結(jié)束界面
void gameover(void) { // give you some introduction when you lose the game.
system("cls");
printf("Game over!!!\n");
printf("Do you want to continue? y or n\n");
char start; // in order to judge whether you still want to play the game.
while (1) {
start = getch();
if (start == 'y') {
system("cls");
initial_the_game();
break;
} else if (start == 'n') {
system("cls");
con = 0; // in order to let the game end.
printf("See you next time! ^-^\n");
break;
} else {
printf("Please press the correct buttom.\n");
}
}
}
圖像實(shí)現(xiàn)方式
void output(void) { // put the cuttent game map.
printf("THE INTERESTING SNAKE GAME CREATED BY LONGJ =,=\n");
printf("use w~s~a~d to control the snake's movement\n");
printf("ATTENTION: the @ can speed up your lovely snake~~\n");
int i, j;
for (i = 0; i < 12; i++) {
for (j = 0; j < 12; j++) {
printf("%c", map[i][j]);
if (j == 11)
printf("\n");
}
}
printf("Your current_speed is %d\n", current_speed);
printf("The number of your food undigested is %d (when it comes to 5, your speed will be accelerated!) \n", energy);
printf("SCORE = %d\n", score);
return;
}
蛇的行走實(shí)現(xiàn)
void snakemove(int dx, int dy) { // all the conditions are comparing the head and the next position.
int i;
if (snakeY[snakeLength - 1] + dy == snakeY[snakeLength - 2] && snakeX[snakeLength - 1] + dx == snakeX[snakeLength - 2])
return; // to prevent it go to itslef.
if (map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == 'X') {
gamestate = 0;
return;
}
if (map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == '*') {
gamestate = 0;
return;
}
if (map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == ' '
|| map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == '@') {
map[snakeY[0]][snakeX[0]] = ' '; // clear the former_tail
if (map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == '@'
&& current_speed > 100) { // what will happen when your snake eats the @
current_speed -= 100;
put_accelerate();
}
for (i = 0; i < snakeLength - 1; ++i) {
snakeX[i] = snakeX[i + 1];
snakeY[i] = snakeY[i + 1];
}
snakeX[snakeLength - 1] += dx;
snakeY[snakeLength - 1] += dy;
for (i = 0; i < snakeLength - 1; i++) // write down the current snake location
map[snakeY[i]][snakeX[i]] = 'X';
map[snakeY[snakeLength - 1]][snakeX[snakeLength - 1]] = 'H';
}
if (map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == '$') {
map[snakeY[snakeLength - 1]][snakeX[snakeLength - 1]] = 'X';
snakeLength++;
snakeX[snakeLength - 1] = snakeX[snakeLength - 2] + dx;
snakeY[snakeLength - 1] = snakeY[snakeLength - 2] + dy;
map[snakeY[snakeLength - 1]][snakeX[snakeLength - 1]] = 'H';
score++;
energy++;
if (energy == 5 && current_speed > 50) {
current_speed -= 50;
energy = 0;
}
put_money();
}
system("cls");
output();
return;
}
食物放置的實(shí)現(xiàn)
void put_money(void) { /// ai will change the code
int flag = 1;
while (flag) {
srand(time(NULL));
fx = rand() % 12;
fy = rand() % 12;
if (map[fy][fx] == ' ') {
map[fy][fx] = '$';
flag = 0;
}
if (edition_choose == 'p') {
int i;
for (i = 0; i< 4; i++)
distance[i] = 9999;
}
}
return;
}
void put_accelerate(void) {
int x, y, flag = 1;
while (flag) {
srand(time(NULL));
x = rand() % 12;
y = rand() % 12;
if (map[x][y] == ' ') {
map[x][y] = '@';
flag = 0;
}
}
return;
}
ai輔助函數(shù)
int dis(int dx, int dy) {
return abs(fx - snakeX[snakeLength - 1] - dx) + abs(fy - snakeY[snakeLength - 1] - dy);
}
int judge(int dx, int dy) {
if (map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == ' ')
return 1;
else if (map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == '$')
return 1;
else if (map[snakeY[snakeLength - 1] + dy][snakeX[snakeLength - 1] + dx] == '@')
return 1;
else
return 0;
}
游戲over后的初始化函數(shù)：
void initial_the_game(void) {
int i, j, count = 1;
snakeLength = 5;
gamestate = 1;
fx = fy = 6;
current_speed = 600;
for (i = 0; i < 5; i++)
snakeY[i] = 1;
for (i = 0; i < 5; i++) {
snakeX[i] = count++;
}
for (j = 0; j < 12; j++) {
map[0][j] = '*';
map[11][j] = '*';
}
for (i = 1; i < 11; i++) {
map[i][0] = map[i][11] = '*';
for (j = 1; j < 11; j++)
map[i][j] = ' ';
}
map[fy][fx] ='$';
map[8][4] = '@';
for (i = 0; i< 4; i++) {
distance[i] = 9999;
}
for (i = 0; i < 4; i++)
map[snakeY[i]][snakeX[i]] = 'X';
map[snakeY[4]][snakeX[4]] = 'H';
return;
}
小結(jié)：
不難看出，c語言代碼比較冗長(zhǎng)，而且初始化的函數(shù)實(shí)現(xiàn)起來十分麻煩，稍有不慎就會(huì)全部出錯(cuò)，導(dǎo)致游戲無法持續(xù)玩下去，博主當(dāng)初寫的時(shí)候就是被坑了很久=_=
因而現(xiàn)在在學(xué)c++，希望以后把類的概念之類的東西都弄得更加熟練之后，可以去把這個(gè)冗長(zhǎng)的c代碼改成更加簡(jiǎn)潔，閱讀性更強(qiáng)的c++代碼。
（好的，已經(jīng)更新了，寫出了一個(gè)比較簡(jiǎn)單的C++貪吃蛇，的確是思路清晰很多，代碼的可讀性更高。）
這篇博客給那些想要用c來寫貪吃蛇的同學(xué)一些參考，運(yùn)行起來是沒有問題的，可以選擇性看：）
以上就是本文的全部?jī)?nèi)容，希望對(duì)大家的學(xué)習(xí)有所幫助，也希望大家多多支持腳本之家。
相關(guān)文章
這篇文章主要介紹了MFC命名規(guī)則,對(duì)于初學(xué)者而言需要牢固掌握這類規(guī)則,需要的朋友可以參考下2014-07-07
使用C語言求解撲克牌的順子及n個(gè)骰子的點(diǎn)數(shù)問題
這篇文章主要介紹了使用C語言求解撲克牌的順子及n個(gè)骰子的點(diǎn)數(shù)問題的方法,解答實(shí)例主要為了突出解題的算法,需要的朋友可以參考下2016-03-03
位圖（bitset）是一種常用的數(shù)據(jù)結(jié)構(gòu)，常用在給一個(gè)很大范圍的數(shù)，判斷其中的一個(gè)數(shù)是不是在其中。這篇文章主要給大家介紹了關(guān)于C++位圖以及位圖的實(shí)現(xiàn)原理與方法，需要的朋友可以參考下2021-05-05
這篇文章主要為大家詳細(xì)介紹了C語言實(shí)現(xiàn)頁(yè)面置換算法，文中示例代碼介紹的非常詳細(xì)，具有一定的參考價(jià)值，感興趣的小伙伴們可以參考一下2020-12-12
這篇文章主要介紹了C++實(shí)現(xiàn)廣播通信的方法,實(shí)例講述了C++ socket廣播通信的原理與實(shí)現(xiàn)方法,需要的朋友可以參考下2014-10-10
C語言 鏈?zhǔn)蕉鏄浣Y(jié)構(gòu)詳解原理
二叉樹的鏈?zhǔn)酱鎯?chǔ)結(jié)構(gòu)是指，用鏈表來表示一棵二叉樹，即用鏈來指示元素的邏輯關(guān)系。通常的方法是鏈表中每個(gè)結(jié)點(diǎn)由三個(gè)域組成，數(shù)據(jù)域和左右指針域，左右指針分別用來給出該結(jié)點(diǎn)左孩子和右孩子所在的鏈結(jié)點(diǎn)的存儲(chǔ)地址2021-11-11
這篇文章主要介紹了如何用C語言實(shí)現(xiàn)socket編程，文中代碼非常詳細(xì)，供大家學(xué)習(xí)參考，感興趣的朋友可以了解下2020-06-06
本篇文章主要介紹了C++11返回類型后置語法的使用示例，小編覺得挺不錯(cuò)的，現(xiàn)在分享給大家，也給大家做個(gè)參考。一起跟隨小編過來看看吧2017-10-10
C++項(xiàng)目開發(fā)實(shí)現(xiàn)圖書管理系統(tǒng)
這篇文章主要為大家詳細(xì)介紹了C++項(xiàng)目開發(fā)實(shí)現(xiàn)圖書管理系統(tǒng)，文中示例代碼介紹的非常詳細(xì)，具有一定的參考價(jià)值，感興趣的小伙伴們可以參考一下2022-03-03
在C++編程中,位操作是基礎(chǔ)而強(qiáng)大的技術(shù),允許在二進(jìn)制級(jí)別上操作數(shù)據(jù),對(duì)性能優(yōu)化、內(nèi)存節(jié)省和底層硬件控制至關(guān)重要,文章探討了掩碼操作、字節(jié)提取與組裝等技術(shù),并介紹了bitset類模板的使用,幫助處理二進(jìn)制數(shù)據(jù),通過實(shí)例解析如何設(shè)置、清除、檢查特定位2024-10-10