Scribd
Upload
6 views

C++ Program to back track

This C++ program solves a Sudoku puzzle using a backtracking algorithm. It includes functions to check if a number can be safely placed in a given position and to recursively solve the Sudoku grid. The main function initializes a Sudoku board, calls the solver, and prints the completed board.

Uploaded by

charles411hl
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

C++ Program to back track

This C++ program solves a Sudoku puzzle using a backtracking algorithm. It includes functions to check if a number can be safely placed in a given position and to recursively solve the Sudoku grid. The main function initializes a Sudoku board, calls the solver, and prints the completed board.

Uploaded by

charles411hl
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

// C++ Program to solve Sudoku problem

#include <iostream>

#include <vector>

using namespace std;

// Function to check if it is safe to place num at mat[row][col]

bool isSafe(vector<vector<int>> &mat, int row, int col, int num) {

// Check if num exist in the row

for (int x = 0; x <= 8; x++)

if (mat[row][x] == num)

return false;

// Check if num exist in the col

for (int x = 0; x <= 8; x++)

if (mat[x][col] == num)

return false;

// Check if num exist in the 3x3 sub-matrix

int startRow = row - (row % 3), startCol = col - (col % 3);

for (int i = 0; i < 3; i++)

for (int j = 0; j < 3; j++)

if (mat[i + startRow][j + startCol] == num)

return false;
return true;

// Function to solve the Sudoku problem

bool solveSudokuRec(vector<vector<int>> &mat, int row, int col) {

int n = mat.size();

// base case: Reached nth column of last row

if (row == n - 1 && col == n)

return true;

// If last column of the row go to next row

if (col == n) {

row++;

col = 0;

// If cell is already occupied then move forward

if (mat[row][col] != 0)

return solveSudokuRec(mat, row, col + 1);

for (int num = 1; num <= n; num++) {

// If it is safe to place num at current position


if (isSafe(mat, row, col, num)) {

mat[row][col] = num;

if (solveSudokuRec(mat, row, col + 1))

return true;

mat[row][col] = 0;

return false;

void solveSudoku(vector<vector<int>> &mat) {

solveSudokuRec(mat, 0, 0);

int main() {

vector<vector<int>> mat = {

{3, 0, 6, 5, 0, 8, 4, 0, 0},

{5, 2, 0, 0, 0, 0, 0, 0, 0},

{0, 8, 7, 0, 0, 0, 0, 3, 1},

{0, 0, 3, 0, 1, 0, 0, 8, 0},

{9, 0, 0, 8, 6, 3, 0, 0, 5},

{0, 5, 0, 0, 9, 0, 6, 0, 0},

{1, 3, 0, 0, 0, 0, 2, 5, 0},

{0, 0, 0, 0, 0, 0, 0, 7, 4},
{0, 0, 5, 2, 0, 6, 3, 0, 0}};

solveSudoku(mat);

for (int i = 0; i < mat.size(); i++) {

for (int j = 0; j < mat.size(); j++)

cout << mat[i][j] << " ";

cout << endl;

return 0;

You might also like