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
|
*********************************************************************
** REMINDER: your programs MUST valgrind cleanly for full credit! **
*********************************************************************
For this problem, you will be completing a partially written
minesweeper game. This game will be played on a text interface
(not a GUI---we haven't learned anything about those).
If you are not familiar with the game of minesweeper, you might
take a minute to read up about it on the internet, but you don't
need much game expertise to do this assignment.
I have provided code for an almost working minesweeper, except
that I have deleted the code for 4 functions:
board_t * makeBoard(int w, int h, int numMines)
int countMines(board_t * b, int x, int y)
int checkWin(board_t * b)
void freeBoard(board_t * b)
Your job is to implement each of these functions (which all have a
//WRITE ME comment to make them easy to find). A brief description
of each follows:
- makeBoard: this function should malloc and initialize a board_t
representing the board. The parameters specify the width
and height of the board, as well as the number of mines.
You will also need to call malloc (multiple times)
to allocate space for the 2D array "board".
This function should fill in all squares on the board with
UNKNOWN, then call addRandomMine an appropriate number of times
(i.e., numMines) to "randomly" place mines on the board.
Note that the fields of your board_t must be initailzed before
you call addRandomMine.
Also note that the mine generation is pseudo random and will not
change if you re-run the program multiple times with the same
parameters.
Note that the layout of b->board should be such that it is indexed
b->board[y][x]
where y is between 0 and the height and x is between 0 and the width.
- countMines: this funciton takes a board_t, and an (x,y) coordinate.
It should count the mines in the 8 squares around that (x,y)
coordinate, and return that count. Note that a mine may be
indicated by a square on the board either being HAS_MINE or
KNOWN_MINE. You can use the IS_MINE macro to test both cases:
IS_MINE(b->board[ny][nx])
(where b is the board_t, and (nx,ny) are the coordinates you
want to check). Be careful not to go out of bounds of the array.
- checkWin: this funciton takes a board_t and see if the game has
been won. The game is won when no squares are UNKNOWN. Return 0
if the game has not been won, 1 if it has.
- freeBoard: This function takes a board_t and frees all memory
associated with it (including the array inside of it). That is,
freeBoard should undo all the allocations made by a call to makeBoard.
Note: You should NOT change any of the other provided functions!
Once you have these all working, you should have a playable game of
minesweeper. Note that there are a few differences in game play
from the "standard" game:
- You select a square by entering its x (column) and y (row) coordinate.
The x coordinates are listed across the top and the y are listed
down the left side to reduce counting.
- The game will automatically figure out the "obvious" squares:
both mines and non-mined spaces. It will reveal these too you
as soon as it considers them trivial to figure out.
- You cannot manually mark a square that you suspect has a mine
Once your code is complete, submit minesweeper.c
|
