cpp: Sudoku

 

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895

/*****************************************************************//**  * \file   ConsoleSudoku.cpp   c++ 14  * \brief  九宫独数填充游戏  * from https://github.com/vaithak/Sudoku-Generator  * \author geovindu  * \date   July 2023  *********************************************************************/ // ConsoleSudoku.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。 //   #include <iostream> #include <iostream> #include <algorithm> #include <ctime> #include <cstdlib> #include <fstream> #include <sstream> #include <string> #include <vector>   #define UNASSIGNED 0   using namespace std;     /// <summary> /// /// </summary> class Sudoku { private:     int grid[9][9];     int solnGrid[9][9];     int guessNum[9];     int gridPos[81];     int difficultyLevel;     bool grid_status;   public:     Sudoku();     Sudoku(string, bool row_major = true);     void fillEmptyDiagonalBox(int);     void createSeed();     void printGrid();     bool solveGrid();     string getGrid();     void countSoln(int& number);     void genPuzzle();     bool verifyGridStatus();     void printSVG(string);       void printSolveSVG(string);     void printSolveDataSVG(vector<vector<int>> data,string);     void calculateDifficulty();     int  branchDifficultyScore();     vector<vector<int>> getArr();           };   // START: Get grid as string in row major order     /// <summary> /// /// </summary> /// <returns></returns> string Sudoku::getGrid() {     string s = "";     for (int row_num = 0; row_num < 9; ++row_num)     {         for (int col_num = 0; col_num < 9; ++col_num)         {             s = s + to_string(grid[row_num][col_num]);         }     }       return s; }   /// <summary> /// /// </summary> /// <returns></returns> vector<vector<int>> Sudoku::getArr() {     int gg[9][9] = {};     int row_num = 9;     int col_num = 9;     vector<vector<int>> data;    //二维vector     vector<int> data_row(col_num);   //存放每行数据的一维vecto       //for (int row_num = 0; row_num < 9; ++row_num)     //{     //    for (int col_num = 0; col_num < 9; ++col_num)     //    {     //       gg[row_num][col_num]= grid[row_num][col_num];     //    }     //}       for (int i = 0; i < row_num; i++)     {         for (int j = 0; j < col_num; j++)             data_row[j] = grid[i][j];// i + j;     //使用下标对vector赋值时要注意vector容量是否足够         data.push_back(data_row);     }         return data; } // END: Get grid as string in row major order     // START: Generate random number     /// <summary> /// /// </summary> /// <param name="maxLimit"></param> /// <returns></returns> int genRandNum(int maxLimit) {     return rand() % maxLimit; } // END: Generate random number     // START: Helper functions for solving grid     /// <summary> /// /// </summary> /// <param name="grid"></param> /// <param name="row"></param> /// <param name="col"></param> /// <returns></returns> bool FindUnassignedLocation(int grid[9][9], int& row, int& col) {     for (row = 0; row < 9; row++)     {         for (col = 0; col < 9; col++)         {             if (grid[row][col] == UNASSIGNED)                 return true;         }     }       return false; }     /// <summary> /// /// </summary> /// <param name="grid"></param> /// <param name="row"></param> /// <param name="num"></param> /// <returns></returns> bool UsedInRow(int grid[9][9], int row, int num) {     for (int col = 0; col < 9; col++)     {         if (grid[row][col] == num)             return true;     }       return false; }     /// <summary> /// /// </summary> /// <param name="grid"></param> /// <param name="col"></param> /// <param name="num"></param> /// <returns></returns> bool UsedInCol(int grid[9][9], int col, int num) {     for (int row = 0; row < 9; row++)     {         if (grid[row][col] == num)             return true;     }       return false; }   /// <summary> /// /// </summary> /// <param name="grid"></param> /// <param name="boxStartRow"></param> /// <param name="boxStartCol"></param> /// <param name="num"></param> /// <returns></returns> bool UsedInBox(int grid[9][9], int boxStartRow, int boxStartCol, int num) {     for (int row = 0; row < 3; row++)     {         for (int col = 0; col < 3; col++)         {             if (grid[row + boxStartRow][col + boxStartCol] == num)                 return true;         }     }       return false; }   /// <summary> /// /// </summary> /// <param name="grid"></param> /// <param name="row"></param> /// <param name="col"></param> /// <param name="num"></param> /// <returns></returns> bool isSafe(int grid[9][9], int row, int col, int num) {     return !UsedInRow(grid, row, num) && !UsedInCol(grid, col, num) && !UsedInBox(grid, row - row % 3, col - col % 3, num); } // END: Helper functions for solving grid     // START: Create seed grid   /// <summary> /// /// </summary> /// <param name="idx"></param> void Sudoku::fillEmptyDiagonalBox(int idx) {     int start = idx * 3;     random_shuffle(this->guessNum, (this->guessNum) + 9, genRandNum);     for (int i = 0; i < 3; ++i)     {         for (int j = 0; j < 3; ++j)         {             this->grid[start + i][start + j] = guessNum[i * 3 + j];         }     } }   /// <summary> /// /// </summary> void Sudoku::createSeed() {     /* Fill diagonal boxes to form:         x | . | .         . | x | .         . | . | x     */     this->fillEmptyDiagonalBox(0);     this->fillEmptyDiagonalBox(1);     this->fillEmptyDiagonalBox(2);       /* Fill the remaining blocks:         x | x | x         x | x | x         x | x | x     */     this->solveGrid(); // TODO: not truly random, but still good enough because we generate random diagonals.       // Saving the solution grid     for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             this->solnGrid[i][j] = this->grid[i][j];         }     } } // END: Create seed grid     // START: Intialising   /// <summary> /// /// </summary> Sudoku::Sudoku() {       // initialize difficulty level     this->difficultyLevel = 0;       // Randomly shuffling the array of removing grid positions     for (int i = 0; i < 81; i++)     {         this->gridPos[i] = i;     }       random_shuffle(this->gridPos, (this->gridPos) + 81, genRandNum);       // Randomly shuffling the guessing number array     for (int i = 0; i < 9; i++)     {         this->guessNum[i] = i + 1;     }       random_shuffle(this->guessNum, (this->guessNum) + 9, genRandNum);       // Initialising the grid     for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             this->grid[i][j] = 0;         }     }       grid_status = true; } // END: Initialising     // START: Custom Initialising with grid passed as argument     /// <summary> /// /// </summary> /// <param name="grid_str"></param> /// <param name="row_major"></param> Sudoku::Sudoku(string grid_str, bool row_major) {     if (grid_str.length() != 81)     {         grid_status = false;         return;     }       // First pass: Check if all cells are valid     for (int i = 0; i < 81; ++i)     {         int curr_num = grid_str[i] - '0';         if (!((curr_num == UNASSIGNED) || (curr_num > 0 && curr_num < 10)))         {             grid_status = false;             return;         }           if (row_major) grid[i / 9][i % 9] = curr_num;         else          grid[i % 9][i / 9] = curr_num;     }       // Second pass: Check if all columns are valid     for (int col_num = 0; col_num < 9; ++col_num)     {         bool nums[10] = { false };         for (int row_num = 0; row_num < 9; ++row_num)         {             int curr_num = grid[row_num][col_num];             if (curr_num != UNASSIGNED && nums[curr_num] == true)             {                 grid_status = false;                 return;             }             nums[curr_num] = true;         }     }       // Third pass: Check if all rows are valid     for (int row_num = 0; row_num < 9; ++row_num)     {         bool nums[10] = { false };         for (int col_num = 0; col_num < 9; ++col_num)         {             int curr_num = grid[row_num][col_num];             if (curr_num != UNASSIGNED && nums[curr_num] == true)             {                 grid_status = false;                 return;             }             nums[curr_num] = true;         }     }       // Fourth pass: Check if all blocks are valid             for (int block_num = 0; block_num < 9; ++block_num)     {         bool nums[10] = { false };         for (int cell_num = 0; cell_num < 9; ++cell_num)         {             int curr_num = grid[((int)(block_num / 3)) * 3 + (cell_num / 3)][((int)(block_num % 3)) * 3 + (cell_num % 3)];             if (curr_num != UNASSIGNED && nums[curr_num] == true)             {                 grid_status = false;                 return;             }             nums[curr_num] = true;         }     }       // Randomly shuffling the guessing number array     for (int i = 0; i < 9; i++)     {         this->guessNum[i] = i + 1;     }       random_shuffle(this->guessNum, (this->guessNum) + 9, genRandNum);       grid_status = true; } // END: Custom Initialising     // START: Verification status of the custom grid passed     /// <summary> /// /// </summary> /// <returns></returns> bool Sudoku::verifyGridStatus() {     return grid_status; } // END: Verification of the custom grid passed     // START: Printing the grid   /// <summary> /// /// </summary> void Sudoku::printGrid() {     for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             if (grid[i][j] == 0)                 cout << ".";             else                 cout << grid[i][j];             cout << "|";         }         cout << endl;     }       cout << "\nDifficulty of current sudoku(0 being easiest): " << this->difficultyLevel;     cout << endl; } // END: Printing the grid     // START: Modified Sudoku solver   /// <summary> /// /// </summary> /// <returns></returns> bool Sudoku::solveGrid() {     int row, col;       // If there is no unassigned location, we are done     if (!FindUnassignedLocation(this->grid, row, col))         return true; // success!       // Consider digits 1 to 9     for (int num = 0; num < 9; num++)     {         // if looks promising         if (isSafe(this->grid, row, col, this->guessNum[num]))         {             // make tentative assignment             this->grid[row][col] = this->guessNum[num];               // return, if success, yay!             if (solveGrid())                 return true;               // failure, unmake & try again             this->grid[row][col] = UNASSIGNED;         }     }       return false; // this triggers backtracking   } // END: Modified Sudoku Solver     // START: Check if the grid is uniquely solvable   /// <summary> /// /// </summary> /// <param name="number"></param> void Sudoku::countSoln(int& number) {     int row, col;       if (!FindUnassignedLocation(this->grid, row, col))     {         number++;         return;     }         for (int i = 0; i < 9 && number < 2; i++)     {         if (isSafe(this->grid, row, col, this->guessNum[i]))         {             this->grid[row][col] = this->guessNum[i];             countSoln(number);         }           this->grid[row][col] = UNASSIGNED;     }   } // END: Check if the grid is uniquely solvable     // START: Gneerate puzzle   /// <summary> /// /// </summary> void Sudoku::genPuzzle() {     for (int i = 0; i < 81; i++)     {         int x = (this->gridPos[i]) / 9;         int y = (this->gridPos[i]) % 9;         int temp = this->grid[x][y];         this->grid[x][y] = UNASSIGNED;           // If now more than 1 solution , replace the removed cell back.         int check = 0;         countSoln(check);         if (check != 1)         {             this->grid[x][y] = temp;         }     } } // END: Generate puzzle     // START: Printing into SVG file   /// <summary> /// /// </summary> /// <param name="path"></param> void Sudoku::printSVG(string path = "") {     string fileName ="svgHead.txt";     ifstream file1(fileName.c_str());     stringstream svgHead;     svgHead << file1.rdbuf();     string dd=svgHead.str();     //std::cout<<svgHead.str() << endl;     file1.close();     string svg="puzzle.svg";     if (!path.empty())         svg = path;              ofstream outFile(svg); // std::ios::binary     outFile << svgHead.rdbuf();       for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             cout << grid[i][j]<< endl;             if (this->grid[i][j] != 0)             {                 int x = 50 * j + 16;                 int y = 50 * i + 35;                   stringstream text;                 text << "<text x=\"" << x << "\" y=\"" << y << "\" style=\"font-weight:bold\" font-size=\"30px\">" << this->grid[i][j] << "</text>\n";                   outFile << text.rdbuf();             }         }     }       outFile << "<text x=\"50\" y=\"500\" style=\"font-weight:bold\" font-size=\"15px\">Difficulty Level (0 being easiest): " << this->difficultyLevel << "</text>\n";     outFile << "</svg>";     outFile.close();         }   /// <summary> /// /// </summary> /// <param name="path"></param> void Sudoku::printSolveSVG(string path = "") {     string fileName = "svgHead.txt";     ifstream file1(fileName.c_str());     stringstream svgHead;     svgHead << file1.rdbuf();       std::cout << svgHead.str() << endl;       file1.close();       string svg = "SolvePuzzle.svg";     if (!path.empty())         svg = path;       ofstream outFile(svg); // std::ios::binary     outFile << svgHead.rdbuf();       for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             cout << grid[i][j] << endl;             if (this->grid[i][j] != 0)             {                 int x = 50 * j + 16;                 int y = 50 * i + 35;                   stringstream text;                 text << "<text x=\"" << x << "\" y=\"" << y << "\" style=\"font-weight:bold\" font-size=\"30px\">" << this->grid[i][j] << "</text>\n";                   outFile << text.rdbuf();             }         }     }       outFile << "<text x=\"50\" y=\"500\" style=\"font-weight:bold\" font-size=\"15px\">Sudoku solver Difficulty Level (0 being easiest): " << this->difficultyLevel << "</text>\n";     outFile << "</svg>";     outFile.close();   }   /// <summary> /// /// </summary> /// <param name="data"></param> /// <param name="path"></param> void Sudoku::printSolveDataSVG(vector<vector<int>> data, string path = "") {       string fileName = "svgHead.txt";     ifstream file1(fileName.c_str());     stringstream svgHead;           svgHead << file1.rdbuf();       std::cout << svgHead.str() << endl;       file1.close();       string svg = "puzzle.svg";     if (！path.empty())         svg = path;       ofstream outFile(svg); // std::ios::binary     outFile << svgHead.rdbuf();       for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             cout << data[i][j] << endl;             if (data[i][j] != 0)             {                 int x = 50 * j + 16;                 int y = 50 * i + 35;                   stringstream text;                 text << "<text x=\"" << x << "\" y=\"" << y << "\" style=\"font-weight:bold\" font-size=\"30px\">" << data[i][j] << "</text>\n";                   outFile << text.rdbuf();             }         }     }       outFile << "<text x=\"50\" y=\"500\" style=\"font-weight:bold\" font-size=\"15px\">Difficulty Level (0 being easiest): " << this->difficultyLevel << "</text>\n";     outFile << "</svg>";     outFile.close();   } // END: Printing into SVG file     // START: Calculate branch difficulty score   /// <summary> /// /// </summary> /// <returns></returns> int Sudoku::branchDifficultyScore() {     int emptyPositions = -1;     int tempGrid[9][9];     int sum = 0;       for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             tempGrid[i][j] = this->grid[i][j];         }     }       while (emptyPositions != 0)     {         vector<vector<int> > empty;           for (int i = 0; i < 81; i++)         {             if (tempGrid[(int)(i / 9)][(int)(i % 9)] == 0)             {                 vector<int> temp;                 temp.push_back(i);                   for (int num = 1; num <= 9; num++)                 {                     if (isSafe(tempGrid, i / 9, i % 9, num))                     {                         temp.push_back(num);                     }                 }                   empty.push_back(temp);             }           }           if (empty.size() == 0)         {             cout << "Hello: " << sum << endl;             return sum;         }           int minIndex = 0;           int check = empty.size();         for (int i = 0; i < check; i++)         {             if (empty[i].size() < empty[minIndex].size())                 minIndex = i;         }           int branchFactor = empty[minIndex].size();         int rowIndex = empty[minIndex][0] / 9;         int colIndex = empty[minIndex][0] % 9;           tempGrid[rowIndex][colIndex] = this->solnGrid[rowIndex][colIndex];         sum = sum + ((branchFactor - 2) * (branchFactor - 2));           emptyPositions = empty.size() - 1;     }       return sum;   } // END: Finish branch difficulty score     // START: Calculate difficulty level of current grid   /// <summary> /// /// </summary> void Sudoku::calculateDifficulty() {     int B = branchDifficultyScore();     int emptyCells = 0;       for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             if (this->grid[i][j] == 0)                 emptyCells++;         }     }       this->difficultyLevel = B * 100 + emptyCells; } // END: calculating difficulty level   /// <summary> /// /// </summary> /// <param name="argc"></param> /// <param name="argv"></param> /// <returns></returns> int main(int argc, char const* argv[]) {     std::cout << "Hello World!涂聚文！geovindu,Geovin Du\n";       /*     int grid[9][9] = {     {0, 0, 0, 0, 0, 9, 0, 5, 0},     {0, 0, 8, 0, 0, 0, 0, 7, 9},     {0, 0, 1, 5, 0, 2, 0, 0, 0},     {3, 0, 0, 0, 1, 0, 5, 0, 7},     {2, 0, 4, 0, 0, 7, 0, 0, 0},     {0, 0, 0, 6, 0, 0, 2, 0, 0},     {0, 0, 0, 0, 7, 0, 3, 4, 0},     {1, 0, 0, 0, 0, 0, 0, 0, 0},     {0, 3, 0, 0, 5, 6, 0, 0, 0}     };     string fileName = "svgHead.txt";     ifstream file1(fileName.c_str());     stringstream svgHead;     svgHead << file1.rdbuf();       std::cout << svgHead.str() << endl;       ofstream outFile("puzzle.svg"); // std::ios::binary     outFile << svgHead.rdbuf();           for (int i = 0; i < 9; i++)     {         for (int j = 0; j < 9; j++)         {             if (grid[i][j] != 0)             {                 int x = 50 * j + 16;                 int y = 50 * i + 35;                   stringstream text;                 text << "<text x=\"" << x << "\" y=\"" << y << "\" style=\"font-weight:bold\" font-size=\"30px\">" << grid[i][j] << "</text>\n";                   outFile << text.rdbuf();             }         }     }       outFile << "<text x=\"50\" y=\"500\" style=\"font-weight:bold\" font-size=\"15px\">Difficulty Level (0 being easiest): " << 3 << "</text>\n";     outFile << "</svg>";     outFile.close();     */       // Initialising seed for random number generation     srand(time(NULL));       // Creating an instance of Sudoku     Sudoku* puzzle = new Sudoku();       // Creating a seed for puzzle generation     puzzle->createSeed();       // Generating the puzzle     puzzle->genPuzzle();       // Calculating difficulty of puzzle     puzzle->calculateDifficulty();       // testing by printing the grid     puzzle->printGrid();       // Printing the grid into SVG file     string rem = "sudokuGen";     string path = argv[0];     path = path.substr(0, path.size() - rem.size());     // puzzle->printSVG(path);     puzzle->printSVG("puzzle.svg");// 生成当前问题图     cout << "The above sudoku puzzle has been stored in puzzles.svg in current folder\n";       puzzle->solveGrid(); //解决方案     puzzle->printGrid();//打印解决方案     puzzle->printSVG("solvepuzzle.svg");// 生成当前答案问题图 没有生成     cout << "The above sudoku puzzle has been sloved in solvepuzzle.svg in current folder\n";         //puzzle->printSolveDataSVG(data, "sovepuzzle.svg");     //puzzle->printSolveSVG("sovepuzzle.svg");           // freeing the memory     delete puzzle;     system("pause");     return 0; }   // 运行程序: Ctrl + F5 或调试 >“开始执行(不调试)”菜单 // 调试程序: F5 或调试 >“开始调试”菜单   // 入门使用技巧: //   1. 使用解决方案资源管理器窗口添加/管理文件 //   2. 使用团队资源管理器窗口连接到源代码管理 //   3. 使用输出窗口查看生成输出和其他消息 //   4. 使用错误列表窗口查看错误 //   5. 转到“项目”>“添加新项”以创建新的代码文件，或转到“项目”>“添加现有项”以将现有代码文件添加到项目 //   6. 将来，若要再次打开此项目，请转到“文件”>“打开”>“项目”并选择 .sln 文件

　

输出：　

 

 

 

 

 

from:

https://github.com/robatron/sudoku.js js
https://github.com/huaminghuangtw/Web-Sudoku-Puzzle-Game js
https://github.com/t-dillon/tdoku c++
https://github.com/MorvanZhou/sudoku python
https://github.com/RutledgePaulV/sudoku-generator python
https://github.com/JoeKarlsson/python-sudoku-generator-solver python
https://github.com/BurnYourPc/Sudoku python
https://github.com/ArjArav98/Sudoku-Solver c++
https://github.com/flyingpeakock/Console_sudoku c++
https://github.com/sfuhrm/sudoku java
https://github.com/basil2style/Sudoku-Pattern-Generator-App java
https://github.com/Yanndroid/Sudoku java
https://github.com/firateski/SudokuLibrary C#
https://github.com/firateski/SudokuGameWindowsForms C#
https://github.com/nayanbunny/Sudoku-CSharp C#
https://github.com/ashplaysbass97/Sudoku C#
https://github.com/Maxhebda/SudokuMaxSolver C#
https://github.com/ilyakom/Sudoku c#
https://github.com/topics/sudoku-generator