amrouchi/SAE11_2025
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Presque fini

Browse Source
This commit is contained in:
lecointre
2025-12-06 15:49:10 +01:00
parent a774b48ee9
commit 9ad4e56bd8
11 changed files with 90 additions and 97 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/game_logic.c
+63 -64
View File
@@ -6,22 +6,22 @@
static void index_to_coords(int index, int cols, int *r, int *c)
{
*r = index / cols;
*c = index % cols;
*r = index / cols;
*c = index % cols;
}
static int find_adjacent_indices(int idx, int rows, int cols, int *out_indices)
{
int r = idx / cols;
int c = idx % cols;
int n = 0;
int r = idx / cols;
int c = idx % cols;
int n = 0;
if (r > 0) out_indices[n++] = (r - 1) * cols + c;
if (r < rows - 1) out_indices[n++] = (r + 1) * cols + c;
if (c > 0) out_indices[n++] = r * cols + (c - 1);
if (c < cols - 1) out_indices[n++] = r * cols + (c + 1);
if (r > 0) out_indices[n++] = (r - 1) * cols + c;
if (r < rows - 1) out_indices[n++] = (r + 1) * cols + c;
if (c > 0) out_indices[n++] = r * cols + (c - 1);
if (c < cols - 1) out_indices[n++] = r * cols + (c + 1);
return n;
return n;
}
@@ -34,7 +34,6 @@ void game_init(game_state_t *state, int rows, int cols, tile_t **tiles)
state->rows = rows;
state->cols = cols;
state->moves = 0UL;
state->is_solved = 1;
state->all_tiles = tiles;
state->permutation = (int *)malloc(num_tiles * sizeof(int));
@@ -44,57 +43,59 @@ void game_init(game_state_t *state, int rows, int cols, tile_t **tiles)
return;
}
for (i = 0; i < num_tiles - 1; i++) {
state->permutation[i] = i;
state->permutation[0] = -1;
state->empty_index = 0;
for (i = 1; i < num_tiles; i++) {
state->permutation[i] = i - 1;
}
state->permutation[num_tiles - 1] = -1;
state->empty_index = num_tiles - 1;
state->is_solved = 1;
}
void game_free(game_state_t *state)
{
if (state->permutation != NULL) {
free(state->permutation);
state->permutation = NULL;
}
if (state->permutation != NULL) {
free(state->permutation);
state->permutation = NULL;
}
}
int game_can_move(const game_state_t *state, int index_to_move)
{
int r_tile, c_tile;
int r_empty, c_empty;
if (index_to_move == state->empty_index) return 0;
if (index_to_move < 0 || index_to_move >= state->rows * state->cols) return 0;
int r_tile, c_tile;
int r_empty, c_empty;
if (index_to_move == state->empty_index) return 0;
if (index_to_move < 0 || index_to_move >= state->rows * state->cols) return 0;
index_to_coords(index_to_move, state->cols, &r_tile, &c_tile);
index_to_coords(state->empty_index, state->cols, &r_empty, &c_empty);
if (abs_val(r_tile - r_empty) + abs_val(c_tile - c_empty) == 1) {
return 1;
}
return 0;
index_to_coords(index_to_move, state->cols, &r_tile, &c_tile);
index_to_coords(state->empty_index, state->cols, &r_empty, &c_empty);
if (abs_val(r_tile - r_empty) + abs_val(c_tile - c_empty) == 1) {
return 1;
}
return 0;
}
int game_move_tile(game_state_t *state, int index_to_move)
{
int temp_tile_id;
int temp_tile_id;
if (!game_can_move(state, index_to_move)) {
return 0;
}
if (!game_can_move(state, index_to_move)) {
return 0;
}
temp_tile_id = state->permutation[index_to_move];
state->permutation[index_to_move] = state->permutation[state->empty_index];
state->permutation[state->empty_index] = temp_tile_id;
temp_tile_id = state->permutation[index_to_move];
state->permutation[index_to_move] = state->permutation[state->empty_index];
state->permutation[state->empty_index] = temp_tile_id;
state->empty_index = index_to_move;
state->empty_index = index_to_move;
state->moves++;
state->is_solved = game_is_solved(state);
state->moves++;
state->is_solved = game_is_solved(state);
return 1;
return 1;
}
int game_is_solved(const game_state_t *state)
@@ -102,12 +103,12 @@ int game_is_solved(const game_state_t *state)
int num_tiles = state->rows * state->cols;
int i;
if (state->permutation[num_tiles - 1] != -1) {
if (state->permutation[0] != -1) {
return 0;
}
for (i = 0; i < num_tiles - 1; i++) {
if (state->permutation[i] != i) {
for (i = 1; i < num_tiles; i++) {
if (state->permutation[i] != i - 1) {
return 0;
}
}
@@ -117,26 +118,24 @@ int game_is_solved(const game_state_t *state)
void game_shuffle_safe(game_state_t *state, int steps)
{
int prev_move = -1;
int choices[4];
int n_choices;
int pick_index;
int i;
for (i = 0; i < steps; i++) {
n_choices = find_adjacent_indices(state->empty_index, state->rows, state->cols, choices);
int prev_move = -1;
int choices[4];
int n_choices;
int pick_index;
int i;
for (i = 0; i < steps; i++) {
n_choices = find_adjacent_indices(state->empty_index, state->rows, state->cols, choices);
do {
pick_index = choices[random_int(n_choices)];
} while (n_choices > 1 && pick_index == prev_move);
do {
pick_index = choices[random_int(n_choices)];
} while (n_choices > 1 && pick_index == prev_move);
game_move_tile(state, pick_index);
prev_move = pick_index;
}
game_move_tile(state, pick_index);
prev_move = pick_index;
}
state->moves = 0UL;
state->is_solved = 0;
state->moves = 0UL;
state->is_solved = 0;
}