数独的一种实现方式

 

 

生成一个数独的解：

 

定义： 一个 3*3 的整体我称之为box, 那一个9*9 的数独盘里就有 9 个 box，编号依次为1-9：

	Box 1			Box 2			Box 3
	Box 4			Box 5			Box 6
	Box 7			Box 8			Box 9

 

 

观察得到的事实：

 

1.  1-9每个数字 在每个box 里也填一次，每行也出现一次，每列也出现一次，于根据这个规则，我们可以把 这个数独盘里的所有1都一次填下去：

 

1
			1
						1
	1
				1
							1
		1
					1
								1

 

2. 接着，我们可以在1 的下面把 2也填下去：

 

1						2
2			1				Box 3
			2			1
	1						2
	2			1
				2			1
		1						2
		2			1
					2			1

注意： 填的规则是这样， 如果 1 的正下方有一个空格，并且该空格与1在同一个box内，则填入2， 否则，在1的正上方隔两格的地方填入2， 如上图的Box 3 里的效果所示。

 

3. 同理，我们以同样的规则填入 3 ，4：

1			3			2
2			1			3
3			2			1
	1			3			2
	2			1			3
	3			2			1
		1			3			2
		2			1			3
		3			2			1

 

1	4		3			2
2			1	4		3
3			2			1	4
	1	4		3			2
	2			1	4		3
	3			2			1	4
4		1			3			2
		2	4		1			3
		3			2	4		1

 

 

。。。

 

5. 如果每次都按 1 – 9 顺序填入数独盘，则每次都会得到同样的结果，但作为程序设计人，我们可以打乱 1- 9 的顺序填入数独盘，这样就可以得到不同的效果

 

6. 待我们填入了所有的9个数，我们就可以将i行（列）与j行（列）(其 0<|i - j|<3 )所有元素进行交换，交换后的数独排列仍会是一个数独的解

 

 

实现的java 代码：

box.java

package game; // 3*3 box where 9 numbers (1-9) are arranged according to sodoku rules public class Box { private Integer[][] blank = new Integer[3][3]; public Box() { for(int i=0; i<3; ++i) for(int j=0; j<3; ++j) blank[i][j] = 0; } public Integer get(int row, int col) { checkInput(row,col); return blank[row-1][col-1]; } // n = 1 : blank[0][0] // n = 2 : blank[0][1] // n = 3 : blank[0][2] // n = 4 : blank[0][1] // ... public Integer get(int n) { // make sure n ranges from 1 to 9 checkValue(n); //checkInput(row,col); int r = n % 3; int c = ceiling((double)(n) / 3.0); return blank[r-1][c-1]; } public void set(int n, Integer value) { //make sure n ranges from 1 to 9 checkValue(n); checkValue(value); //checkInput(row,col); int r = (n % 3 == 0)? 3: n%3 ; int c = ceiling((double)(n) / 3.0); blank[r-1][c-1] = value; } public void set(int row, int col, Integer value) { checkInput(row,col); checkValue(value); blank[row-1][col-1]= value; } public void swapRow(int r1, int r2) { checkInput(r1,r2); if(r1 == r2) return ; for(int i=0; i<3; ++i) { //swap 2 elements Integer tmp = blank[r1-1][i]; blank[r1-1][i] = blank[r2-1][i]; blank[r2-1][i] = tmp; } } public void swapCol(int c1, int c2) { checkInput(c1,c2); if(c1 == c2) return ; for(int i=0; i<3; ++i) { //swap 2 elements Integer tmp = blank[i][c1-1]; blank[i][c1-1] = blank[i][c2-1]; blank[i][c2-1] = tmp; } } public int ceiling(Double d) { Double r = d - d.intValue(); if(r > 0) return d.intValue()+1; else return d.intValue(); } public void print() { if(blank != null) { for(int i=0; i<3; ++i) { for(int j=0; j<3; ++j) System.out.print(blank[i][j]+" "); System.out.println(); } } } private void checkInput(int row, int col) { if(row > 3 || row <1) { throw new IllegalArgumentException("row must be positive & less than 3"); } if(col > 3 || col <1) { throw new IllegalArgumentException("col must be positive & less than 3"); } } private void checkValue(Integer value) { if(value > 9|| value <1) { throw new IllegalArgumentException("value must range from 1 to 9"); } } /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Box b = new Box(); for(int i=1; i<=9; i++) b.set(i, i); //b.set(7, 8); b.swapCol(1, 3); b.print(); // Double d = 1.75; // Double r = d - d.intValue(); // System.out.print(r); } }  

 

Board.java

package game; import java.util.ArrayList; import util.PermutationGenerator; import util.RandomGenerator; // 9*9 board where 81 numbers (1-9) are arranged according to sodoku rules // Assume the coordinate of the left-bottom element is (9,1), and that of //right-top element is (1,9) public class Board { private Box[] boxes = new Box[9]; public Board() { //initialize the boxes for(int i =0; i<9; i++) { boxes[i] = new Box(); } } public void generateSodoku() { //get permutaion list ArrayList<Integer[]> list = PermutationGenerator.getPermutationInt(); //pick a permutation randomly int ranInt = RandomGenerator.generateRandomInt(list.size()); Integer[] p = list.get(ranInt); //fill the board with such a permutation int cnt = 0; for(Integer i: p) { ++cnt; //fill the boxes for(int boxNum=0; boxNum<9; ++boxNum) { boxes[boxNum].set(cal(cnt,boxNum), i); } } check(cnt==9,"Abnormal situation: count should be 9"); } private int cal(int cnt, int boxNum) { int k = (cnt+boxNum-1)/3; int ret = (cnt+boxNum -1)%3 +1 + 3*k; ret = (ret-1)%9 + 1; check(ret>=1 && ret<=9,"cal(...) gets the wrong result./n"); return ret; } public Integer get(int boardRow, int boardCol) { checkInput(boardRow,boardCol); int boxRow = (boardRow % 3 ==0) ? 3: boardRow % 3 ; int boxCol = (boardCol % 3 ==0) ? 3: boardCol % 3 ; int boxNum = getBoxNum(boardRow,boardCol); return boxes[boxNum].get(boxRow, boxCol); } public void set(int boardRow, int boardCol, Integer value) { checkInput(boardRow,boardCol); checkValue(value); int boxRow = (boardRow % 3 ==0) ? 3: boardRow % 3 ; int boxCol = (boardCol % 3 ==0) ? 3: boardCol % 3 ; int boxNum = getBoxNum(boardRow,boardCol); boxes[boxNum].set(boxRow, boxCol,value); } public void swapRow(int r1, int r2) { checkInput(r1,r2); //make sure the difference between r1 and r2 is less than 3 if(Math.abs(r1-r2) >= 3) { throw new IllegalArgumentException("Difference between r1 and r2 must be less than 3"); } if(r1 == r2) // no need to swapRow return; int minBoxNum = ((r1-1)/3)*3 ; check(minBoxNum ==0 || minBoxNum ==3 || minBoxNum == 6, "minBoxNum has wrong value./n"); int boxRow = (r1-1) % 3 + 1; int boxCol = (r2-1) % 3 + 1; for(int i=0; i<3; ++i) { boxes[minBoxNum+i].swapRow(boxRow, boxCol); } return; } public void swapCol(int c1, int c2) { checkInput(c1,c2); //make sure the difference between c1 and c2 is less than 3 if(Math.abs(c1-c2) >= 3) { throw new IllegalArgumentException("Difference between c1 and c2 must be less than 3"); } if(c1 == c2) // no need to swapRow return; int minBoxNum = (c1-1) / 3; check(minBoxNum ==0 || minBoxNum ==1 || minBoxNum == 2, "minBoxNum has wrong value./n"); int boxRow = (c1-1) % 3 + 1; int boxCol = (c2-1) % 3 + 1; for(int i=0; i<3; ++i) { boxes[minBoxNum+i*3].swapRow(boxRow, boxCol); } return; } private void checkInput(int boardRow, int boardCol) { if(boardRow > 9|| boardRow <1) { throw new IllegalArgumentException("boardRow must be positive & less than 10"); } if(boardCol > 9 || boardCol <1) { throw new IllegalArgumentException("boardCol must be positive & less than 10"); } } private void check(boolean condition, String ErrMsg) { if(!condition) throw new RuntimeException(ErrMsg); } private Integer getBoxNum(int boardRow, int boardCol) { checkInput(boardRow,boardCol); Integer boxNum = 0; int tmp = 0; if(boardRow <= 3 && boardRow >= 1) tmp = 1; else if(boardRow <= 6 && boardRow >= 4) tmp =4 ; else tmp =7 ; if(boardCol % 3 == 0) boxNum = boardCol/3 + tmp - 1 -1; else boxNum = boardCol/3 + tmp -1; return boxNum; } private void checkValue(Integer value) { if(value > 9|| value <1) { throw new IllegalArgumentException("value must range from 1 to 9"); } } public void print() { for(int i=1; i<=9; i++) { for(int j=1;j<=9; j++) { System.out.print(get(i,j)+" "); } System.out.println(); } } /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Board board = new Board(); // board.set(1, 7, 3); // board.set(2, 8, 5); // board.swapCol(7, 8); board.generateSodoku(); board.print(); } }  

 

package util; import java.util.*; public class PermutationGenerator { //generate permutation with integers 1 - 9 public static ArrayList<String> getPermutationString() { ArrayList<String> ret = new ArrayList<String>(); for(int i1 = 1;i1<10;++i1) { for(int i2 = 1;i2<10;++i2) { if(i1==i2) continue; for(int i3 = 1;i3<10;++i3) { if(i2==i3 || i1 == i3) continue; for(int i4 = 1;i4<10;++i4) { if(i1==i4 || i2 == i4 || i3 == i4) continue; for(int i5 = 1;i5<10;++i5) { if(i1==i5 || i2 == i5 || i3 == i5 || i4 == i5) continue; for(int i6 = 1;i6<10;++i6) { if(i1==i6 || i2 == i6 || i3 == i6 || i4 == i6 ||i5 == i6) continue; for(int i7 = 1;i7<10;++i7) { if(i1==i7 || i2 == i7 || i3 == i7 || i4 == i7 ||i5 == i7 || i6 == i7) continue; for(int i8 = 1;i8<10;++i8) { if(i1==i8 || i2 == i8 || i3 == i8 || i4 == i8 ||i5 == i8 || i6 == i8 || i7 == i8) continue; for(int i9 = 1;i9<10;++i9) { if(i1==i9 || i2 == i9 || i3 == i9 || i4 == i9 ||i5 == i9 || i6 == i9 || i7 == i9 || i8 == i9) continue; else { String str =""; str += (iTos(i1)+",") ; str += (iTos(i2)+",") ; str += (iTos(i3)+",") ; str += (iTos(i4)+",") ; str += (iTos(i5)+",") ; str += (iTos(i6)+",") ; str += (iTos(i7)+",") ; str += (iTos(i8)+",") ; str += (iTos(i9)) ; ret.add(str); } } } } } } } } } } return ret; } public static String iTos(int i) { Integer Int = new Integer(i); return Int.toString(); } public static ArrayList<Integer[]> getPermutationInt() { ArrayList<Integer[]> ret = new ArrayList<Integer[]>(); ArrayList<String> p = getPermutationString() ; for(String s: p) { //System.out.println(s); String[] num_str = s.split(","); int cnt = 0; Integer[] intArr = new Integer[9]; for(String i:num_str) { intArr[cnt] = Integer.parseInt(i); cnt ++; } ret.add(intArr); } return ret; } /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub ArrayList<Integer[]> p = getPermutationInt(); int show_cnt = 0; for(Integer[] s: p) { ++show_cnt; for(Integer i: s) System.out.print(i+" "); System.out.println(); if(show_cnt > 50) break; } } }  

 

package util; import java.util.*; public class RandomGenerator { public static int generateRandomInt(int upbound) { if(upbound < 0) { throw new IllegalArgumentException("upbound must be positive"); } int gen = -1; Random r = new Random(System.nanoTime()); gen = r.nextInt(upbound); return gen; } /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub //System.out.print(generateRandomInt(-5)); } }