游戲設(shè)計(jì)

• 首先我們需要使用第三方框架,這里我使用的是sfml,不會使用sfml在我的上幾篇文章當(dāng)中-掃雷(上)有詳細(xì)的開發(fā)環(huán)境搭建介紹

• 首先準(zhǔn)備圖片資源

• 一張背景圖片,一張寶石圖片

• 窗口初始化加載圖片

• Texture t1;
  t1.loadFromFile(“images/bg2.png”);
  

• 當(dāng)鼠標(biāo)第一次單擊時,記錄下位置,第二次單擊又記錄一下位置,如果兩個小方塊相鄰就交換位置,如果不相鄰如圖c的位置則,不發(fā)生變化
  

• 判斷行或列如果三張一樣的圖片相鄰,清除一下圖片,進(jìn)行刷新

實(shí)列

#include <SFML/Graphics.hpp> #include <SFML/Audio.hpp> #include <time.h>using namespace sf;#define GAME_ROWS_COUNT 8 #define GAME_COLS_COUNT 8int ts = 57; // 每一個游戲小方塊區(qū)域的大小bool isMoving = false; bool isSwap = false;// 相鄰位置的第幾次單擊，第2次單擊才交換方塊 int click = 0;Vector2i pos; //鼠標(biāo)單擊時的位置 Vector2i offset(15, 273);int posX1, posY1; //第一次單擊的位置(記錄行和列的序號） int posX2, posY2; //第二次單擊的位置(記錄行和列的序號）struct Block {int x, y; //坐標(biāo)值 x == col * ts y == row * ts;int row, col; //第幾行，第幾列int kind; //表示第幾種小方塊bool match; //表示是否成三int alpha; //透明度Block() {match = false;alpha = 255;kind = -1;} } grid[GAME_ROWS_COUNT + 2][GAME_ROWS_COUNT + 2];void swap(Block p1, Block p2) {std::swap(p1.col, p2.col);std::swap(p1.row, p2.row);grid[p1.row][p1.col] = p1;grid[p2.row][p2.col] = p2; }void doEvent(RenderWindow* window) {Event e;while (window->pollEvent(e)) {if (e.type == Event::Closed) {window->close();}if (e.type == Event::MouseButtonPressed) {if (e.key.code == Mouse::Left) {if (!isSwap && !isMoving) click++;pos = Mouse::getPosition(*window) - offset;}}}if (click == 1) {posX1 = pos.x / ts + 1;posY1 = pos.y / ts + 1;}else if (click == 2) {posX2 = pos.x / ts + 1;posY2 = pos.y / ts + 1;// 是相鄰方塊就交換位置if (abs(posX2 - posX1) + abs(posY2 - posY1) == 1) {// 交換相鄰的兩個小方塊// 消消樂的方塊，怎么表示？swap(grid[posY1][posX1], grid[posY2][posX2]);isSwap = 1;click = 0;}else {click = 1;}} }void check() {for (int i = 1; i <= GAME_ROWS_COUNT; i++) {for (int j = 1; j <= GAME_COLS_COUNT; j++) {if (grid[i][j].kind == grid[i + 1][j].kind &&grid[i][j].kind == grid[i - 1][j].kind) {//grid[i - 1][j].match++;//grid[i][j].match++;//grid[i + 1][j].match++;for (int k = -1; k <= 1; k++) grid[i + k][j].match++;}if (grid[i][j].kind == grid[i][j - 1].kind &&grid[i][j].kind == grid[i][j + 1].kind) {//grid[i][j - 1].match++;//grid[i][j + 1].match++;//grid[i][j].match++;for (int k = -1; k <= 1; k++) grid[i][j + k].match++;}}} }void doMoving() {isMoving = false;for (int i = 1; i <= GAME_ROWS_COUNT; i++) {for (int j = 1; j <= GAME_COLS_COUNT; j++) {Block& p = grid[i][j]; // 引用p, 就是grid[i][j]的別名int dx, dy;for (int k = 0; k < 4; k++) {dx = p.x - p.col * ts;dy = p.y - p.row * ts;if (dx) p.x -= dx / abs(dx);if (dy) p.y -= dy / abs(dy);}if (dx || dy) isMoving = true;}} }void xiaochu() {for (int i = 1; i <= GAME_ROWS_COUNT; i++) {for (int j = 1; j <= GAME_COLS_COUNT; j++) {if (grid[i][j].match && grid[i][j].alpha > 10) {grid[i][j].alpha -= 10;isMoving = true;}}} }void huanYuan() {if (isSwap && !isMoving) {// 如果此時沒有產(chǎn)生匹配效果，就要還原int score = 0;for (int i = 1; i <= GAME_ROWS_COUNT; i++) {for (int j = 1; j <= GAME_COLS_COUNT; j++) {score += grid[i][j].match;}}if (score == 0) {swap(grid[posY1][posX1], grid[posY2][posX2]);}isSwap = false;} }void updateGrid() {for (int i = GAME_ROWS_COUNT; i > 0; i--) {for (int j = 1; j <= GAME_COLS_COUNT; j++) {if (grid[i][j].match) {for (int k = i - 1; k > 0; k--) {if (grid[k][j].match == 0) {swap(grid[k][j], grid[i][j]);break;}}}}}for (int j = 1; j <= GAME_COLS_COUNT; j++) {int n = 0;for (int i = GAME_ROWS_COUNT; i > 0; i--) {if (grid[i][j].match) {grid[i][j].kind = rand() % 7;grid[i][j].y = -ts * n;n++;grid[i][j].match = false;grid[i][j].alpha = 255;}}} }void drawBlocks(Sprite* sprite, RenderWindow* window) {for (int i = 1; i <= GAME_ROWS_COUNT; i++) {for (int j = 1; j <= GAME_COLS_COUNT; j++) {Block p = grid[i][j];sprite->setTextureRect(IntRect(p.kind * 52, 0, 52, 52));// 設(shè)置透明度sprite->setColor(Color(255, 255, 255, p.alpha));sprite->setPosition(p.x, p.y);// 因?yàn)閿?shù)組gird中的Block, 每個Block的行標(biāo)，列標(biāo)是從1計(jì)算的，// 并根據(jù)行標(biāo)和列表來計(jì)算的x,y坐標(biāo)// 所以坐標(biāo)的偏移，需要少便宜一些，也就是相當(dāng)于在正方形區(qū)域的左上角的左上角方向偏移一個單位// 在這個位置開發(fā)存放第0行第0列（實(shí)際不繪制第0行第0列）sprite->move(offset.x - ts, offset.y - ts); // to dowindow->draw(*sprite);}} }void initGrid() {for (int i = 1; i <= GAME_ROWS_COUNT; i++) {for (int j = 1; j <= GAME_COLS_COUNT; j++) {grid[i][j].kind = rand() % 3;grid[i][j].col = j;grid[i][j].row = i;grid[i][j].x = j * ts;grid[i][j].y = i * ts;}} }int main(void) {srand(time(0));RenderWindow window(VideoMode(485, 917), "canxin-xiaoxiaole");// 設(shè)置刷新的最大幀率window.setFramerateLimit(60);Texture t1, t2;t1.loadFromFile("images/bg2.png");if (!t2.loadFromFile("images/1.png")) {return -1;}Sprite spriteBg(t1);Sprite spriteBlock(t2);initGrid();while (window.isOpen()) {// 處理用戶的點(diǎn)擊事件doEvent(&window);// 檢查匹配情況check();// 移動處理doMoving();// 消除if (!isMoving) {xiaochu();}// 還原處理huanYuan();if (!isMoving) {updateGrid();}// 渲染游戲畫面window.draw(spriteBg);// 渲染所有的小方塊 drawBlocks(&spriteBlock, &window);// 顯示window.display();}return 0; }

• 由于上一篇掃雷和消消樂中有過多的相似之處所以這里就詳細(xì)一 一介紹了,具體詳細(xì)過程在我的主頁參考掃雷(下)
  --------來自奇牛學(xué)院–#殘芯

歡迎大家來我們學(xué)院交流

總結(jié)

以上是生活随笔為你收集整理的C/C++百行代码实现热门游戏-消消乐的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。