小游戏贪吃蛇

操作说明:通过键盘上的左键和右键控制“蛇头”向左或者向右移动,基本玩法和游戏规则与贪吃蛇是一致的。(想象自己是“蛇头”,面向前面进行左右操作)

#include <cstdlib>
#include <iostream>
#include <list>
#include <thread>
using namespace std;

#include <Windows.h>

int nScreenWidth = 120;
int nScreenHeight = 30;

struct sSnakeSegment
{
    int x;
    int y;
};

int main()
{
    //Create Screen Buffer
    char *screen = new char[nScreenWidth * nScreenHeight];
    for (int i = 0; i != nScreenWidth * nScreenHeight; i++)
        screen[i] = ' ';
    HANDLE hConsole = CreateConsoleScreenBuffer(GENERIC_READ | GENERIC_WRITE, 0, NULL, CONSOLE_TEXTMODE_BUFFER, NULL);
    SetConsoleActiveScreenBuffer(hConsole);
    DWORD dwBytesWritten = 0;

    while (1)
    {

        list<sSnakeSegment> snake = {{60, 15}, {61, 15}, {62, 15}, {63, 15}, {64, 15}, {65, 15}, {66, 15}, {67, 15}, {68, 15}, {69, 15}};
        int nFoodX = 30;
        int nFoodY = 15;
        int nScore = 0;
        int nSnakeDirection = 3;
        bool bDead = false;
        bool bKeyLeft = false, bKeyRight = false, bKeyLeftOld = false, bKeyRightOld = false;

        while (!bDead)
        {
            // Timing & Input
            //this_thread::sleep_for(200ms);

            //Get Input
            auto t1 = chrono::system_clock::now();
            while ((chrono::system_clock::now() - t1) < ((nSnakeDirection % 2 == 1) ? 120ms : 200ms))
            {
                bKeyRight = (0x8000 & GetAsyncKeyState((unsigned char)('\x27'))) != 0;
                bKeyLeft = (0x8000 & GetAsyncKeyState((unsigned char)('\x25'))) != 0;

                if (bKeyRight && !bKeyRightOld)
                {
                    nSnakeDirection++;
                    if (nSnakeDirection == 4)
                        nSnakeDirection = 0;
                }
                if (bKeyLeft && !bKeyLeftOld)
                {
                    nSnakeDirection--;
                    if (nSnakeDirection == -1)
                        nSnakeDirection = 3;
                }
                bKeyLeftOld = bKeyLeft;
                bKeyRightOld = bKeyRight;
            }

            //Game Logic
            //Updata Snake position
            switch (nSnakeDirection)
            {
            case 0: //UP
                snake.push_front({snake.front().x, snake.front().y - 1});
                break;
            case 1: //RIGHT
                snake.push_front({snake.front().x + 1, snake.front().y});
                break;
            case 2: //DOWN
                snake.push_front({snake.front().x, snake.front().y + 1});
                break;
            case 3: //LEFT
                snake.push_front({snake.front().x - 1, snake.front().y});
                break;
            }

            //Collison Dection
            //For broder
            if (snake.front().x < 0 || snake.front().x > nScreenWidth)
                bDead = true;
            if (snake.front().y < 3 || snake.front().y >= nScreenHeight)
                bDead = true;

            //For Food
            if (snake.front().x == nFoodX && snake.front().y == nFoodY)
            {
                nScore++;
                while (screen[nFoodY * nScreenWidth + nFoodX] != ' ')
                { //generate a "food" within the border
                    nFoodX = rand() % nScreenWidth;
                    nFoodY = (rand() % (nScreenHeight - 3)) + 3;
                }
                for (int i = 0; i != 5; i++)
                {
                    snake.push_back({snake.back().x, snake.back().y});
                }
            }

            //For Snake
            for (list<sSnakeSegment>::iterator i = snake.begin(); i != snake.end(); i++)
                if (i != snake.begin() && i->x == snake.front().x && i->y == snake.front().y)
                    bDead = true;

            //Chop pff Snake's tail
            snake.pop_back();

            //Display to player
            //Clear Screen
            for (int i = 0; i != nScreenWidth * nScreenHeight; i++)
                screen[i] = ' ';

            //Draw Stats & Border
            for (int i = 0; i != nScreenWidth; i++)
            {
                screen[i] = '=';
                screen[2 * nScreenWidth + i] = L'=';
            }
            wsprintf(&screen[nScreenWidth + 5], "     Game name:Snake     Author:Hechun Jiang     YOUR SCORES:%d     ", nScore);

            //Draw Snake Body
            for (auto s : snake)
                screen[s.y * nScreenWidth + s.x] = bDead ? '+' : 'O';

            //Draw Snake Head
            screen[snake.front().y * nScreenWidth + snake.front().x] = bDead ? 'X' : '@';

            //Draw Food
            screen[nFoodY * nScreenWidth + nFoodX] = '%';
            if (bDead)
                wsprintf(&screen[15 * nScreenWidth + 40], "     if you want to try again, please press 'SPACE'     ");

            //Display Frame
            WriteConsoleOutputCharacter(hConsole, screen, nScreenHeight * nScreenWidth, {0, 0}, &dwBytesWritten);
        }

        //check 'space'
        while ((0x8000 & GetAsyncKeyState((unsigned char)('\x20'))) == 0)
            ;
    }

    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 2
    评论
代码下载:完整代码,可直接运行 ;运行版本:2022a或2019b或2014a;若运行有问题,可私信博主; **仿真咨询 1 各类智能优化算法改进及应用** 生产调度、经济调度、装配线调度、充电优化、车间调度、发车优化、水库调度、三维装箱、物流选址、货位优化、公交排班优化、充电桩布局优化、车间布局优化、集装箱船配载优化、水泵组合优化、解医疗资源分配优化、设施布局优化、可视域基站和无人机选址优化 **2 机器学习和深度学习方面** 卷积神经网络(CNN)、LSTM、支持向量机(SVM)、最小二乘支持向量机(LSSVM)、极限学习机(ELM)、核极限学习机(KELM)、BP、RBF、宽度学习、DBN、RF、RBF、DELM、XGBOOST、TCN实现风电预测、光伏预测、电池寿命预测、辐射源识别、交通流预测、负荷预测、股价预测、PM2.5浓度预测、电池健康状态预测、水体光学参数反演、NLOS信号识别、地铁停车精准预测、变压器故障诊断 **3 图像处理方面** 图像识别、图像分割、图像检测、图像隐藏、图像配准、图像拼接、图像融合、图像增强、图像压缩感知 **4 路径规划方面** 旅行商问题(TSP)、车辆路径问题(VRP、MVRP、CVRP、VRPTW等)、无人机三维路径规划、无人机协同、无人机编队、机器人路径规划、栅格地图路径规划、多式联运运输问题、车辆协同无人机路径规划、天线线性阵列分布优化、车间布局优化 **5 无人机应用方面** 无人机路径规划、无人机控制、无人机编队、无人机协同、无人机任务分配 **6 无线传感器定位及布局方面** 传感器部署优化、通信协议优化、路由优化、目标定位优化、Dv-Hop定位优化、Leach协议优化、WSN覆盖优化、组播优化、RSSI定位优化 **7 信号处理方面** 信号识别、信号加密、信号去噪、信号增强、雷达信号处理、信号水印嵌入提取、肌电信号、脑电信号、信号配时优化 **8 电力系统方面** 微电网优化、无功优化、配电网重构、储能配置 **9 元胞自动机方面** 交通流 人群疏散 病毒扩散 晶体生长 **10 雷达方面** 卡尔曼滤波跟踪、航迹关联、航迹融合

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值