Last active
March 21, 2019 06:33
-
-
Save jakeols/7314e47f7ea901113ba5fe249ab32f35 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
#include<stdlib.h> | |
#include<stdbool.h> | |
#include<time.h> | |
const int N = 9; // board constant dimensions | |
int checkValue(int board[][9], int row, int col, int value); | |
void checkPuzzle(int board[][9], int row, int col, int value); | |
int checkHorizontally(int board[][9], int startRow, int startCol, int value, int end){ | |
int i = startCol; | |
while(board[startRow][i] != value && i < end){ //as long as value doesn't match numbers already in the board | |
i++; | |
} | |
if(i == end){ //if while loop reached the end of the row | |
return 1; //number given (value) doesn't exist in the row | |
} | |
else{ | |
return -1; //number already exists in the row yet | |
} | |
} | |
int checkVertically(int board[][9], int col, int value){ | |
int i = 0; | |
while(board[i][col] != value && i < 9){ //as long as value doesn't match numbers already in the board | |
i++; | |
} | |
if(i == 9){ //if while loop reached the end of the column | |
return 1; //number given (value) doesn't exist in the column | |
} | |
else{ | |
return -1; //number already exists in the column yet | |
} | |
} | |
void deleteValue(int board[][9]){ | |
int row, col; | |
printf("\nDELETE ENTRY\n"); | |
printf("Enter row index: "); | |
scanf("%d", &row); | |
printf("Enter a column index: "); | |
scanf("%d", &col); | |
board[row][col] = 0; | |
printf("Deleted value at [%d][%d]\n", row, col); | |
} | |
void Display(int arr[N][N]){ | |
int i, j; | |
for (i = 0; i < N; i++){ | |
printf("\n"); | |
for (j = 0; j < N; j++) { | |
printf("%d ", arr[i][j]); | |
} | |
printf("\n"); | |
} | |
} | |
void checkPuzzle(int board[][9], int row, int col, int value){ | |
int result; | |
result = checkValue(board, row, col, value); | |
if(result == 1){ | |
board[row][col] = value; | |
} | |
else{ | |
printf("%d already exists in this row/column/box\n", value); | |
} | |
return; | |
} | |
int checkBox(int board[][9], int row, int col, int value){ | |
int index1, index2; | |
if(row < 3){ //check box starting from row 0 to row 2 | |
index1 = 0; | |
if(col < 3){ //check box starting from col 0 to col 2 | |
index2 = 0; | |
} | |
else if(col >= 3 && col < 6){ //check box starting from col 3 to col 5 | |
index2 = 3; | |
} | |
else{ //otherwise check from col 6 to col 8 | |
index2 = 6; | |
} | |
} | |
else if(row >= 3 && row < 6){ //check box starting from row 3 to row 5 | |
index1 = 3; | |
if(col < 3){ //check box starting from col 0 to col 2 | |
index2 = 0; | |
} | |
else if(col >= 3 && col < 6){ //check box starting from col 3 to col 5 | |
index2 = 3; | |
} | |
else{ //otherwise check from col 6 to col 8 | |
index2 = 6; | |
} | |
} | |
else{ //otherwise check from row 6 to row 8 | |
index1 = 6; | |
if(col < 3){ //check box starting from col 0 to col 2 | |
index2 = 0; | |
} | |
else if(col >= 3 && col < 6){ //check box starting from col 3 to col 5 | |
index2 = 3; | |
} | |
else{ //otherwise check from col 6 to col 8 | |
index2 = 6; | |
} | |
} | |
int r1 = checkHorizontally(board, index1, index2, value, 3); | |
index1++; | |
int r2 = checkHorizontally(board, index1, index2, value, 3); | |
index1++; | |
int r3 = checkHorizontally(board, index1, index2, value, 3); | |
if(r1 == 1 && r2 == 1 && r3 == 1) | |
return 1; //number doesn't occur twice in box | |
else | |
return -1; | |
} | |
int checkValue(int board[][9], int row, int col, int value){ | |
int horiz, vert, box; | |
horiz = checkHorizontally(board, row, 0, value, 9); | |
vert = checkVertically(board, col, value); | |
box = checkBox(board, row, col, value); | |
if(horiz == 1 && vert == 1 && box == 1){ | |
return 1; | |
} | |
else{ | |
return -1; | |
} | |
} | |
/* | |
* Generates a random Soduku board that can be played | |
* Returns the starting board as a 2D array | |
*/ | |
int isAvailable(int puzzle[][9], int row, int col, int num) | |
{ | |
int rowStart = (row/3) * 3; | |
int colStart = (col/3) * 3; | |
int i, j; | |
for(i=0; i<9; ++i) | |
{ | |
if (puzzle[row][i] == num) return 0; | |
if (puzzle[i][col] == num) return 0; | |
if (puzzle[rowStart + (i%3)][colStart + (i/3)] == num) return 0; | |
} | |
return 1; | |
} | |
int fillSudoku(int puzzle[][9], int row, int col){ | |
int i; | |
if(row<9 && col<9) | |
{ | |
if(puzzle[row][col] != 0) | |
{ | |
if((col+1)<9) return fillSudoku(puzzle, row, col+1); | |
else if((row+1)<9) return fillSudoku(puzzle, row+1, 0); | |
else return 1; | |
} | |
else | |
{ | |
for(i=0; i<9; ++i) | |
{ | |
if(isAvailable(puzzle, row, col, i+1)) | |
{ | |
puzzle[row][col] = i+1; | |
if((col+1)<9) | |
{ | |
if(fillSudoku(puzzle, row, col +1)) return 1; | |
else puzzle[row][col] = 0; | |
} | |
else if((row+1)<9) | |
{ | |
if(fillSudoku(puzzle, row+1, 0)) return 1; | |
else puzzle[row][col] = 0; | |
} | |
else return 1; | |
} | |
} | |
} | |
return 0; | |
} | |
else return 1; | |
} | |
void generateStartingBoard(int board[N][N]){ | |
int i,j; | |
for(i = 0; i < 9; i++){ | |
for(j=0; j < 9; j++){ | |
board[i][j] = 0; | |
} | |
} | |
srand(time(0)); | |
// adds a random amount of numbers to board first | |
for(int k = 0; k < rand() % 10; k++){ | |
int randomColumn = rand() % 10; | |
int randomRow = rand() % 10; | |
int randomNumber = rand() % 10; | |
board[randomRow][randomColumn] = randomNumber; | |
} | |
// adds random numbers to the corners | |
int randomTopLeft = rand() %10; | |
board[0][0] = randomTopLeft; | |
int randomTopRight = rand() % 10; | |
board[8][8] = randomTopRight; | |
fillSudoku(board, 0, 0); | |
Display(board); | |
} | |
void CreateSudokuPuzzle(int board[N][N], int start[N][N]){ | |
int i, j; | |
for(i = 0; i < N; i++){ | |
for(j = 0; j < N; j++){ | |
board[i][j] = start[i][j]; | |
} | |
} | |
} | |
int RandomNumber(){ | |
return rand() % 10; | |
} | |
// check if no 0's are left | |
bool isFull(int board[N][N]){ | |
int i, j; | |
bool isFull = true; | |
for(i = 0; i < N; i++){ | |
for(j = 0; j < N; j++){ | |
if(board[i][j] == 0){ | |
isFull = false; | |
} | |
} | |
} | |
return isFull; | |
} | |
void addGuess(int arr[N][N], int row, int column, int guess){ | |
// add guess to that location | |
arr[row][column] = guess; | |
} | |
void reset(int board[N][N], int start[N][N]){ | |
int i, j; | |
for(i = 0; i < N; i++){ | |
for(j = 0; j < N; j++){ | |
board[i][j] = start[i][j]; | |
} | |
} | |
} | |
int getValueIn(int board[N][N], int row, int column){ | |
return board[row][column]; | |
} | |
int main(int argc, char const *argv[]) | |
{ | |
// while(true){ // keep the user in the game | |
int board[9][9]; | |
int start[9][9] = { | |
{9, 0, 0, 3, 0, 8, 0, 0, 0}, | |
{0, 3, 6, 7, 4, 0, 0, 0, 1}, | |
{5, 7, 0, 0, 6, 0, 4, 0, 0}, | |
{0, 9, 0, 0, 0, 0, 1, 8, 0}, | |
{8, 0, 1, 0, 7, 0, 3, 0, 6}, | |
{0, 5, 3, 0, 0, 0, 0, 2, 0}, | |
{0, 0, 9, 0, 3, 0, 0, 6, 8}, | |
{7, 0, 0, 0, 1, 4, 2, 9, 0}, | |
{0, 0, 0, 8, 0, 7, 0, 0, 4} | |
}; | |
printf("Welcome to Sodoku!"); | |
generateStartingBoard(board); | |
// Display(board); | |
// while(!isFull(board)){ | |
// int guessRow, guessColumn, guess; | |
// printf("Row to enter value: "); | |
// scanf("%d", &guessRow); | |
// printf("Column to value: "); | |
// scanf("%d", &guessColumn); | |
// printf("Guess to enter: "); | |
// scanf("%d", &guess); | |
// addGuess(board, guessRow, guessColumn, guess); | |
// Display(board); | |
// } | |
// } | |
return 0; | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment