软件工程—个人项目（四）最终总结

 1 void BuildMove(int N)
 2 {
 3     char rule1[10][5] = { "036","063" };
 4     char rule2[10][5] = { "258","285","528","582","825","852" };
 5     char rule3[10][5] = { "147","174","417","471","714","741" }; //变换规则
 6     while (1)
 7     {
 8         if (next_permutation(origin, origin + 8))
 9         {
10             origin[8] = 8;
11             for (int i = 0; i < 2; ++i)
12             {
13                 for (int j = 0; j < 6; ++j)
14                 {
15                     for (int t = 0; t < 6; ++t)
16                     {
17                         BuildSudoku(rule1[i], rule2[j], rule3[t]);
18                         countnum++;
19                         if (countnum == N)
20                             return;
21                     }
22                 }
23             }
24         }
25         else
26             break;
27     }
28 }

void ChangeMap(char *rule) //进行变换
{
    for (int i = 0; i < 3; ++i)
    {
        output[datacount++] = origin[(8 + rule[i] - ‘0‘) % 9] + ‘0‘;
        for (int j = 1; j < 17; ++j)
        {
            output[datacount++] = ‘ ‘;
            j++;
            output[datacount++] = origin[((16 - j) / 2 + rule[i] - ‘0‘) % 9] + ‘0‘;
        }
        output[datacount++] = ‘\n‘;
    }
}

void TraceBack(int n)
{
    if (suc == 1)
        return;

    if (n > 80)  //代表解完当前数独
    {
        prt();
        suc = 1;
        return;
    }

    if (res[n / 9][n % 9] != 0)   //当前格子有数字，跳到下一格
    {
        TraceBack(n + 1);
    }
    else
    {
        for (int i = 1; i <= 9; i++)
        {
            int f = CheckCanVis(n / 9, n % 9, i);

            if (f == 0)
                continue;
            else
            {
                res[n / 9][n % 9] = i;
                SetVis(n / 9, n % 9, res[n / 9][n % 9]);

                TraceBack(n + 1);

                ResetVis(n / 9, n % 9, res[n / 9][n % 9]);
                res[n / 9][n % 9] = 0;
            }
        }
    }
}