解数独的算法

    这应该是DFS的优化版吧------虽然在内存上相当于没优化。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct Unit
{
    int Amount;
    int Data;
    int vis[10];
    Unit(){
        Amount=0;
        Data=-1;
        memset(vis,0,sizeof(vis));
    }
};
Unit Map[9][9];
struct Point
{
    int x,y;
    friend bool operator<(const Point&L,const Point&R){
        return Map[L.x][L.y].Amount>Map[R.x][R.y].Amount;
    }
    Point(int _x,int _y){x=_x;y=_y;}
    Point(){}
};

Point SolveList[81];
int SolveAmount=0;
bool Push(int x,int y,int iData)
{
    if(!iData){
        SolveList[SolveAmount].y=y;
        SolveList[SolveAmount++].x=x;
        return true;
    }
    if(Map[x][y].vis[iData])return false;
    Map[x][y].Data=iData;
    int i,j;
    for(i=0;i!=9;i++){
        if(!Map[x][i].vis[iData]){
            Map[x][i].Amount++;
        }
        Map[x][i].vis[iData]++;
        if(!Map[i][y].vis[iData]){
            Map[i][y].Amount++;
        }
        Map[i][y].vis[iData]++;
    }
    for(i=0;i!=3;i++){
        for(j=0;j!=3;j++){
            if(!Map[(x/3)*3+i][(y/3)*3+j].vis[iData]){
                Map[(x/3)*3+i][(y/3)*3+j].Amount++;
            }
            Map[(x/3)*3+i][(y/3)*3+j].vis[iData]++;
        }
    }
    return true;
}
void Pop(int x,int y,int iData)
{
    Map[x][y].Data=-1;
    int i,j;
    for(i=0;i!=9;i++){
        if(Map[x][i].vis[iData]){
            Map[x][i].Amount--;
        }
        Map[x][i].vis[iData]--;
        if(Map[i][y].vis[iData]){
            Map[i][y].Amount--;
        }
        Map[i][y].vis[iData]--;
    }
    for(i=0;i!=3;i++){
        for(j=0;j!=3;j++){
            if(Map[(x/3)*3+i][(y/3)*3+j].vis[iData]){
                Map[(x/3)*3+i][(y/3)*3+j].Amount--;
            }
            Map[(x/3)*3+i][(y/3)*3+j].vis[iData]--;
        }
    }
}
void Input()
{
    int iLoop=-1,iUserInput;
    while(++iLoop!=81){
        scanf("%d",&iUserInput);
        Push(iLoop/9,iLoop%9,iUserInput);
    }
}
bool DFS_Map(int SolveNumber=0)
{
    if(SolveNumber==SolveAmount)return true;
    //printf("Searching....(%d,%d)\n",SolveList[SolveNumber].x,SolveList[SolveNumber].y);
    for(int i=1;i!=10;i++){
        if((!Map[SolveList[SolveNumber].x][SolveList[SolveNumber].y].vis[i])&&Push(SolveList[SolveNumber].x,SolveList[SolveNumber].y,i)){
            if(DFS_Map(SolveNumber+1))return true;
            else Pop(SolveList[SolveNumber].x,SolveList[SolveNumber].y,i);
           // printf("Disappointed.00\n");
        }
    }
    return false;
}
void Print()
{
    int i,j;
    for(i=0;i!=9;i++)
        for(j=0;j!=9;j++){
            printf("%d%c",Map[i][j].Data,(j+1)%9?' ':'\n');
        }
}
int main()
{
    Input();
    sort(SolveList,SolveList+SolveAmount);
    printf("%d\n-----------------\n",DFS_Map(0)?1:0);
    Print();
    printf("-----------------\n");
}