Let's make 16 games in C++(十):Xonix

2024-01-03 10:50
文章标签 c++ 16 make games let xonix

本文主要是介绍Let's make 16 games in C++(十):Xonix,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!

1、准备游戏需要的背景

2、先渲染一个25x40乘比例(18)的屏幕

#include<SFML/Graphics.hpp>
#include<time.h>using namespace sf;const int M = 25;
const int N = 40;int grid[M][N] = { 0 };
int ts = 18;int main()
{srand(time(0));RenderWindow window(VideoMode(N*ts, M*ts), "Xonix!");window.setFramerateLimit(60);Texture t1;t1.loadFromFile("./Resources/images/tiles.png");Sprite sTile(t1);int x = 0;int y = 0;int dx = 0;int dy = 0;float timer = 0;float delay = 0.07;Clock clock;while (window.isOpen()){float time = clock.getElapsedTime().asSeconds();clock.restart();timer += time;Event e;while (window.pollEvent(e)){if (e.type == Event::Closed){window.close();}}if (Keyboard::isKeyPressed(Keyboard::Left)){dx = -1;dy = 0;}if (Keyboard::isKeyPressed(Keyboard::Right)){dx = 1;dy = 0;}if (Keyboard::isKeyPressed(Keyboard::Up)){dx = 0;dy = -1;}if (Keyboard::isKeyPressed(Keyboard::Down)){dx = 0;dy = 1;}if (timer > delay){x += dx;y += dy;timer = 0;}window.clear();sTile.setTextureRect(IntRect(36, 0, ts, ts));sTile.setPosition(x*ts, y*ts);window.draw(sTile);window.display();}return 0;
}

3、实现游戏基本逻辑

#include<SFML/Graphics.hpp>
#include<time.h>using namespace sf;const int M = 25;
const int N = 40;int grid[M][N] = { 0 };
int ts = 18;int main()
{srand(time(0));RenderWindow window(VideoMode(N*ts, M*ts), "Xonix!");window.setFramerateLimit(60);Texture t1;Texture t2;t1.loadFromFile("./Resources/images/tiles.png");t2.loadFromFile("./Resources/images/gameover.png");Sprite sTile(t1);Sprite sGameover(t2);sGameover.setPosition(100, 100);bool Game = true;int x = 0;int y = 0;int dx = 0;int dy = 0;float timer = 0;float delay = 0.07;Clock clock;for (int i = 0; i < M; i++){for (int j = 0; j < N; j++){if (i == 0 || j == 0 || i == M-1 || j == N-1){grid[i][j] = 1;}}}while (window.isOpen()){float time = clock.getElapsedTime().asSeconds();clock.restart();timer += time;Event e;while (window.pollEvent(e)){if (e.type == Event::Closed){window.close();}}if (Keyboard::isKeyPressed(Keyboard::Left)){dx = -1;dy = 0;}if (Keyboard::isKeyPressed(Keyboard::Right)){dx = 1;dy = 0;}if (Keyboard::isKeyPressed(Keyboard::Up)){dx = 0;dy = -1;}if (Keyboard::isKeyPressed(Keyboard::Down)){dx = 0;dy = 1;}if (!Game){continue;}if (timer > delay){x += dx;y += dy;if (x<0){x = 0;}if (x>N-1){x = N - 1;}if (y<0){y = 0;}if (y>M-1){y = M - 1;}if (grid[y][x] == 2){Game = false;}if (grid[y][x] == 0){grid[y][x] = 2;}timer = 0;}window.clear();for (int i = 0; i < M; i++){for (int j = 0; j < N; j++){if (grid[i][j] == 0){continue;}if (grid[i][j] ==	 1){sTile.setTextureRect(IntRect(0, 0, ts, ts));}if (grid[i][j] == 2){sTile.setTextureRect(IntRect(54, 0, ts, ts));}sTile.setPosition(j*ts,i*ts);window.draw(sTile);}}sTile.setTextureRect(IntRect(36, 0, ts, ts));sTile.setPosition(x*ts, y*ts);window.draw(sTile);if (!Game){window.draw(sGameover);}window.display();}return 0;
}

效果图:

4、添加敌人缩小游戏区域完善游戏逻辑(在敌人撞击之前变成蓝色)

 

#include<SFML/Graphics.hpp>
#include<time.h>using namespace sf;const int M = 25;
const int N = 40;int grid[M][N] = { 0 };
int ts = 18;struct Enemy
{int x;int y;int dx;int dy;Enemy(){x = y = 300;dx = 4 - rand() % 8;dy = 4 - rand() % 8;}void move(){x += dx;if (grid[y/ts][x/ts] == 1){dx = -dx;x += dx;}y += dy;if (grid[y/ts][x/ts] == 1){dy = -dy;y += dy;}}};void drop(int y, int x)
{if (grid[y][x] == 0){grid[y][x] = -1;}if (grid[y-1][x] == 0){drop(y - 1, x);}if (grid[y+1][x] == 0){drop(y + 1, x);}if (grid[y][x-1] == 0){drop(y, x - 1);}if (grid[y][x+1] == 0){drop(y, x + 1);}
}int main()
{srand(time(0));RenderWindow window(VideoMode(N*ts, M*ts), "Xonix!");window.setFramerateLimit(60);Texture t1;Texture t2;Texture t3;t1.loadFromFile("./Resources/images/tiles.png");t2.loadFromFile("./Resources/images/gameover.png");t3.loadFromFile("./Resources/images/enemy.png");Sprite sTile(t1);Sprite sGameover(t2);Sprite sEnemy(t3);sGameover.setPosition(100, 100);sEnemy.setOrigin(20, 20);int enemyCount = 4;Enemy a[10];bool Game = true;int x = 0;int y = 0;int dx = 0;int dy = 0;float timer = 0;float delay = 0.07;Clock clock;for (int i = 0; i < M; i++){for (int j = 0; j < N; j++){if (i == 0 || j == 0 || i == M-1 || j == N-1){grid[i][j] = 1;}}}while (window.isOpen()){float time = clock.getElapsedTime().asSeconds();clock.restart();timer += time;Event e;while (window.pollEvent(e)){if (e.type == Event::Closed){window.close();}if (e.key.code == Keyboard::Escape){for (int i = 0; i < M-1; i++){for (int j = 0; j < N-1; j++){grid[i][j] = 0;}}x = 10;y = 0;Game = true;}}if (Keyboard::isKeyPressed(Keyboard::Left)){dx = -1;dy = 0;}if (Keyboard::isKeyPressed(Keyboard::Right)){dx = 1;dy = 0;}if (Keyboard::isKeyPressed(Keyboard::Up)){dx = 0;dy = -1;}if (Keyboard::isKeyPressed(Keyboard::Down)){dx = 0;dy = 1;}if (!Game){continue;}if (timer > delay){x += dx;y += dy;if (x<0){x = 0;}if (x>N-1){x = N - 1;}if (y<0){y = 0;}if (y>M-1){y = M - 1;}if (grid[y][x] == 2){Game = false;}if (grid[y][x] == 0){grid[y][x] = 2;}timer = 0;}for (int i = 0; i < enemyCount; i++){a[i].move();}if (grid[y][x] == 1){dx = dy = 0;for (int i = 0; i < enemyCount; i++){drop(a[i].y / ts, a[i].x / ts);}for (int i = 0; i < M; i++){for (int j = 0; j < N; j++){if (grid[i][j] == -1){grid[i][j] = 0;}else{grid[i][j] = 1;}}}}for (int i = 0; i < enemyCount; i++){if (grid[a[i].y/ts][a[i].x/ts] == 2){Game = false;}}window.clear();for (int i = 0; i < M; i++){for (int j = 0; j < N; j++){if (grid[i][j] == 0){continue;}if (grid[i][j] ==	 1){sTile.setTextureRect(IntRect(0, 0, ts, ts));}if (grid[i][j] == 2){sTile.setTextureRect(IntRect(54, 0, ts, ts));}sTile.setPosition(j*ts,i*ts);window.draw(sTile);}}sTile.setTextureRect(IntRect(36, 0, ts, ts));sTile.setPosition(x*ts, y*ts);window.draw(sTile);sEnemy.rotate(10);for (int i = 0; i < enemyCount; i++){sEnemy.setPosition(a[i].x, a[i].y);window.draw(sEnemy);}if (!Game){window.draw(sGameover);}window.display();}return 0;
}

结果图:

 

这篇关于Let's make 16 games in C++(十):Xonix的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!



http://www.chinasem.cn/article/565453

相关文章

C++使用栈实现括号匹配的代码详解

《C++使用栈实现括号匹配的代码详解》在编程中,括号匹配是一个常见问题,尤其是在处理数学表达式、编译器解析等任务时,栈是一种非常适合处理此类问题的数据结构,能够精确地管理括号的匹配问题,本文将通过C+... 目录引言问题描述代码讲解代码解析栈的状态表示测试总结引言在编程中,括号匹配是一个常见问题,尤其是在

使用C++实现链表元素的反转

《使用C++实现链表元素的反转》反转链表是链表操作中一个经典的问题,也是面试中常见的考题,本文将从思路到实现一步步地讲解如何实现链表的反转,帮助初学者理解这一操作,我们将使用C++代码演示具体实现,同... 目录问题定义思路分析代码实现带头节点的链表代码讲解其他实现方式时间和空间复杂度分析总结问题定义给定

C++初始化数组的几种常见方法(简单易懂)

《C++初始化数组的几种常见方法(简单易懂)》本文介绍了C++中数组的初始化方法,包括一维数组和二维数组的初始化,以及用new动态初始化数组,在C++11及以上版本中,还提供了使用std::array... 目录1、初始化一维数组1.1、使用列表初始化(推荐方式)1.2、初始化部分列表1.3、使用std::

C++ Primer 多维数组的使用

《C++Primer多维数组的使用》本文主要介绍了多维数组在C++语言中的定义、初始化、下标引用以及使用范围for语句处理多维数组的方法,具有一定的参考价值,感兴趣的可以了解一下... 目录多维数组多维数组的初始化多维数组的下标引用使用范围for语句处理多维数组指针和多维数组多维数组严格来说,C++语言没

c++中std::placeholders的使用方法

《c++中std::placeholders的使用方法》std::placeholders是C++标准库中的一个工具,用于在函数对象绑定时创建占位符,本文就来详细的介绍一下,具有一定的参考价值,感兴... 目录1. 基本概念2. 使用场景3. 示例示例 1:部分参数绑定示例 2:参数重排序4. 注意事项5.

使用C++将处理后的信号保存为PNG和TIFF格式

《使用C++将处理后的信号保存为PNG和TIFF格式》在信号处理领域,我们常常需要将处理结果以图像的形式保存下来,方便后续分析和展示,C++提供了多种库来处理图像数据,本文将介绍如何使用stb_ima... 目录1. PNG格式保存使用stb_imagephp_write库1.1 安装和包含库1.2 代码解

C++实现封装的顺序表的操作与实践

《C++实现封装的顺序表的操作与实践》在程序设计中,顺序表是一种常见的线性数据结构,通常用于存储具有固定顺序的元素,与链表不同,顺序表中的元素是连续存储的,因此访问速度较快,但插入和删除操作的效率可能... 目录一、顺序表的基本概念二、顺序表类的设计1. 顺序表类的成员变量2. 构造函数和析构函数三、顺序表

使用C++实现单链表的操作与实践

《使用C++实现单链表的操作与实践》在程序设计中,链表是一种常见的数据结构,特别是在动态数据管理、频繁插入和删除元素的场景中,链表相比于数组,具有更高的灵活性和高效性,尤其是在需要频繁修改数据结构的应... 目录一、单链表的基本概念二、单链表类的设计1. 节点的定义2. 链表的类定义三、单链表的操作实现四、

使用C/C++调用libcurl调试消息的方式

《使用C/C++调用libcurl调试消息的方式》在使用C/C++调用libcurl进行HTTP请求时,有时我们需要查看请求的/应答消息的内容(包括请求头和请求体)以方便调试,libcurl提供了多种... 目录1. libcurl 调试工具简介2. 输出请求消息使用 CURLOPT_VERBOSE使用 C

C++实现获取本机MAC地址与IP地址

《C++实现获取本机MAC地址与IP地址》这篇文章主要为大家详细介绍了C++实现获取本机MAC地址与IP地址的两种方式,文中的示例代码讲解详细,感兴趣的小伙伴可以跟随小编一起学习一下... 实际工作中,项目上常常需要获取本机的IP地址和MAC地址,在此使用两种方案获取1.MFC中获取IP和MAC地址获取