Problème fonction récursive

mCellValue[i][j] == 0

• ta récursion exprime, à partir d'une case, quelle case explorer ;
• ta récursion se termine (n'engendre pas une boucle infinie) et idéalement ne re-déclenche pas des calculs déjà faits.

#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#define X 9

int min(int x, int y) {
    return x < y ? x : y;
}

int max(int x, int y) {
    return x > y ? x : y;
}

void display(int **tab, int **played, size_t num_rows, size_t num_cols) {
    for (size_t i = 0; i < num_rows; i++) {
        for (size_t j = 0; j < num_cols; j++) {
            if (played[i][j]) {
                if (tab[i][j] == X) {
                    printf("*");
                } else {
                    printf("%d", tab[i][j]);
                }
            } else {
                printf(".");
            }
        }
        printf("\n");
    }
}

int ** calloc_matrix(size_t num_rows, size_t num_cols) {
    int ** matrix = (int **) malloc(sizeof(int *) * num_rows);
    if (matrix) {
        for (size_t i = 0; i < num_rows; i++) {
            matrix[i] = (int *) calloc(sizeof(int), num_rows);
        }
    }
    return matrix;
}

void free_matrix(int ** matrix, size_t num_rows) {
    if (matrix) {
        for (size_t i = 0; i < num_rows; i++) {
            if (matrix[i]) {
                free(matrix[i]);
            }
        }
        free(matrix);
    }
}

void play(int **tab, int **played, size_t num_rows, size_t num_cols, size_t k, size_t l) {
    played[k][l] = 1;
    if (tab[k][l] == 0) {
        for (size_t i = max(0, k - 1); i < min(num_rows, k + 2); i++) {
            for (size_t j = max(0, l - 1); j < min(num_cols, l + 2); j++) {
                if (!played[i][j]) {
                    play(tab, played, num_rows, num_cols, i, j);
                }
            }
        }
    }
}


int main(){
    const size_t num_rows = 4;
    const size_t num_cols = 5;

    int ** played = calloc_matrix(num_rows, num_cols);

    // X == mine
    // autre valeur == nombre de mines adjacentes
    int ** tab = calloc_matrix(num_rows, num_cols);
    tab[0][0] = 0; tab[0][1] = 0; tab[0][2] = 1; tab[0][3] = 1; tab[0][4] = 1;
    tab[1][0] = 0; tab[1][1] = 0; tab[1][2] = 2; tab[1][3] = X; tab[1][4] = 2;
    tab[2][0] = 1; tab[2][1] = 1; tab[2][2] = 2; tab[2][3] = X; tab[2][4] = 2;
    tab[3][0] = X; tab[3][1] = 1; tab[3][2] = 1; tab[3][3] = 1; tab[3][4] = 1;


    printf("Before:\n");
    display(tab, played, num_rows, num_cols);

    printf("\nAfter:\n");
    play(tab, played, num_rows, num_cols, 0, 0);
    display(tab, played, num_rows, num_cols);

    free_matrix(tab, num_rows);
    free_matrix(played, num_rows);
    return 0;
}

Before:
.....
.....
.....
.....

After:
001..
002..
112..
.....