#include using namespace std; /* A solved sudoku puzzle is a matrix of typically 9*9 in which every row, every column and every block contains every number from 1 to 9 exactly once. */ void stack(int a[9][9],int vri,int vci,int val,int &bvalid) { int r,c; for(r=vri/3*3;r<=vri/3*3+2;r++){ for(c=vci/3*3;c<=vci/3*3+2;c++){ if(vri==r && vci==c) continue; if(val==a[r][c]) bvalid=0; } } } void CheckSudoku(int a[9][9]) { int i,j,vri,vci,brk=0,r,c; // vci= value's column index // vri= value's row index int val,rvalid,cvalid,bvalid; rvalid=1; cvalid=1; bvalid=1; for(i=0;i<9;i++) { for(j=0;j<9;j++) { val=a[i][j]; vri=i; vci=j; // Row checking for(c=0;c<9;c++){ if(c==vci) continue; if(a[i][c]==val) rvalid=0; } // Column checking for(r=0;r<9;r++){ if(r==vri) continue; if(a[r][j]==val) cvalid=0; } // Block Checking if(vri>=0 && vri<=2) //Stack 1. Row 0 to 2 stack(a,vri,vci,val,bvalid); else if(vri>=3 && vri<=5) //Stack 2. Row 3 to 5 stack(a,vri,vci,val,bvalid); else if(vri>=6 && vri<=8) //Stack 3. Row 6 to 8 stack(a,vri,vci,val,bvalid); if(!(rvalid && cvalid && bvalid)){ brk=1; break; } } if(brk) break; } if(rvalid && cvalid && bvalid) cout<<"-> VALID SUDOKU."; else cout<<"-> INVALID SUDOKU."; } void PrintSudoku(int a[9][9]) { int i,j; for(i=0;i<9;i++) { for(j=0;j<9;j++) { cout< 1"< 2"< 3"< 4"< 5"< 6"< 7"<

SUDOKU Validator (C27)