算法:
1. 隨機填充中間的九宮格
2. 通過交換行、列,填充中間的九宮格的上、下、左、右四個九宮格
3. 同樣方式填充四個角上的九宮格
4. 根據難度隨機挖去數
C++源代碼如下:
#include <ctime> #include <cstring> #include <iostream> #include <vector> #include <algorithm> using namespace std; const int N = 9; vector<int> src; int table[N][N]; void ouput() { for (int i = 0; i < 9; ++i) { for (int j = 0; j < 9; ++j) { cout << table[i][j] << " "; } cout << endl; } } // 初始化中間的九宮格 void centerInit() { for (int i = 0; i < N; ++i) src.push_back(i + 1); random_shuffle(src.begin(), src.end()); // 隨機化序列 int k = 0; for (int i = 3; i < 6; ++i) for (int j = 3; j < 6; ++j) table[i][j] = src[k++]; } // 由中間的九宮格交叉變換,初始化上下左右四個九宮格 void crossInit() { for (int i = 3; i < 6; ++i) { int l = 0; for (int j = 3; j < 6; ++j) { if (i == 3) { table[i + 1][l] = table[i][j]; table[i + 2][l + 6] = table[i][j]; ++l; } else if (i == 4) { table[i + 1][l] = table[i][j]; table[i - 1][l + 6] = table[i][j]; ++l; } else if (i == 5) { table[i - 2][l] = table[i][j]; table[i - 1][l + 6] = table[i][j]; ++l; } } } for (int j = 3; j < 6; ++j) { int l = 0; for (int i = 3; i < 6; ++i) { if (j == 3) { table[l][j + 1] = table[i][j]; table[l + 6][j + 2] = table[i][j]; ++l; } else if (j == 4) { table[l][j + 1] = table[i][j]; table[l + 6][j - 1] = table[i][j]; ++l; } else if (j == 5) { table[l][j - 2] = table[i][j]; table[l + 6][j - 1] = table[i][j]; ++l; } } } } // 初始化四個角上的四個九宮格 void cornerInit() { for (int i = 0; i < 3; ++i) { int l = 0; for (int j = 3; j < 6; ++j) { if (i == 0) { table[i + 1][l] = table[i][j]; table[i + 2][l + 6] = table[i][j]; ++l; } else if (i == 1) { table[i + 1][l] = table[i][j]; table[i - 1][l + 6] = table[i][j]; ++l; } else if (i == 2) { table[i - 2][l] = table[i][j]; table[i - 1][l + 6] = table[i][j]; ++l; } } } for (int i = 6; i < 9; ++i) { int l = 0; for (int j = 3; j < 6; ++j) { if (i == 6) { table[i + 1][l] = table[i][j]; table[i + 2][l + 6] = table[i][j]; ++l; } else if (i == 7) { table[i + 1][l] = table[i][j]; table[i - 1][l + 6] = table[i][j]; ++l; } else if (i == 8) { table[i - 2][l] = table[i][j]; table[i - 1][l + 6] = table[i][j]; ++l; } } } } // 根據設定的難度隨機挖數 void generateSudoku(int difficulty) { difficulty *= 20; while (difficulty--) { table[rand() % 9][rand() % 9] = 0; } } // 初始化數獨 // 先隨機生成中間的九宮格,再通過交叉生成上下左右四個九宮格,
// 最后通過交叉生成四個角上的九宮格 /* 交叉順序如下: 9 7 8 3 1 2 6 4 5 3 1 2 6 4 5 9 7 8 6 4 5 9 7 8 3 1 2 7 8 9 1 2 3 4 5 6 1 2 3 4 5 6 7 8 9 4 5 6 7 8 9 1 2 3 8 9 7 2 3 1 5 6 4 2 3 1 5 6 4 8 9 7 5 6 4 8 9 7 2 3 1 */ void init(int difficulty) { srand(time(NULL)); memset(table, 0, sizeof(table)); centerInit(); crossInit(); cornerInit(); generateSudoku(difficulty); } int main() { int d; while (true) { cout << "Please select the difficulty(1~4), input 0 to exit: "; cin >> d; if (d == 0) { break; } init(d); ouput(); } return 0; }