Question

need help.....

sudoku.h

class sudoku
{
public:
sudoku();
//default constructor
//Postcondition: grid is initialized to 0

sudoku(int g[][9]);
//constructor
//Postcondition: grid = g

void initializeSudokuGrid();
//Function to prompt the user to specify the numbers of the
//partially filled grid.
//Postcondition: grid is initialized to the numbers
// specified by the user.

void initializeSudokuGrid(int g[][9]);
//Function to initialize grid to g
//Postcondition: grid = g;

void printSudokuGrid();
//Function to print the sudoku grid.

bool solveSudoku();
//Funtion to solve the sudoku problem.
//Postcondition: If a solution exits, it returns true,
// otherwise it returns false.
bool findEmptyGridSlot(int &row, int &col);
//Function to determine if the grid slot specified by
//row and col is empty.
//Postcondition: Returns true if grid[row][col] = 0;

bool canPlaceNum(int row, int col, int num);
//Function to determine if num can be placed in
//grid[row][col]
//Postcondition: Returns true if num can be placed in
// grid[row][col], otherwise it returns false.

bool numAlreadyInRow(int row, int num);
//Function to determine if num is in grid[row][]
//Postcondition: Returns true if num is in grid[row][],
// otherwise it returns false.

bool numAlreadyInCol(int col, int num);
//Function to determine if num is in grid[row][]
//Postcondition: Returns true if num is in grid[row][],
// otherwise it returns false.

bool numAlreadyInBox(int smallGridRow, int smallGridCol,
int num);
//Function to determine if num is in the small grid
//Postcondition: Returns true if num is in small grid,
// otherwise it returns false.

private:
int grid[9][9];
};

//sudoku.cpp

#include <iostream>
#include "sudoku.h"

using namespace std;

sudoku::sudoku()
{
for (int row =0; row<9;row++)
for (int col=0; col<9; col++)
grid[row][col]=0;

}

sudoku::sudoku(int g[][9])
{
initializeSudokuGrid(g);

}

void sudoku::initializeSudokuGrid()
{
//Interactive
}

void sudoku::initializeSudokuGrid(int g[][9])
{

for (int row =0; row<9;row++)
for (int col=0; col<9; col++)
grid[row][col]=g[row][col];
}

void sudoku::printSudokuGrid()
{
for (int row =0; row<9;row++)
{
for (int col=0; col<9; col++)
cout<<grid[row][col]<<' ';
cout<<endl;
}
  
}

bool sudoku::solveSudoku()
{
int row, col;

if (findEmptyGridSlot(row, col))
{
for (int num = 1; num <= 9; num++)
{
if (canPlaceNum(row, col, num))
{
grid[row][col] = num;
if (solveSudoku()) //recursive call
return true;
grid[row][col] = 0; //backtrack
}
}
return false;
}
else
return true; //there are no empty slots
}

bool sudoku::findEmptyGridSlot(int &row, int &col)
{
for (row=0; row<9;++row)
for(col=0; col<9;++col)
if(grid[row][col]==0)
return true;
return false;
}

bool sudoku::canPlaceNum(int row, int col, int num)
{
//you can place number if number is not already in a row, col or box.

}

bool sudoku::numAlreadyInRow(int row, int num)
{
for (int col=0;col<9;++col)
if(true)
return true;
return true;
}

bool sudoku::numAlreadyInCol(int col, int num)
{
for (int row=0;row<9;++row)
if(true)
return true;
return true;
}

bool sudoku::numAlreadyInBox(int smallGridRow, int smallGridCol,
int num)
{

int startrow = smallGridRow - smallGridRow%3;
int endrow = startrow +2;
int startcol = smallGridCol - smallGridCol%3;
int endcol = startcol +2;
for (int row =startrow;row<=endrow;++row)
for(int col=startcol;col<=endcol;++col)
if (grid[row][col]==num)
return true;
return false;
}

//sudoku.cpp

#include <iostream>
#include <cmath>
#include "sudoku.h"

using namespace std;

int main()
{

sudoku s;
s.printSudokuGrid();
cout<<endl;
s.solveSudoku();
s.printSudokuGrid();
cout<<endl;
s.solveSudoku();
s.printSudokuGrid();
cout<<endl;
return 0;
}

Answer 1

sudoku::sudoku(int g[][9]) { for(int i=0;i<9;i++){ for(int j=0;j<9;j++){ grid[i][j] = g[i][j]; } } } void sudoku::initializeSudokuGrid() { while(true){ int row,col,num; cout<<"Enter in the format row col num, enter a row/col number greater than 8 to exit"; cin>>row>>col>>num; if(row>8) break; if(col>8) break; grid[row][col] = num; } } void sudoku::initializeSudokuGrid(int g[][9]) { for(int i=0;i<9;i++){ for(int j=0;j<9;j++){ grid[i][j] = g[i][j]; } } } void sudoku::printSudokuGrid() { /// Iterate over the elements and print! for(int i=0;i<9;i++){ for(int j=0;j<9;j++){ cout<<grid[i][j]<<" "; } cout<<endl; } } bool sudoku::solveSudoku() { int row, col; if (findEmptyGridSlot(row, col)) { for (int num = 1; num <= 9; num++) { if (canPlaceNum(row, col, num)) { grid[row][col] = num; if (solveSudoku()) //recursive call return true; grid[row][col] = 0; //backtrack } } return false; } else return true; //there are no empty slots } bool sudoku::findEmptyGridSlot(int &row, int &col) { return grid[row][col] == 0; } bool sudoku::canPlaceNum(int row, int col, int num) { int smallgridRow = (row/3)*3; int smallgridCol = (col/3)*3; return !numAlreadyInRow(row,num) && !numAlreadyInCol(col,num) && !numAlreadyInBox(smallgridRow,smallgridCol,num); } bool sudoku::numAlreadyInRow(int row, int num) { for(int i=0;i<9;i++){ if(grid[row][i] == num) return true; } return false; } bool sudoku::numAlreadyInCol(int col, int num) { for(int i=0;i<9;i++){ if(grid[i][col] == num) return true; } return false; } bool sudoku::numAlreadyInBox(int smallGridRow, int smallGridCol, int num) { for(int i=0;i<3;i++){ for(int j=0;j<3;j++){ if(grid[smallGridRow+i][smallGridCol+j] == num) return true; } } return false; }