next_value.c

//This area is for headers and function prototypes

//Declare struct here
struct solve_state
{
    int board[10][9][9];
    int views[9][4];
    int N;
    int x;
    int y;
    int z;
};

//Will determine what the next possible value is for a given cell. If there is no possible value, returns 0.
int next_value(struct solve_state current, int x, int y, int z)
{
    while (z - 1 < current.N)
    {
        if (current.board[z - 1][y][x])
            return (z);     //UNSURE OF THIS INCREMENTATION
        z++;
    }
    return (0);
}

//Will return an int where the first digit is the y position and the second digit is the x position.
//If one of the cell is impossible, will return 0
//If the board is fully populated, next_cell = 100

int next_cell(struct solve_state current) {
    int most_certain;   //will store the smallest amount of possible values
    int next_cell;      //will store the position of the most certain cell
    int i;
    int j;

    most_certain = 9;   //the maximum value for any size board
    j = 0;
    next_cell = 100;
    while (j < current.N) {
        i = 0;
        while (i < current.N) {
            if (current.board[9][j][i] == 0)
                return (0);
            //if that cell has less possible values than the one currently held
            else if (current.board[9][j][i] < most_certain 
                    && current.board[9][j][i] != 1) {
                next_cell = (10 * j + i);
                most_certain = current.board[9][j][i];
            }
            i++;
        }
        j++;
    }
    return (next_cell);
}