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 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483
| /* $ gcc -o main main.c && ./main*/
#define FALSE 0
#define TRUE 1
typedef int boolean;
#include <stdlib.h> // malloc, free
#include <stdio.h> // printf
#include <string.h> // memset, strcpy, strncpy, strcat
#define GRID_SIZE 3
#define NAME_MAX_LENGTH 256
#define NAME_DEFAULT "<Unknow>"
typedef struct _Dvz_Morpion Dvz_Morpion;
typedef enum _Dvz_Ship_Type Dvz_Ship_Type;
typedef struct _Dvz_Player Dvz_Player;
typedef struct _Dvz_Player_Class Dvz_Player_Class;
/** ***************************************************************************
* Declaration Ship
*************************************************************************** */
enum _Dvz_Ship_Type {
Dvz_Ship_VOID,
Dvz_Ship_ROUND,
Dvz_Ship_CROSS
};
/** ***************************************************************************
* Declaration Morpion
*************************************************************************** */
struct _Dvz_Morpion {
char grid[GRID_SIZE][GRID_SIZE];
Dvz_Player* player1;
Dvz_Player* player2;
Dvz_Player* current_player;
Dvz_Ship_Type ship_winner;
int move;
};
Dvz_Morpion* Dvz_Morpion_new (void);
void Dvz_Morpion_init (Dvz_Morpion* morpion);
void Dvz_Morpion_delete (Dvz_Morpion* morpion);
boolean Dvz_Morpion_set_player1 (Dvz_Morpion* morpion, Dvz_Player* player);
boolean Dvz_Morpion_set_player2 (Dvz_Morpion* morpion, Dvz_Player* player);
void Dvz_Morpion_reset (Dvz_Morpion* morpion);
boolean Dvz_Morpion_has_winner (Dvz_Morpion* morpion);
Dvz_Player* Dvz_Morpion_get_winner (Dvz_Morpion* morpion);
int Dvz_Morpion_get_move (Dvz_Morpion* morpion);// FIXME: get_num_move ?
boolean Dvz_Morpion_is_fill (Dvz_Morpion* morpion);
boolean Dvz_Morpion_is_over (Dvz_Morpion* morpion);
void Dvz_Morpion_next_player (Dvz_Morpion* morpion);
boolean Dvz_Morpion_action (Dvz_Morpion* morpion, Dvz_Player* player);
boolean Dvz_Morpion_run (Dvz_Morpion* morpion);
char* Dvz_Morpion_to_string (Dvz_Morpion* morpion);
/** ***************************************************************************
* Declaration Player
*************************************************************************** */
struct _Dvz_Player {
//FIXME
///char* name;// dynamic
char name[NAME_MAX_LENGTH];/// static
int row;
int col;
Dvz_Ship_Type ship;
};
Dvz_Player* Dvz_Player_new (char* name, Dvz_Ship_Type ship);
void Dvz_Player_init (Dvz_Player* player, char* name, Dvz_Ship_Type ship);
void Dvz_Player_delete (Dvz_Player* player);
static Dvz_Player_Class* dvz_player_class = NULL;
struct _Dvz_Player_Class {
boolean (*play) (Dvz_Player* player, Dvz_Morpion* morpion);
};
/** ***************************************************************************
* Object Morpion
*************************************************************************** */
Dvz_Morpion* Dvz_Morpion_new(void) {
Dvz_Morpion* morpion = (Dvz_Morpion*) malloc(sizeof(Dvz_Morpion));
Dvz_Morpion_init(morpion);
return morpion;
}
void Dvz_Morpion_init(Dvz_Morpion* morpion) {
// TODO: assert morpion
morpion->player1 = NULL;
morpion->player2 = NULL;
Dvz_Morpion_reset(morpion);
}
void Dvz_Morpion_delete(Dvz_Morpion* morpion) {
// TODO: assert morpion
free(morpion);
}
void Dvz_Morpion_reset(Dvz_Morpion* morpion) {
// TODO: assert morpion
memset(morpion->grid, Dvz_Ship_VOID, GRID_SIZE*GRID_SIZE);
morpion->move = 0;
morpion->current_player = NULL;
morpion->ship_winner = Dvz_Ship_VOID;
}
boolean Dvz_Morpion_set_player1(Dvz_Morpion* morpion, Dvz_Player* player) {
// TODO assert morpion && player
// TODO assert player2 && player1->ship != player2->ship
morpion->player1 = player;
return 0;
}
boolean Dvz_Morpion_set_player2(Dvz_Morpion* morpion, Dvz_Player* player) {
// TODO assert morpion && player
// TODO assert player1 && player1->ship != player2->ship
morpion->player2 = player;
return 0;
}
boolean Dvz_Morpion_has_winner(Dvz_Morpion* morpion) {
int i;
// TODO assert morpion
morpion->ship_winner = Dvz_Ship_VOID;
for(i=0; i<3; i++) {
// check all rows
if(morpion->grid[0][i] == morpion->grid[1][i]
&& morpion->grid[1][i] == morpion->grid[2][i]
&& morpion->grid[0][i]!=Dvz_Ship_VOID) {
morpion->ship_winner = morpion->grid[1][i];
return TRUE;
}
// check all cols
if(morpion->grid[i][0] == morpion->grid[i][1]
&& morpion->grid[i][1] == morpion->grid[i][2]
&& morpion->grid[i][0]!=Dvz_Ship_VOID) {
morpion->ship_winner = morpion->grid[i][1];
return TRUE;
}
}
// check diagonal north-ouest to sud-est
if(morpion->grid[0][0] == morpion->grid[1][1]
&& morpion->grid[1][1] == morpion->grid[2][2]
&& morpion->grid[0][0]!=Dvz_Ship_VOID) {
morpion->ship_winner = morpion->grid[1][1];
return TRUE;
}
// check diagonal north-est to sud-ouest
if(morpion->grid[2][0] == morpion->grid[1][1]
&& morpion->grid[1][1] == morpion->grid[0][2]
&& morpion->grid[2][0]!=Dvz_Ship_VOID) {
morpion->ship_winner = morpion->grid[1][1];
return TRUE;
}
return FALSE;
}
Dvz_Player* Dvz_Morpion_get_winner(Dvz_Morpion* morpion) {
// TODO assert morpion
if(morpion->ship_winner==morpion->player1->ship)
return morpion->player1;
if(morpion->ship_winner==morpion->player2->ship)
return morpion->player2;
return NULL;
}
int Dvz_Morpion_get_move(Dvz_Morpion* morpion) {
// TODO assert morpion
int row;
int col;
morpion->move = 0;
for (row=0; row<3; row++)
for (col=0; col<3; col++)
if (Dvz_Ship_VOID!=morpion->grid[row][col])
morpion->move++;
return morpion->move;
}
boolean Dvz_Morpion_is_fill(Dvz_Morpion* morpion) {
// TODO assert morpion
if (morpion->move < GRID_SIZE*GRID_SIZE)
return FALSE;
return TRUE;
}
boolean Dvz_Morpion_is_over(Dvz_Morpion* morpion) {
// TODO assert morpion
return Dvz_Morpion_has_winner(morpion) || Dvz_Morpion_is_fill(morpion);
}
Dvz_Player* Dvz_Morpion_get_current_player(Dvz_Morpion* morpion) {
if (!morpion->current_player) {
morpion->current_player = morpion->player1;
}
return morpion->current_player;
}
void Dvz_Morpion_next_player(Dvz_Morpion* morpion) {
if (morpion->player1 == morpion->current_player) {
morpion->current_player = morpion->player2;
} else {
morpion->current_player = morpion->player1;
}
morpion->move++;
}
boolean Dvz_Morpion_action(Dvz_Morpion* morpion, Dvz_Player* player) {
// TODO: assert morpion && player
// The case is already used
if (morpion->grid[player->col][player->row]!=Dvz_Ship_VOID) {
return FALSE;
}
morpion->grid[player->col][player->row] = player->ship;
return TRUE;
}
boolean Dvz_Morpion_run(Dvz_Morpion* morpion) {
// TODO assert morpion
// check players
if (!morpion->player1 || !morpion->player2) {
// add_error("No players");
return FALSE;
}
// run game
// let end-user start the game in a arbitrary state
Dvz_Morpion_get_move(morpion);// FIXME
morpion->current_player = morpion->player1;// FIXME
while (!Dvz_Morpion_is_over(morpion)) {
char* string = Dvz_Morpion_to_string(morpion);
boolean success = Dvz_Player_play(
Dvz_Morpion_get_current_player(morpion),
morpion
);
Dvz_Morpion_next_player(morpion);
}
char* string = Dvz_Morpion_to_string(morpion);
// check score
if (Dvz_Morpion_has_winner(morpion)) {
Dvz_Player* winner = Dvz_Morpion_get_winner(morpion);
printf("And the winner is : %s\n", winner->name);
} else {
printf("The game ended in a draw\n");
}
return TRUE;
}
char* Dvz_Morpion_to_string(Dvz_Morpion* morpion) {
int row;
int col;
char* player1;
char* player2;
Dvz_Player* player;
char* underscore;
int length1;
int length2;
int length;
char* grid;
char *_header = "\
###############################################################################\n\
# #\n\
# Tic-Tac Toe #\n\
# ----------- #\n\
# #\n\
# by Ludovic Schaublore #\n\
###############################################################################\n";
char* _grid = "\
_ | _ | _ \n\
---+---+---\n\
_ | _ | _ \n\
---+---+---\n\
_ | _ | _ \n";
char *_menu = "Menu : Reset[r], Quit[q], Help[h], Play[7|8|9|4|5|6|1|2|3]\n";
player = Dvz_Morpion_get_winner(morpion);
if (player==NULL)
player = morpion->current_player;
length1 = strlen(morpion->player1->name);
length2 = strlen(morpion->player2->name);
length = strlen(player->name);
player1 = (char*) malloc(length1+4);
player2 = (char*) malloc(length2+4);
underscore = (char*) malloc(length+1);
player1 = strcpy(player1, morpion->player1->name);
strcat(player1, " [O]");
player2 = strcpy(player2, "[X] ");
strcat(player2, morpion->player2->name);
memset(underscore, '-', length);
underscore[length] = '\n';
grid = (char*) malloc(strlen(_grid));
strcpy(grid, _grid);
int i;
/* printf("int help[] = {"); for(i=0; i<strlen(_grid); i++) if(_grid[i]=='_') printf("%d, ", i); printf("}\n"); exit(-1);*/
int help[] = {35, 39, 43, 127, 131, 135, 219, 223, 227};// index of cell
for(row=0; row<3; row++) {
for(col=0; col<3; col++){
i = (row*3) + col;//linearize coordinate of grid; [0][0]=>0; [2][2]=>9
if(morpion->grid[col][row]==Dvz_Ship_VOID) grid[help[i]] = ' ';
else if(morpion->grid[col][row]==Dvz_Ship_ROUND) grid[help[i]] = 'O';
else if(morpion->grid[col][row]==Dvz_Ship_CROSS) grid[help[i]] = 'X';
}
}
printf("%s\n", _header);
printf("%38s - %s\n", player1, player2);
if (player == morpion->player1)
printf("%35s\n", underscore);
else
printf("%51s\n", underscore);
printf("\n");
printf("%s\n\n\n", grid);
printf("%s\n", _menu);
free(player1);
free(player2);
free(underscore);
free(grid);
return "";
}
/** ***************************************************************************
* Object Player
*************************************************************************** */
static boolean Dvz_Player_Class_play(Dvz_Player* player, Dvz_Morpion* morpion) {
//TODO: assetr player
//TODO: assert morpion
char entry[2];
boolean success;
int i_try;
int max_attempts = 10;
int id = 0;
int data[18] = {
0, 2, 1, 2, 2, 2,
0, 1, 1, 1, 2, 1,
0, 0, 1, 0, 2, 0
};
printf("Please '%s' enter a Cell ID :\n", player->name);
for (i_try=0; i_try<max_attempts; i_try++) {
printf(">");
scanf("%s", entry);// FIXME
id = atoi(entry);
if (!id || id<1 || id>9) {
printf("A valid Cell ID is required, but '%s' is not between 1 and 9\n", entry);
} else {
break;
}
}
if (i_try>=max_attempts)
return FALSE;
/* Numeric Pad conversion to Grid coordinated */
player->row = data[(id-1)*2+1];
player->col = data[(id-1)*2];
success = Dvz_Morpion_action(morpion, player);
if (!success) {
printf("This Cell is already played. Retry\n");
success = Dvz_Player_Class_play(player, morpion);
}
return TRUE;
}
static void Dvz_Type_new(void) {
dvz_player_class = (Dvz_Player_Class*) malloc(sizeof(Dvz_Player_Class));
}
Dvz_Player* Dvz_Player_new(char* name, Dvz_Ship_Type ship) {
Dvz_Player* player = (Dvz_Player*) malloc(sizeof(Dvz_Player));
Dvz_Player_init(player, name, ship);
dvz_player_class->play = Dvz_Player_Class_play;
return player;
}
void Dvz_Player_init(Dvz_Player* player, char* name, Dvz_Ship_Type ship) {
int length;
// TODO: assert player
// TODO assert ship==Dvz_Ship_ROUND || ship == Dvz_Ship_CROSS
length = strlen(name);
if (!length) {
// TODO: add_warning(Name is empty);
strcpy(player->name, NAME_DEFAULT);
} else if (length<(NAME_MAX_LENGTH-1)) {
strcpy(player->name, name);
} else {
// TODO: add_warning(Name is too long, name was shorten);
strncpy(player->name, name, NAME_MAX_LENGTH-1-3);
strcat(player->name, "...");
}
player->ship = ship;
}
void Dvz_Player_delete(Dvz_Player* player) {
///if player->name = malloc(length+1);
///free(player->name);
free(player);
}
boolean Dvz_Player_play(Dvz_Player* player, Dvz_Morpion* morpion) {
//assert player && morpion
return dvz_player_class->play(player, morpion);
}
/** ***************************************************************************
* entry point
*************************************************************************** */
int main(int argc, char *argv[]) {
int success;
Dvz_Morpion* morpion;
Dvz_Player* player1;
Dvz_Player* player2;
char name1[] = "Emi";
char name2[] = "Ludor";
Dvz_Type_new();
player1 = Dvz_Player_new(name1, Dvz_Ship_ROUND);
player2 = Dvz_Player_new(name2, Dvz_Ship_CROSS);
morpion = Dvz_Morpion_new();
if (!morpion) {
// Error can't allocate memory
return -1;
}
Dvz_Morpion_set_player1(morpion, player1);
Dvz_Morpion_set_player2(morpion, player2);
success = Dvz_Morpion_run(morpion);
if (success!=TRUE) {
printf("\n");
}
Dvz_Player_delete(player1);
Dvz_Player_delete(player2);
Dvz_Morpion_delete(morpion);
//Dvz_Type_delete();
//L'omaga Choco: contre fumer
// Elixir: fermenté poly
return success;
} |
Partager