贪吃蛇

最新推荐文章于 2019-06-11 14:14:06 发布
最新推荐文章于 2019-06-11 14:14:06 发布
阅读量933 收藏 2
点赞数
分类专栏： C++
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/ilsswfr/article/details/50776676
版权

嗯，这个版本的贪吃蛇用链表实现


创建一个蛇头  连接蛇身（随机初始化整条蛇）

         因为在蛇移动的过程中 可以蛇头更新为新到达的位置  蛇尾删除并将原来的链接蛇尾的那节作为新的蛇尾

使用gotoxy进行屏幕的更新操作 避免 system（“cls”）频繁刷新造成的闪屏


具体代码如下

//ILSSWFR
#include<iostream>
#include<conio.h>
#include<cstdlib>
#include"windows.h"
#include<ctime>
using namespace std;
int speed[9]={0,500,400,350,300,250,200,150};
int speed2[13]={0,400,400,400,300,300,300,200,200,200,150,150};
int cc2[13]={0,1,2,3,4,5,6,7,4,5,6,7};
int level1[17][27]
    ,level3[17][27]={{1,0,0,0,1,1,1,1,1,1,0,0,0,0,0,1,1,1,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0}
                    ,{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0}
                    ,{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0}
                    ,{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0}
                    ,{1,0,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,1,1}}

    ,level2[17][27]={{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}}

    ,level4[17][27]={{1,0,0,0,0,0,0,0,0,0,1,1,1,1,1,0,0,0,0}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}
                    ,{1,0,0,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0,0}
                    ,{1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0}
                    ,{0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0}
                    ,{0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0}
                    ,{0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1}
                    ,{0,0,0,0,0,0,1,1,1,1,1,1,0,0,1,0,0,0,1}
                    ,{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1}
                    ,{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1}}

    ,level5[17][27]={{1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0}
                    ,{1,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0}
                    ,{1,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0}
                    ,{1,0,0,1,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1}
                    ,{1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,1}
                    ,{0,0,0,0,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1}
                    ,{0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,1}
                    ,{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1}
                    ,{1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1}}

    ,level6[17][27]={{1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}
                    ,{1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
                    ,{1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0}
                    ,{1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0}
                    ,{1,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,0,0,0}
                    ,{1,1,1,1,1,1,0,0,0,1,1,1,1,0,0,1,0,0,0}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0}
                    ,{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0}
                    ,{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0}}

    ,level7[17][27]={{1,1,1,1,0,0,0,1,1,1,1,1,1,1,1,1,0,0,0}
                    ,{0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0}
                    ,{0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0}
                    ,{0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0}
                    ,{0,0,0,1,0,0,1,0,0,1,0,0,0,1,0,0,0,0,1}
                    ,{0,0,0,1,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1}
                    ,{0,0,0,1,0,0,1,0,0,1,1,1,1,1,0,0,0,0,1}
                    ,{0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1}
                    ,{0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1}
                    ,{0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1}
                    ,{0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}};
int *point[10]={NULL,level1[0],level2[0],level3[0],level4[0],level5[0],level6[0],level7[0]};
int p[17][27];//记录蛇身的位置
struct snake
{
    int x;
    int y;
    struct snake* next;
};
void gotoxy(int x, int y)
{
    COORD pos;
    pos.X = x;
    pos.Y = y;
    SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
}
int rad(int n)
{
   srand(unsigned(time(NULL)));
   return rand()%n;
}

struct snake* judge(struct snake* head,char choose )//嗯，这个比俄罗斯方块方便一点，如果不能移动就直接GAMEOVER了
{
     int a,b;
    struct snake* s=(struct snake*)malloc(sizeof(struct snake));

    if (choose=='w')
        a=-1,b=0;
    else if(choose=='s')
        a=1,b=0;
    else if (choose=='a')
        a=0,b=-1;
    else if (choose=='d')
        a=0,b=1;

    s->x=head->x+a;
    s->y=head->y+b;
    s->next=head;
 //system("pause");
    if (s->x==0){
         if (p[0][s->y]==1||p[10][s->y]==1)
             return NULL;
         s->x=9;
    }

    if (s->x==10){
         if (p[0][s->y]==1||p[10][s->y]==1)
             return NULL;
        s->x=1;
    }
    if (s->y==0){
             if (p[s->x][0]==1||p[s->x][18]==1)
             return NULL;
        s->y=17;
    }

    if (s->y==18){
        if (p[s->x][0]==1||p[s->x][18]==1)
             return NULL;
        s->y=1;
    }

    if (p[s->x][s->y]==1||p[s->x][s->y]==2)
        return NULL;

    return s;
}
void makeapple()//制造苹果
{
    int x,y;
    for (;;){
        x=rad(11);
        y=rad(19);
        if (!p[x][y]&&x!=0&&x!=10&&y!=0&&y!=18){
            p[x][y]=3;
            gotoxy(y,x);
            cout<<'$';
            return;
        }

    }

}
void moving(struct snake* head,char choose,int* score)//就是删除链表的尾节点，新增一个头节点
{
    gotoxy(head->y,head->x);
        cout<<'*';
    //system("pause");
    if (p[head->x][head->y]==3){
        *score+=50;
        gotoxy(25,3);
        cout<<*score;
        makeapple();
        return;
    }
    p[head->x][head->y]=2;

    struct snake* s=head,*k;
    for (;s->next->next!=NULL;)
        s=s->next;

   //cout<<"sss"<<endl;
  // system("pause");
        k=s;
        s=s->next;
        k->next=NULL;
   // cout<<"sss"<<endl;
   //system("pause");
    gotoxy(s->y,s->x);
    if (s->y==0||s->y==18||s->x==0||s->x==10)
        cout<<'.';
    else
        cout<<' ';
    gotoxy(k->y,k->x);
        cout<<'~';
    p[s->x][s->y]=0;
    free(s);


}
struct snake* makesnake(char *fx)//产生一个在随机位置的蛇，返回蛇头
{
 int sx,sy,flag=0;
 int arrow[4]={0,0,0,0};//上0,下1，左2，右3
 for (;;){
    sx=rad(11);
    sy=rad(19);
    if (sx==0||sx==10||sy==0||sy==18)
        continue;
    int i;

    for (i=0;i<5;++i){
      if (i+sx>10||p[i+sx][sy]) break;
    }
    if (i==5) arrow[1]++,flag=1;

    for (i=0;i<5;++i){
      if (sx-i<0||p[sx-i][sy]) break;
    }
    if (i==5) arrow[0]++,flag=1;

     for (i=0;i<5;++i){
      if (sy-i<0||p[sx][sy-i]) break;
    }
    if (i==5) arrow[2]++,flag=1;

    for (i=0;i<5;++i){
      if (sy+i>18||p[sx][sy+i]) break;
    }
    if (i==5) arrow[3]++,flag=1;

    if (flag)
        break;
    }
    int k=rad(4),local;
    for (int i=k;i<4;++i)
        if (arrow[i]) {local=i;flag=0;break;}
    for (int i=0;i<k&&flag;++i)
        if (arrow[i]) {local=i;break;}
    //找到一个满足存放蛇的长度的地方
    struct snake* s,*s1,*s2;
    s=(struct snake* )malloc(sizeof(struct snake));
    s1=(struct snake* )malloc(sizeof(struct snake));
    s2=(struct snake* )malloc(sizeof(struct snake));



    int a=0,b=0;
    if (local==0) a=-1,b=0,*fx='s';
    if (local==1) a=1,b=0,*fx='w';
    if (local==2) a=0,b=-1,*fx='d';
    if (local==3) a=0,b=1,*fx='a';


    s->x=sx+a;
    s->y=sy+b;
    s->next=s1;


    s1->x=s->x+a;
    s1->y=s->y+b;
    s1->next=s2;

    s2->x=s1->x+a;
    s2->y=s1->y+b;
    s2->next=NULL;

    p[s->x][s->y]=p[s1->x][s1->y]=p[s2->x][s2->y]=2;
    return s;//返回蛇头
}
bool findapple()//清
{
    for (int i=0;i<11;++i)
        for (int j=0;j<19;++j)
        if (p[i][j]==3) return true;
    return false;
}

void outscreen(struct snake* head)
{
    struct snake* s=head;
    for (;s->next!=NULL;)
        s=s->next;

    for (int i=0;i<11;++i){
        for (int j=0;j<19;++j){
        if (p[i][j]==1)
            cout<<'+';
        else if (p[i][j]==2){
            if (s->x==i&&s->y==j)
            cout<<'~';
            else
            cout<<'*';
        }

        else if (p[i][j]==3)
            cout<<'$';
        else if (i==0||i==10||j==0||j==18)
            cout<<'.';
        else
            cout<<' ';
    }
    cout<<endl;
    }
    gotoxy(20,2);
    cout<<"分数：";
    gotoxy(25,3);
    cout<<0;
    gotoxy(20,9);
    cout<<"1：暂停";
    gotoxy(20,10);
    cout<<"2：退出";

}
void gamestart(int level,int speeds,int tip,int *re)
{
HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE);
CONSOLE_CURSOR_INFO cci;
GetConsoleCursorInfo(hOut,&cci);
cci.bVisible = FALSE;
SetConsoleCursorInfo(hOut,&cci);
    system("cls");
    struct snake* head;

    for (int i=0;i<11;++i){
       for (int j=0;j<19;++j)
        p[i][j]=*(point[level]+i*27+j);
    }


    char choose,record;

    head=makesnake(&choose);

    record=choose;
    double start=clock(),startapple=clock();
    makeapple();

    int flag=0,score=0;
    system("cls");
    outscreen(head);
  // system("pause");
    for (;!flag;){
        while (!kbhit()||!(choose=getch())){
            if(int(clock()-start)<speeds) continue;
                start=clock();

            if ((head=judge(head,record))==NULL){ flag=1;break;}

            moving(head,choose,&score);
            if(tip&&score>=1000) {*re=3;return;}
        }

        if ((choose=='w'&&record=='s')||
            (choose=='a'&&record=='d')||
            (choose=='s'&&record=='w')||
            (choose=='d'&&record=='a')||
            (choose!='w'&&choose!='s'&&choose!='a'&&choose!='d'))
            ;
        else
            record=choose;

        if (choose=='1'){
             gotoxy(0,12);
             system("pause");
             gotoxy(0,12);
             for (int q=0;q<19;++q)
                cout<<' ';
        }

        if (choose=='2'){
            system("cls");
            *re=1;
            return;
        }
    }
    system("cls");
    cout<<"您获得的分数是："<<score<<endl;
    system("pause");
    *re=2;
}

int main()
{

   for(;;){

    system("cls");
    cout<<"-----------------------"<<endl;
    cout<<"|       贪吃蛇        |"<<endl;
    cout<<"-----------------------"<<endl;
    cout<<"|                     |"<<endl;
    cout<<"|                     |"<<endl;
    cout<<"|                     |"<<endl;
    cout<<"|     1:开始游戏      |"<<endl;
    cout<<"|     2:游戏介绍      |"<<endl;
    cout<<"|     3:退出游戏      |"<<endl;
    cout<<"|                     |"<<endl;
    cout<<"-----------------------"<<endl;
    char choose;


    choose=getch();
    if (choose=='3')
        return 0;

    else if (choose=='2'){
        system("cls");
        cout<<"传统模式一共有7个关卡，分别对应不同的地图";
        cout<<"并且有7个速度等级，玩家自选速度"<<endl<<endl;
        cout<<"极限模式一共有13个关卡，每关获得1000分后自动升级"<<endl<<endl;
        cout<<"具体操作如下"<<endl;
        cout<<"向左：a"<<endl;
        cout<<"向右：d"<<endl;
        cout<<"向上：w"<<endl;
        cout<<"向下：s"<<endl;
        system("pause");
    }

    else if (choose=='1'){
        char user1;
        system("cls");
        cout<<"1：传统模式\n2：极限模式"<<endl;
        user1=getch();
        system("cls");
        if (user1=='1'){
        cout<<"请选择关卡(1~7):"<<endl;
        char game=getch();
            system("cls");
        cout<<"请选择速度(1~7):"<<endl;
           user1=getch();
        int tip=0;
        gamestart(game-'0',speed[user1-'0'],0,&tip);

        }
         else if (user1=='2'){
            int j,re=3;
            for (j=1;j<=11&&re==3;++j){
                Sleep(300);
                gamestart(cc2[j],speed2[j],1,&re);
            }
            if(j==12){
                system("cls");
                cout<<"恭喜您通过所有关卡"<<endl;
                system("pause");
            }

       }
    }

    }
    return 0;
}






ilsswfr
关注
专栏目录
OpenGL贪吃蛇
12-13
学习OpenGL时尝试的第一个小游戏，虽然比较粗糙但是可以运行，OpenGL的工作方式与流程这里面也有
贪吃蛇（游戏）
weixin_34409357的博客
01-06 148
#include <iostream> #include <windows.h> #include <cstdlib> #include <time.h> //使用当前时间做种子 #include <conio.h> using namespace std; enum dir {Up, Down, Le...
PAOGD个人作业4——利用OpenGL设计贪吃蛇游戏
dick的博客
06-11 1647
中山大学数据科学与计算机学院本科生实验报告 （2019年春季学期） 课程名称 PAOGD 任课老师 郑贵锋 年级 16 专业（方向） 软件工程（计算机应用方向） 学号 16340132 姓名 梁颖霖 电话 13680473185 Email dic0k@qq.com 开始日期 2019/5/20 完成日期 2019/5/24 一、实验题目 HW4 利用OpenGL...
opengl贪吃蛇
02-26
用c语言，opengl绘图写的贪吃蛇，用wasd控制方向移动
opengl下的贪吃蛇
04-27
闲来无事用opengl做了一个贪吃蛇来玩，感觉还不错传上来和大家分享。不过由于时间关系没有注释，还望见谅。程序运行后用方向键控制小蛇，鼠标右键调节难度。
Labview贪吃蛇课程设计
最新发布
02-12
《Labview贪吃蛇课程设计：打造趣味性虚拟仪器》 Labview（Laboratory Virtual Instrument Engineering Workbench）是一款由美国国家仪器公司（NI）开发的图形化编程环境，专为构建虚拟仪器而设计。在“Labview...
贪 吃 蛇 ·
07-16
贪吃蛇游戏是一款经典的益智游戏，有PC和手机等多平台版本。既简单又耐玩。该游戏通过控制蛇头方向吃蛋，从而使得蛇变得越来越长。另外还有一种名为“贪吃蛇”钻井测井技术，是运用旋转导向系统、随钻测井系统等的油气田定向钻井、随钻测井技术，可完成海上“丛式井”和复杂油气层的开采需求，大幅降低油气田开发综合成本
基于OpenGL的贪吃蛇
11-27
基于OpenGL的贪吃蛇程序，适合初学者用来学习！很不错的，好好看看我又没有骗你们啊
使用OpenGL编写的贪吃蛇
sduzh的专栏
12-23 9039
用了大概半天的时间，用OpenGL编写了一个彩色贪吃蛇。和俄罗斯方块比较起来，因为这次使用了OpenGL,所以在画图上面花的时间很少。 用到的基础知识主要是双向链表。贪吃蛇是由一个一个方块所组成，每个方块有三个属性：横坐标 ， 纵坐标和颜色，所以定义下面的数据结构表示蛇身上的方块： typedef struct _SnakeNode{ int index_x; int in
[Android游戏源码]-简单的贪吃蛇源码.rar_Android游戏源码_android_android 贪吃蛇_贪吃蛇_贪
09-23
《简单的贪吃蛇源码分析与探讨》 贪吃蛇是一款经典的休闲游戏，深受各年龄段玩家的喜爱。在Android平台上，我们可以找到许多实现贪吃蛇的游戏源码，这为我们理解和学习移动游戏开发提供了宝贵的学习资源。这里我们...
基于OpenGL的贪吃蛇小游戏
06-19
基于OpenGL，利用MFC9.0开发的贪吃蛇小游戏 贪吃蛇 游戏
利用OpenGL设计贪吃蛇游戏
C486C的博客
05-27 3299
利用OpenGL设计贪吃蛇游戏 文章目录利用OpenGL设计贪吃蛇游戏任务介绍游戏玩法开发环境游戏实现贪吃蛇游戏的框架搭建主程序游戏类游戏对象类工具类着色器类摄像机类精灵渲染类场景、蛇、食物的渲染场景蛇、食物蛇、食物的控制逻辑蛇的移动食物的随机摆放和旋转碰撞检测与响应实现效果 任务介绍 贪吃蛇游戏：玩家控制贪吃蛇在游戏区域里驰骋，避免碰到自己或障碍物，尽可能地吃更多的食物以生长！ 游戏玩法 ...
3D贪食蛇游戏(OpenGL)
01-23
游戏很有意思，就是上手有些难，毕竟玩惯了2D贪食蛇。游戏采用关卡脚本机制， 作者已经为它编了12个地图（包括3个训练关，9个标准关卡），你也可以自编地图。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值