sudoku algorithm

闲来无事，想弄个数独的生成器出来。最顺手的是java。于是写了个类，给大家分享。目前它的问题是，算出-1后，重新产生一行时，随机处理不够优化，测试时，曾经死过几次。有空优化下。

import java.util.ArrayList;
import java.util.Random;

public class Sudoku {

	public static void main(String[] args) {
		int[][] result = buildAll();
		printAll(result);
	}

	private static void printAll(int[][] result) {
		for (int x = 0; x < 9; x++) {
			for (int y = 0; y < 9; y++) {
				System.out.print(result[x][y] + " ");
			}
			System.out.println();
		}
	}

	private static int[][] buildAll() {
		int[][] result = new int[9][9];

		ArrayList<ArrayList<Integer>> rows = new ArrayList<ArrayList<Integer>>(9);
		ArrayList<ArrayList<ArrayList<Integer>>> nines = new ArrayList<ArrayList<ArrayList<Integer>>>(3);

		for (int n = 0; n < 9; n++) {
			ArrayList<Integer> row = new ArrayList<Integer>(9);
			rows.add(row);
		}

		for (int n = 0; n < 3; n++) {
			ArrayList<ArrayList<Integer>> nine = new ArrayList<ArrayList<Integer>>(3);
			for (int m = 0; m < 3; m++) {
				ArrayList<Integer> number = new ArrayList<Integer>(9);
				nine.add(number);
			}
			nines.add(nine);
		}

		for (int x = 0; x < 9; x++) {
			ArrayList<Integer> row = rows.get(x);
			ArrayList<ArrayList<Integer>> nine1 = nines.get(x / 3);

			for (int y = 0; y < 9; y++) {
				ArrayList<Integer> seeds = new ArrayList<Integer>();
				for (int i = 1; i < 10; i++) {
					seeds.add(i);
				}

				ArrayList<Integer> nine2 = nine1.get(y / 3);

				ArrayList<Integer> cols = new ArrayList<Integer>();
				for (ArrayList<Integer> row1 : rows) {
					if (row1.size() > y)
						cols.add(row1.get(y));
				}
				
				int current = find(seeds, row, cols, nine2);
				
				if(current==-1){
					printAll(result);
					x--;
					break;
				}
					
				row.add(current);
				nine2.add(current);
				result[x][y] = current;
			}
		}
		return result;
	}

	private static int find(ArrayList<Integer> seeds, ArrayList<Integer> row, ArrayList<Integer> cols, ArrayList<Integer> nine) {
		seeds.removeAll(row);
		seeds.removeAll(cols);
		seeds.removeAll(nine);

		Random random = new Random();
		int n = seeds.size();
		if (n > 0) {
			int index = random.nextInt(n);
			return seeds.get(index);
		} else {
			return -1;
		}
	}
}