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 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442
|
/*
* Copyright 1993-1999 Marc Baudoin <babafou@babafou.eu.org>
*
* Permission to use, copy, modify, and distribute this software and
* its documentation for any purpose and without fee is hereby
* granted, provided that the above copyright notice appear in all
* copies and that both that copyright notice and this permission
* notice appear in supporting documentation. The author makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied
* warranty.
*
*/
static char *const cvsid = "$Id: demineur.c,v 1.2.2.1 1999/07/29 21:25:30 babafou Exp $" ;
#include <sys/types.h>
#include <stdio.h>
#include <stdlib.h>
#include <sysexits.h>
#include <sys/time.h>
#include "demineur.h"
#include "util.h"
#include "xdemineur.h"
/* ------------------------------------------------------------------------- */
typedef struct row_column
{
int row ;
int column ;
struct row_column *next ;
}
row_column_t ;
/* ------------------------------------------------------------------------- */
int demineur_flag_count ( int row , int column ) ;
void demineur_won ( ) ;
/* ------------------------------------------------------------------------- */
board_t board ;
int mines ;
volatile time_t elapsed ;
state_t state ;
/* ------------------------------------------------------------------------- */
void demineur_initialize ( int option_mines )
{
int row , column , m , openings ;
row_column_t *rc = NULL , *ptr = NULL ;
/* There are two extra rows and two extra columns so that
* there's no need to handle side effects when counting the
* number of surrounding mines.
*/
board.board = ( square_t ** ) xmalloc ( ( board.rows + 2 )
* sizeof ( square_t * ) ) ;
for ( row = 0 ; row < board.rows + 2 ; row ++ )
{
board.board[row] = ( square_t * ) xmalloc ( ( board.columns + 2 )
* sizeof ( square_t ) ) ;
}
if ( option_mines != 0 )
{
if ( option_mines >= board.rows * board.columns )
{
printf ( "Too many mines, using default number.\n" ) ;
mines = board.mines = board.rows * board.columns / 4.8 ;
}
else
{
mines = board.mines = option_mines ;
}
}
else
{
mines = board.mines = board.rows * board.columns / 4.8 ;
}
elapsed = 0 ;
state = PLAYING ;
/* initialize board */
for ( row = 0 ; row < board.rows + 2 ; row ++ )
{
for ( column = 0 ; column < board.columns + 2 ; column ++ )
{
board.board[row][column].mine = 0 ;
board.board[row][column].around = 0 ;
board.board[row][column].state = HIDDEN ;
}
}
/* special treatment for extra squares */
for ( row = 0 ; row < board.rows + 2 ; row ++ )
{
board.board[row][0].state = UNCOVERED ;
board.board[row][board.columns + 1].state = UNCOVERED ;
}
for ( column = 0 ; column < board.columns + 2 ; column ++ )
{
board.board[0][column].state = UNCOVERED ;
board.board[board.rows + 1][column].state = UNCOVERED ;
}
/* mines deposit */
for ( row = 1 ; row <= board.rows ; row ++ )
{
for ( column = 1 ; column <= board.columns ; column ++ )
{
if ( rc == NULL ) /* first square */
{
rc = ( row_column_t * ) xmalloc ( sizeof ( row_column_t ) ) ;
ptr = rc ;
}
else
{
ptr->next = ( row_column_t * )
xmalloc ( sizeof ( row_column_t ) ) ;
ptr = ptr->next ;
}
ptr->row = row ;
ptr->column = column ;
ptr->next = NULL ;
}
}
for ( m = 0 ; m < board.mines ; m ++ )
{
int alea = rand ( ) % ( board.rows * board.columns - m ) ;
if ( alea == 0 )
{
ptr = rc ;
rc = rc->next ;
}
else
{
row_column_t *tmp ;
for ( ptr = rc ; alea > 1 ; alea -- , ptr = ptr->next )
{
continue ;
}
tmp = ptr->next ;
ptr->next = ptr->next->next ;
ptr = tmp ;
}
board.board[ptr->row][ptr->column].mine = 1 ;
free ( ptr ) ;
}
/* free memory used by squares without mine */
for ( ptr = rc ; ptr != NULL ; )
{
row_column_t *tmp = ptr->next ;
free ( ptr ) ;
ptr = tmp ;
}
rc = NULL ;
/* mines counting */
for ( row = 1 ; row <= board.rows ; row ++ )
{
for ( column = 1 ; column <= board.columns ; column ++ )
{
board.board[row][column].around =
board.board[row - 1][column - 1].mine +
board.board[row - 1][column ].mine +
board.board[row - 1][column + 1].mine +
board.board[row ][column - 1].mine +
board.board[row ][column + 1].mine +
board.board[row + 1][column - 1].mine +
board.board[row + 1][column ].mine +
board.board[row + 1][column + 1].mine ;
}
}
/* automatic opening */
openings = 0 ;
for ( row = 1 ; row <= board.rows ; row ++ )
{
for ( column = 1 ; column <= board.columns ; column ++ )
{
if ( board.board[row][column].around == 0
&& ! board.board[row][column].mine )
{
openings ++ ;
if ( rc == NULL ) /* first square */
{
rc = ( row_column_t * ) xmalloc ( sizeof ( row_column_t ) ) ;
ptr = rc ;
}
else
{
ptr->next = ( row_column_t * )
xmalloc ( sizeof ( row_column_t ) ) ;
ptr = ptr->next ;
}
ptr->row = row ;
ptr->column = column ;
ptr->next = NULL ;
}
}
}
if ( openings != 0 )
{
int alea = rand ( ) % openings , i ;
for ( i = 0 , ptr = rc ; i < alea ; i ++ , ptr = ptr->next )
{
continue ;
}
demineur_play ( ptr->row , ptr->column ) ;
}
for ( ptr = rc ; ptr != NULL ; )
{
row_column_t *tmp = ptr->next ;
free ( ptr ) ;
ptr = tmp ;
}
}
/* ------------------------------------------------------------------------- */
void demineur_start_timer ( )
{
struct itimerval itimerval ;
itimerval.it_interval.tv_sec = 1 ;
itimerval.it_interval.tv_usec = 0 ;
itimerval.it_value.tv_sec = 1 ;
itimerval.it_value.tv_usec = 0 ;
if ( setitimer ( ITIMER_REAL , &itimerval , NULL ) == -1 )
{
perror ( "setitimer" ) ;
exit ( EX_OSERR ) ;
}
}
/* ------------------------------------------------------------------------- */
void demineur_stop_timer ( )
{
struct itimerval itimerval ;
timerclear ( &itimerval.it_interval ) ;
timerclear ( &itimerval.it_value ) ;
if ( setitimer ( ITIMER_REAL , &itimerval , NULL ) == -1 )
{
perror ( "setitimer" ) ;
exit ( EX_OSERR ) ;
}
}
/* ------------------------------------------------------------------------- */
void demineur_play ( int row , int column )
{
if ( row < 1 || row > board.rows || column < 1 || column > board.columns )
{
return ;
}
if ( board.board[row][column].state == HIDDEN )
{
board.board[row][column].state = UNCOVERED ;
xdemineur_square ( row , column ) ;
if ( board.board[row][column].mine )
{
state = LOST ;
demineur_stop_timer ( ) ;
xdemineur_display ( ) ;
}
else if ( board.board[row][column].around == 0 )
{
demineur_clear ( row , column ) ;
}
}
if ( mines == 0 )
{
demineur_won ( ) ;
}
}
/* ------------------------------------------------------------------------- */
int demineur_hidden ( int row , int column )
{
return demineur_hidden_count ( row - 1 , column - 1 ) +
demineur_hidden_count ( row - 1 , column ) +
demineur_hidden_count ( row - 1 , column + 1 ) +
demineur_hidden_count ( row , column - 1 ) +
demineur_hidden_count ( row , column + 1 ) +
demineur_hidden_count ( row + 1 , column - 1 ) +
demineur_hidden_count ( row + 1 , column ) +
demineur_hidden_count ( row + 1 , column + 1 ) ;
}
/* ------------------------------------------------------------------------- */
int demineur_hidden_count ( int row , int column )
{
return ( board.board[row][column].state == HIDDEN ) ? 1 : 0 ;
}
/* ------------------------------------------------------------------------- */
int demineur_flags ( int row , int column )
{
return demineur_flag_count ( row - 1 , column - 1 ) +
demineur_flag_count ( row - 1 , column ) +
demineur_flag_count ( row - 1 , column + 1 ) +
demineur_flag_count ( row , column - 1 ) +
demineur_flag_count ( row , column + 1 ) +
demineur_flag_count ( row + 1 , column - 1 ) +
demineur_flag_count ( row + 1 , column ) +
demineur_flag_count ( row + 1 , column + 1 ) ;
}
/* ------------------------------------------------------------------------- */
int demineur_flag_count ( int row , int column )
{
return ( board.board[row][column].state == FLAGGED ) ? 1 : 0 ;
}
/* ------------------------------------------------------------------------- */
void demineur_clear ( int row , int column )
{
demineur_play ( row - 1 , column - 1 ) ;
demineur_play ( row - 1 , column ) ;
demineur_play ( row - 1 , column + 1 ) ;
demineur_play ( row , column - 1 ) ;
demineur_play ( row , column + 1 ) ;
demineur_play ( row + 1 , column - 1 ) ;
demineur_play ( row + 1 , column ) ;
demineur_play ( row + 1 , column + 1 ) ;
}
/* ------------------------------------------------------------------------- */
void demineur_flag_question ( int row , int column )
{
switch ( board.board[row][column].state )
{
case HIDDEN :
if ( mines > 0 )
{
board.board[row][column].state = FLAGGED ;
mines -- ;
if ( mines == 0 )
{
demineur_won ( ) ;
}
}
break ;
case FLAGGED :
board.board[row][column].state = QUESTION ;
mines ++ ;
break ;
case QUESTION :
board.board[row][column].state = HIDDEN ;
break ;
case UNCOVERED :
break ;
}
}
/* ------------------------------------------------------------------------- */
void demineur_won ( )
{
int row , column ;
if (state == LOST) return ;
/* This may happen in case no hidden or questioned cases are left
but the last uncovered case was holding a mine. This means that
one of the flagged cases was in fact not holding a mine.
[Ralf Treinen <treinen@debian.org>]
*/
for ( row = 1 ; row <= board.rows ; row ++ )
{
for ( column = 1 ; column <= board.columns ; column ++ )
{
if ( board.board[row][column].state == HIDDEN ||
board.board[row][column].state == QUESTION )
{
return ;
}
}
}
/* if you get there, it's that you've won */
state = WON ;
demineur_stop_timer ( ) ;
xdemineur_face ( ) ;
}
/* ------------------------------------------------------------------------- */
void demineur_end ( )
{
int row ;
for ( row = 0 ; row < board.rows + 2 ; row ++ )
{
free ( board.board[row] ) ;
}
free ( board.board ) ;
}
|