02 贪吃蛇

news/2024/9/23 14:14:05/
cle class="baidu_pl">
cle_content" class="article_content clearfix">
content_views" class="htmledit_views">

前言

呵呵 这是不知道 在哪里看到的 别人做的一个贪吃蛇 

因此 也把我 之前的 贪吃蛇 移植上来了 

当然 这个不过是为了 简单的入门了解, 呵呵 

然后 c++版本的贪吃蛇 需要先移植成 c 版本, 然后 再根据 单片机相关 设计调整

比如 led 点阵的输出, 比如 c99 语法的一些不兼容 

主控制程序

整体程序的结构如下, Test02Snake 是主控制程序, utils 是公共的东西 

snake 是贪吃蛇的相关实现 

c="https://img-blog.csdnimg.cn/4a84b43614f94187ad54ce204f0b9e4c.png" width="199" />

Test02Snake.c

<code>
#include "utils.h"
#include "snake.h"/*** main related*/
long counter = 1;u8 gled_end[8] = {0x38,0x7C,0x7E,0x3F,0x3F,0x7E,0x7C,0x38};void main() {int i;u8 xList[8] = {1, 2, 3, 4, 6}, yList[8] = {1, 2, 3, 4, 7};u8 word[8];Snake snakeIns;Snake *snake = &snakeIns;// snake = snakeInit();snakeInit(snake);snake->init(snake);snake->setMap(snake);snake->createFood(snake);ledToggle(6);while (1) {//  		snake->print(snake);snake->running(snake, counter);if (snake->isOver(snake))break;delay_ms(5);counter++;}while(1) {lightTubeByInt(snake->grade);printLedWord(8, gled_end);}}code>

utils.h

<code>#ifndef _utils_H
#define _utils_H#include "reg52.h"
#include "stdlib.h"typedef unsigned int u16;
typedef unsigned char u8;
typedef unsigned long u32;// led dot related 
sbit SHIFT_REG_INPUT = P3 ^6;
sbit STORE_REG_INPUT = P3 ^5;
sbit SERIAL_PORT_INPUT = P3 ^4;
#define LEDDZ_COL_PORT P0// tube related 
sbit LSA=P2^2;
sbit LSB=P2^3;
sbit LSC=P2^4;
#define SMG_A_DP_PORT	P0// keyboard matrix related
#define KEY_MATRIX_PORT	P1/*** delay $delayIn10Us us* @param ten_us*/
void delay_10us(u16 ten_us);/*** delay $delayInMs ms* @param ms*/
void delay_ms(u16 ms);/*** control led[pos] on/off* @param pos* @param on*/
void ledCtl(u8 pos, u8 on);/*** toggle led[pos] on/off* @param pos* @param on*/
void ledToggle(u8 pos);/*** random number * @param seed* @param max* @param min*/
unsigned int randomInt(unsigned int seed, unsigned int max, unsigned int min);/*** printLedWord** @param wordLength* @param word*/
void printLedWord(int wordLength, u8 *word);/*** lightTube* @param word*/
void lightTube(u8 *word);/*** lightTubeByInt* @param word*/
void lightTubeByInt(u16 value);/*** lightTubeByIntNTimes* @param word*/
void lightTubeByIntSeconds(u16 value, u16 s);/*** keyboardMatrixFlipScan* @return*/
u8 keyboardMatrixFlipScan(void);#endif
code>

utils.c

<code>#include "utils.h"u8 gled_col[8] = {0x7f, 0xbf, 0xdf, 0xef, 0xf7, 0xfb, 0xfd, 0xfe};u8 gsmg_code[10]={0x3f,0x06,0x5b,0x4f,0x66,0x6d,0x7d,0x07,0x7f,0x6f};void hc595_write_data(u8 dat);void delay_10us(u16 ten_us) {while (ten_us--);
}void delay_ms(u16 ms) {u16 i, j;for (i = ms; i > 0; i--)for (j = 110; j > 0; j--);
}void ledCtl(u8 pos, u8 on) {if(on == 0) {P2 |= (1 << pos);return;}P2 &= (~(1 << pos));
}void ledToggle(u8 pos) {P2 ^= (1 << pos);
}unsigned int randomInt(unsigned int seed, unsigned int min, unsigned int max) {return rand() % (max + 1 - min) + min;
}void printLedWord(int wordLength, u8 *word) {u8 i;for (i = 0; i < wordLength; i++) {LEDDZ_COL_PORT = gled_col[i];hc595_write_data(word[i]);delay_10us(10);hc595_write_data(0x00);}
}void hc595_write_data(u8 dat) {u8 i = 0;for (i = 0; i < 8; i++) {SERIAL_PORT_INPUT = dat >> 7;dat <<= 1;SHIFT_REG_INPUT = 0;delay_10us(1);SHIFT_REG_INPUT = 1;delay_10us(1);}STORE_REG_INPUT = 1;delay_10us(1);STORE_REG_INPUT = 0;
}void lightTube(u8 *word) {u8 i=0;for(i=0;i<8;i++) {switch(i) {case 0: LSC=1;LSB=1;LSA=1;break;case 1: LSC=1;LSB=1;LSA=0;break;case 2: LSC=1;LSB=0;LSA=1;break;case 3: LSC=1;LSB=0;LSA=0;break;case 4: LSC=0;LSB=1;LSA=1;break;case 5: LSC=0;LSB=1;LSA=0;break;case 6: LSC=0;LSB=0;LSA=1;break;case 7: LSC=0;LSB=0;LSA=0;break;}SMG_A_DP_PORT = gsmg_code[word[i]];delay_10us(10);SMG_A_DP_PORT=0x00;}
}void lightTubeByInt(u16 value) {u16 i;u8 idx = 7;u8 word[8];for(i=0; i<8; i++) {word[i] = 0;}i = value;while(i > 0) {word[idx --] = i % 10;i = i / 10;}lightTube(word);
}void lightTubeByIntSeconds(u16 value, u16 s) {u16 i, j;for (i = s * 8; i > 0; i--)for (j = 110; j > 0; j--)lightTubeByInt(value);
}u8 keyboardMatrixFlipScan(void) {static u8 result = 0;KEY_MATRIX_PORT=0x0f;if(KEY_MATRIX_PORT!=0x0f) {delay_10us(1000);if(KEY_MATRIX_PORT!=0x0f) {KEY_MATRIX_PORT=0x0f;switch(KEY_MATRIX_PORT) {case 0x07: result=1;break;case 0x0b: result=2;break;case 0x0d: result=3;break;case 0x0e: result=4;break;}KEY_MATRIX_PORT=0xf0;switch(KEY_MATRIX_PORT) {case 0x70: result=result;break;case 0xb0: result=result+4;break;case 0xd0: result=result+8;break;case 0xe0: result=result+12;break;}while(KEY_MATRIX_PORT!=0xf0);}}elseresult=0;return result;
}
code>

贪吃蛇的实现

snake.h 

<code>#ifndef _snake_H
#define _snake_H#include "utils.h"typedef struct Node {int x;int y;
} Node;typedef struct Snake {struct Node *head;        struct Node *food;        int flag;        int grade;        int level;        int direction;void (*setMap)(struct Snake *snake);          int (*isOver)(struct Snake *snake);            void (*go)(struct Snake *snake);                void (*running)(struct Snake *snake, int counter);void (*isKeyPressed)(struct Snake *snake);void (*init)(struct Snake *snake);void (*addNode)(struct Snake *snake, int x, int y);            void (*moveTo)(struct Snake *snake, int direction);            void (*createFood)(struct Snake *snake);        int (*getFood)(struct Snake *snake);            int (*isFoodCover)(struct Snake *snake);        int (*isSuccess)(struct Snake *snake);        void (*print)(struct Snake *snake);            
} Snake;void snakeInit(struct Snake *snake);#endif
code>

snake.c 

如下 就是 贪吃蛇的初始化, 生成食物, 运行, 等等 相关 

<code>
#include "snake.h"void position(int, int);struct Node *nodeInit(int, int y);void snakeInit(Snake *snake);void setMap(struct Snake *snake);int isOver(struct Snake *snake);void go(struct Snake *snake);void running(struct Snake *snake, int counter);void isKeyPressed(struct Snake *snake);void init(struct Snake *snake);void addNode(struct Snake *snake, int x, int y);void moveTo(struct Snake *snake, int direction);void createFood(struct Snake *snake);int getFood(struct Snake *snake);int isFoodCover(struct Snake *snake);int isSuccess(struct Snake *snake);void print(struct Snake *snake);int snakeHeadInitX = 2;
int snakeHeadInitY = 2;
int gameRangeXMax = 8;
int gameRangeYMax = 8;
int snakeNodeXOffset = 1;
int snakeNodeYOffset = 1;Node nodeList[100];
Node foodNodeIns;
Node *foodNode = &foodNodeIns;void snakeInit(struct Snake *snake) {// struct Snake *result = malloc(sizeof(struct Snake));
//    snake->head = nodeInit(snakeHeadInitX, snakeHeadInitY);snake->head = &nodeList[0];snake->level = 0;addNode(snake, snakeHeadInitX, snakeHeadInitY);snake->flag = 0;snake->direction = 2;snake->grade = 0;snake->setMap = setMap;snake->isOver = isOver;snake->go = go;snake->running = running;snake->isKeyPressed = isKeyPressed;snake->init = init;snake->addNode = addNode;snake->moveTo = moveTo;snake->createFood = createFood;snake->getFood = getFood;snake->isFoodCover = isFoodCover;snake->isSuccess = isSuccess;snake->print = print;
}void setMap(struct Snake *snake) {}void init(struct Snake *snake) {int i;struct Node *p = snake->head;for (i = 1; i <= 2; i++) {addNode(snake, p->x - (i * snakeNodeXOffset), p->y);}
}void addNode(struct Snake *snake, int x, int y) {nodeList[snake->level].x = x;nodeList[snake->level].y = y;snake->level ++;snake->grade = snake->grade + 5 * (snake->level + 1);
}void moveTo(struct Snake *snake, int direction) {u8 i;for(i = snake->level - 1; i > 0; i--) {nodeList[i].x = nodeList[i-1].x;nodeList[i].y = nodeList[i-1].y;}snake->direction = direction;if ((snake->direction + 2) % 2 == 1) {snake->head->y -= snake->direction;} else {snake->head->x += (snake->direction / 2);}
}int isOver(struct Snake *snake) {struct Node *head = snake->head;struct Node *p;u8 i;if (head->x >= (gameRangeXMax * snakeNodeXOffset) || head->x < 0|| head->y >= (gameRangeYMax * snakeNodeYOffset) || head->y < 0)return 1;for(i=2; i<snake->level; i++) {p = &nodeList[i];if (head->x == p->x && head->y == p->y) return 1;}if (snake->level >= 10) return 1;return 0;
}void createFood(struct Snake *snake) {do {foodNode->x = randomInt(0, 0, (gameRangeXMax-1) * snakeNodeXOffset);foodNode->y = randomInt(0, 0, (gameRangeYMax-1) * snakeNodeYOffset);} while (snake->isFoodCover(snake));
}int getFood(struct Snake *snake) {struct Node *head = snake->head;struct Node *p;if (head->x == foodNode->x && head->y == foodNode->y) {p = &nodeList[snake->level-1];addNode(snake, p->x, p->y);return 1;}return 0;
}int isFoodCover(struct Snake *snake) {u8 i;struct Node *p = snake->head;struct Node *food = foodNode;for(i=0; i<snake->level; i++) {p = &nodeList[i];if (food->x == p->x && food->y == p->y) return 1;}return 0;
}void go(struct Snake *snake) {struct Node *head = snake->head;struct Node *p;snake->moveTo(snake, snake->direction);snake->print(snake);
}long snakeTurnNextThreshold = 1;
int snakeMaxRowCount = 50;
int snakeCurrentRowIdx = 1;void running(struct Snake *snake, int counter) {struct Node *p;if (counter % snakeTurnNextThreshold == 0) {snakeCurrentRowIdx = (snakeCurrentRowIdx + 1) % snakeMaxRowCount;}snake->isKeyPressed(snake);if(snakeCurrentRowIdx > 0) {snake->print(snake);return ;}snake->print(snake);snake->go(snake);if (snake->getFood(snake)) {snake->createFood(snake);}}void isKeyPressed(struct Snake *snake) {u8 keyPressed = 0;keyPressed = keyboardMatrixFlipScan();// UPif (keyPressed == 2 && snake->direction != 1) snake->direction = -1;// LEFTelse if (keyPressed == 5 && snake->direction != 2) snake->direction = -2;// DOWNelse if (keyPressed == 6 && snake->direction != -1) snake->direction = 1;// RIGHTelse if (keyPressed == 7 && snake->direction != -2) snake->direction = 2;if (keyPressed == 16) {while (1) {keyPressed = keyboardMatrixFlipScan();snake->print(snake);if (keyPressed == 16) break;}}
}int isSuccess(struct Snake *snake) {if (snake->level >= 10) return 1;return 0;
}void print(struct Snake *snake) {struct Node *p;u8 word[8];u8 i;for(i=0; i<8; i++) {word[i] = 0;}for(i=0; i<snake->level; i++) {p = &nodeList[i];word[p->x] |= (1 << p->y);}p = foodNode;word[p->x] |= (1 << p->y);printLedWord(8, word);
}code>

实际效果如下图 

c="https://img-blog.csdnimg.cn/f5e7d730e511430ca37f5b77e5224b76.png" width="903" />

游戏结束效果如下

c="https://img-blog.csdnimg.cn/c95cebe789174823a441d04beb5798c0.png" width="903" />


http://www.ppmy.cn/news/1437952.html

相关文章

1小时学会SpringBoot3+Vue3前后端分离开发

首发于Enaium的个人博客 引言 大家可能刚学会Java和Vue之后都会想下一步是什么&#xff1f;那么就先把SpringBoot和Vue结合起来&#xff0c;做一个前后端分离的项目吧。 准备工作 首先你需要懂得Java和Vue的基础知识&#xff0c;环境这里就不多说了&#xff0c;直接开始。 …

Kotlin作用域函数引发的遮蔽问题

前面讲了kotlin的it变量引起的遮蔽问题&#xff0c;见Kotlin it隐式变量的遮蔽问题&#xff0c;本篇聊聊作用域函数&#xff08;scoped function&#xff09;可能引起的遮蔽问题。 先来看一个简单的示例&#xff1a; fun test(): String {val s: String "asdf".al…

selenium显式等待

selenium显示等待 确保页面元素在特定条件下加载完毕后再执行后续操作。显示等待可以通过WebDriverWait类和ExpectedConditions类来实现。通过使用显示等待&#xff0c;可以避免在页面元素还未加载完毕时就进行操作&#xff0c;从而提高测试的稳定性和可靠性。 # 导包 from s…

leetcode543--二叉树的直径

1. 题意 求二叉树上最远两个节点之间的距离。 2. 题解 2.1 暴力 最长路径的三种情况 通过根节点在左子树在右子树 12 4 5 6 7 8 9 diameter 5通过根节点的最长路径长度一定是左右子树深度之和。 但是这样求左右子树的深度会不断重复&#xff0c;所以复杂度…

从虚拟化走向云原生,红帽OpenShift“一手托两家”

汽车行业已经迈入“软件定义汽车”的新时代。吉利汽车很清醒地意识到&#xff0c;只有通过云原生技术和数字化转型&#xff0c;才能巩固其作为中国领先汽车制造商的地位。 和很多传统企业一样&#xff0c;吉利汽车在走向云原生的过程中也经历了稳态业务与敏态业务并存带来的前所…

【docker】安装openjdk

查看可用的 openjdk版本 docker hub 查看地址&#xff1a;https://hub.docker.com/_/openjdk 此图片已被正式弃用&#xff0c;建议所有用户尽快找到并使用合适的替代品。其他官方形象替代品的一些例子&#xff08;按字母顺序列出&#xff0c;没有有意或暗示的偏好&#xff09;…

Git 远程管理

Git 远程管理 | CoderMast编程桅杆Git 远程管理 远程仓库操作 对于远程仓库的操作&#xff0c;Git 提供了 git remote 命令&#xff0c;用于用于管理 Git 仓库中的远程仓库。 以下是 git remote 命令的常见用法&#xff1a; 列出当前仓库中已配置的远程仓库 列出当前仓库中已配…

C语言中整型与浮点型在内存中的存储

今天让我们来看看整型的数据和浮点型的数据在内存中是怎么存储的呢 整型数据在内存中的存储 整型数据在内存中存储的是二进制的补码 正数的话也没什么可说的&#xff0c;原码反码补码都相同 我们来看看负数&#xff1a; 以-5为例 原码&#xff1a;10000000 00000000 00000000 0…