1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64
|
public class Sudoku{
static int grille[][]={{0,0,0,8,0,2,0,0,1},
{0,7,8,0,3,0,0,0,2},
{0,1,0,5,0,0,0,0,0},
{0,0,3,2,0,0,6,5,0},
{0,2,5,0,0,0,4,5,0},
{0,6,9,0,0,4,2,0,0},
{0,0,0,0,0,7,0,9,0},
{8,0,0,0,2,0,1,7,0},
{9,0,0,4,0,3,0,0,0},
};
static String[][] indices=new String[10][10];
public static void main(String[] args){
int x,y;
indicer();
for(x=0;x<9;x++)
for(y=0;y<9;y++)
if(grille[x][y]==0)
System.out.println("colonne "+x+" ligne "+y+" indices "+indices[x][y]);
}
public static void indicer(){
int i,j,k;
String s=new String();
for(i=0;i<9;i++)
for(j=0;j<9;j++){
indices[i][j]="";
for(k=1;k<10;k++){
if(absent_ligne(k,i)||absent_colonne(k,j)||absent_region(k,i/3+3*(j/3))){
s=s.valueOf(k);
indices[i][j]=indices[i][j]+s;
}
if(indices[i][j].length()==1){
grille[i][j]=k;
j=8;
i=-1;
break;
}
}
}
}
public static boolean absent_ligne(int nb,int ligne){
int i;
for(i=0;i<9;i++)
if(grille[i][ligne]==nb)
return false;
return true;
}
public static boolean absent_colonne(int nb,int colonne){
int i;
for(i=0;i<9;i++)
if(grille[colonne][i]==nb)
return false;
return true;
}
public static boolean absent_region(int nb,int region){
int i,j;
for(i=0;i<3;i++)
for(j=0;j<3;j++)
if(grille[(region%3)*3+i][(region/3)*3+j]==nb)
return false;
return true;
}
} |
Partager