回朔练习

bool IsOK(int I, int J, int k, int[,] aa)
    {

        for (int i = 0; i < 9; i++)
        {
            if (aa[i, J] == k)
                return false;
        }
        for (int j = 0; j < 9; j++)
        {
            if (aa[I, j] == k)
                return false;
        }
        int x, y = 0;
        for (int i = 0; i < 3; i++)
        {
            for (int j = 0; j < 3; j++)
            {
                x = i * 3;
                y = j * 3;
                if(I>=x&&I<=x+2&&J>=y&&J<=y+2)
                {
                    return IsMM( x, y, x + 2, y + 2, k, aa);
                }

            }
        }

        return true;
    }

    bool IsMM(int I0,int J0,int Im,int Jm,int k,int[,] aa)
    {
        for (int i = I0; i <= Im; i++)
        {
            for (int j = J0; j<=Jm; j++)
            {
                if (aa[i, j] == k)
                    return false;
            }
        }
        return true;
    }
    int selectA(int I, int J, int k, int[,] aa)
    {
        for (int c = k; c <= 9; c++)
        {
            if (IsOK(I, J, c, aa))
            {
                return c;
            }
        }
        return 0;
    }
    int backA(ref int I, ref int J, int[,] aa)
    {
        int c = 9;
        while (c == 9)
        {
            if (I <= 0 && J <= 0)
            {
                return 0;
            }
            J--;
            if (J < 0) { J = 8; I--; }
            c = aa[I, J];
            aa[I, J] = -1;
        }
        return c;
    }
    int FillA()
    {
        int[,] aa = new int[9, 9];
        int i = 0, j = 0, c = 0, cnt = 0;
        while (true)
        {
            c = selectA(i, j, c + 1, aa);
            if (c == 0)
            {
                c = backA(ref i, ref j, aa);
                if (c == 0)
                {
                    return cnt;
                }
            }
            else
            {
                aa[i, j] = c;

                j++;
                if (j == 9 && i != 8)
                {
                    j = 0;
                    i++;
                }
                if (j == 9 && i == 8)
                {
                    cnt++;

                      Printf(aa, 9);
                     // return cnt;

                    //j--;
                 //   fll(aa);
                    c = backA(ref i, ref j, aa);
                   if (cnt == 100) return cnt;
                    //  return cnt;
                    //  j--;
                    //  c = back(ref i, ref j, n, aa, I, J, mI, mJ);
                }
                else
                {
                    c = 0;
                }
            }
        }
    }

  void Printf(int[,] aa,int n)
    {
        HtmlTable _dt = new HtmlTable();
        HtmlTableRow _drt = new HtmlTableRow();
        HtmlTableCell _tdt = new HtmlTableCell();
        _tdt.BgColor = "red";
        _tdt.InnerText = m.ToString();
        m++;
        _drt.Cells.Add(_tdt);
        _dt.Rows.Add(_drt);

        for (int i = 0; i < n; i++)
        {
            HtmlTableRow _dr = new HtmlTableRow();
            for (int j = 0; j < n; j++)
            {
                HtmlTableCell _td = new HtmlTableCell();
                _td.InnerText = aa[i, j].ToString();
                _dr.Cells.Add(_td);
            }
            _dt.Rows.Add(_dr);
        }
        Page.Controls.Add(_dt);
    }