目的: 通过递归,使其能够展开周围没有雷的格子。
遇到问题:在展开后,如何判断是否赢得游戏。
解决方法:如代码所示。
game.h
#include#include #include #define ROW 9 #define COL 9 #define ROWS ROW+2 #define COLS COL+2 #define Easy_Count 10 void InitBoard(char board[ROWS][COLS], int rows, int cols, char set); void DisplayBoard(char board[ROWS][COLS], int row, int col); void SetMine(char board[ROWS][COLS], int row, int col); void FindMine(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col);
game.c
#define _CRT_SECURE_NO_WARNINGS #include"game.h" int success(char show[ROWS][COLS]) { int i = 1; int j = 1; int win = 0; for (i = 1; i <10; i++) { for (j = 1; j <10; j++) { if (show[i][j] =='*') { win++; } } } return win; } int get_mine_count(char mine[ROWS][COLS], int x, int y) { return mine[x - 1][y] + mine[x - 1][y - 1] + mine[x - 1][y + 1] + mine[x][y - 1] + mine[x][y + 1] + mine[x + 1][y] + mine[x + 1][y - 1] + mine[x + 1][y + 1] - 8 * '0'; } void Open(char mine[ROWS][COLS], char show[ROWS][COLS], int x, int y) { int count = get_mine_count(mine, x, y); if (count==0) { show[x][y] = ' '; int i = 0; int j = 0; for (i = x - 1; i <= x + 1; i++) { for (j = y - 1; j <= y + 1; j++) { if (show[i][j] == '*' && i > 0 && i < 10 && j > 0 && j < 10) Open(mine, show, i, j); } } } else { show[x][y] = count + '0'; } } void InitBoard(char board[ROWS][COLS], int rows, int cols, char set) { int i = 0; int j = 0; for (i = 0; i < rows; i++) { for (j = 0; j < cols; j++) { board[i][j] = set; } } } void DisplayBoard(char board[ROWS][COLS], int row, int col) { int i = 0; int j = 0; for (i = 0; i <= row; i++) { printf("%d ", i); } printf("n"); for (i = 1; i <= row; i++) { printf("%d ", i); for (j = 1; j <= col; j++) { printf("%c ", board[i][j]); } printf("n"); } } void SetMine(char board[ROWS][COLS], int row, int col) { int count = Easy_Count; while (count) { int x = rand() % row + 1; int y = rand() % col + 1; if (board[x][y] == '0') { board[x][y] = '1'; count--; } } } void FindMine(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col) { int x = 0; int y = 0; int win = 0; while (win < Easy_Count+1) { printf("请输入要排查的坐标:>"); scanf("%d%d", &x, &y); if (x >= 1 && x <= row && y >= 1 && y <= col) { if (mine[x][y] == '1') { printf("你被炸死了n"); DisplayBoard(mine, ROW, COL); break; } else if (show[x][y] != '*') { printf("选择重复,请重选n"); } else { Open(mine, show, x, y); DisplayBoard(show, ROW, COL); } } else { printf("输入非法坐标,请重新输入n"); } if (success(show) == Easy_Count) { printf("你赢了n"); break; } } }
test.c
#define _CRT_SECURE_NO_WARNINGS #include"game.h" void menu() { printf("**********************n"); printf("****** 1.play *****n"); printf("****** 0.exit *****n"); printf("**********************n"); } void game() { char mine[ROWS][COLS] = { 0 }; char show[ROWS][COLS] = { 0 }; InitBoard(mine, ROWS, COLS, '0'); InitBoard(show, ROWS, COLS, '*'); //DisplayBoard(mine, ROW, COL); DisplayBoard(show, ROW, COL); SetMine(mine, ROW, COL); DisplayBoard(mine, ROW, COL); FindMine(mine, show, ROW, COL); } void test() { int input = 0; do { menu(); printf("请选择:>"); scanf("%d", &input); switch (input) { case 1: game(); break; case 0: printf("退出游戏n"); break; default: printf("选择错误,请重新输入n"); break; } } while (input); } int main() { srand((unsigned int)time(NULL)); test(); return 0; }
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)