Minesweeper/update.c at master · plming/Minesweeper · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
#include "update.h"
#include "minesweeper.h"

state_t update(char key_input)
{
	switch (key_input)
	{
	case CONTROL_LEFT:
		g_player.col += SIZE_COL - 1;
		g_player.col %= SIZE_COL;
		break;

	case CONTROL_RIGHT:
		g_player.col = (g_player.col + 1) % SIZE_COL;
		break;

	case CONTROL_UP:
		g_player.row += SIZE_ROW - 1;
		g_player.row %= SIZE_ROW;
		break;

	case CONTROL_DOWN:
		g_player.row = (g_player.row + 1) % SIZE_ROW;
		break;

	case CONTROL_FLAG:
		set_flag(g_player.row, g_player.col);
		break;

	case CONTROL_SPACE:
		if (g_cell[g_player.row][g_player.col].has_flag)
		{
			break;
		}

		if (g_cell[g_player.row][g_player.col].has_mine)
		{
			return STATE_GAME_OVER;
		}

		uncover_recursive(g_player.row, g_player.col);

		if (is_all_uncovered())
		{
			return STATE_VICTORY;
		}
		break;

	default:
		break;
	}
	return STATE_IDLE;
}

void set_flag(int row, int col)
{
	if (g_cell[row][col].is_uncovered)
	{
		return;
	}

	g_cell[row][col].has_flag = !g_cell[row][col].has_flag;
	return;
}

void uncover_recursive(int row, int col)
{
	if (row < 0 || row >= SIZE_ROW)
	{
		return;
	}

	if (col < 0 || col >= SIZE_COL)
	{
		return;
	}

	if (g_cell[row][col].is_uncovered)
	{
		return;
	}

	g_cell[row][col].is_uncovered = true;
	if (g_cell[row][col].num_around_mine != 0)
	{
		return;
	}

	uncover_recursive(row - 1, col);
	uncover_recursive(row + 1, col);
	uncover_recursive(row, col - 1);
	uncover_recursive(row, col + 1);
	uncover_recursive(row - 1, col - 1);
	uncover_recursive(row - 1, col + 1);
	uncover_recursive(row + 1, col - 1);
	uncover_recursive(row + 1, col + 1);
	return;
}

bool is_all_uncovered(void)
{
	for (int row = 0; row < SIZE_ROW; row++)
	{
		for (int col = 0; col < SIZE_COL; col++)
		{
			if (g_cell[row][col].has_mine == false)
			{
				if (g_cell[row][col].is_uncovered == false)
				{
					return false;
				}
			}
		}
	}
	return true;
}