package sudoku;
public class solver2 extends psolver
{
    public boolean isRecursive()
    {
        return false;
    }
    public String toString()
    {
        return "Solver 2";
    }
    public void solveit(puzzle p)
    {
        cell cs[];
        cell c;
        for(int i=0;i<9;i++)
        {
            for(int j=0;j<9;j++)
            {
                c=p.getcell(i,j);
                if(c.issolved())
                {
                    continue;
                }
                // System.out.println(c.postoString() + " : Performing row uniqueness test");
                cs=p.getrow(i,j);
                checkuniquepos(cs,c);
                if(p.interrupted())
                {
                    return;
                }
                if(p.issolved())
                {
                    return;
                }
                // System.out.println(c.postoString() + " : Performing col uniqueness test");
                cs=p.getcol(i,j);
                checkuniquepos(cs,c);
                if(p.interrupted())
                {
                    return;
                }
                if(p.issolved())
                {
                    return;
                }
                // System.out.println(c.postoString() + " : Performing sqr uniqueness test");
                cs=p.getsquare(i,j);
                checkuniquepos(cs,c);
                if(p.interrupted())
                {
                    return;
                }
                if(p.issolved())
                {
                    return;
                }
            }
        }
    };

    private void checkuniquepos(cell cs[],cell c)
    {
        if(c.isdone())
        {
            return;
        }
        for(int val=1;val<10;val++)
        {
            boolean notunique;
            int i;
            if(!c.haspos(val))
            {
                continue;
            }
            for(notunique=false,i=0;i<9;i++)
            {
                if(cs[i]==c)
                {
                    continue;
                }
                if(cs[i].haspos(val))
                {
                    notunique=true;
                    break;
                }
            }
            if(!notunique)
            {
                // System.out.println(c.postoString() + " Value " + val + " is unique in this domaine");
                c.setsolved(val);
            }
        }
    }
};