利用分治策略可以很好的解决棋盘覆盖问题: public class ChessBoard { private static int tile = 0; private static int[][] board; private int size; public ChessBoard(int size) throws MyExcption { if (!isValid(size)) { throw new MyExcption("invalid size"); } this.size = size; board = new int[size][size]; } private boolean isValid(int size) { return ((size & (size - 1)) == 0 ? true : false); } private void chessBoard(int tr, int tc, int dr, int dc, int size) { if (size == 1) return; int t = tile++; int s = size / 2; if (dr < tr + s && dc < tc + s) chessBoard(tr, tc, dr, dc, s); else { board[tr + s - 1][tc + s - 1] = t; chessBoard(tr, tc, tr + s - 1, tc + s - 1, s); } if (dr < tr + s && dc >= tc + s) chessBoard(tr, tc + s, dr, dc, s); else { board[tr + s - 1][tc + s] = t; chessBoard(tr, tc + s, tr + s - 1, tc + s, s); } if (dr >= tr + s && dc < tc + s) chessBoard(tr + s, tc, dr, dc, s); else { board[tr + s][tc + s - 1] = t; chessBoard(tr + s, tc, tr + s, tc + s - 1, s); } if (dr >= tr + s && dc >= tc + s) chessBoard(tr + s, tc + s, dr, dc, s); else { board[tr + s][tc + s] = t; chessBoard(tr + s, tc + s, tr + s, tc + s, s); } } private void run(int dr, int dc) { chessBoard(0, 0, dr, dc, size); print(); } public void print() { for (int i = 0; i < size; i++) { for (int j = 0; j < size; j++) { System.out.print(board[i][j] + "/t"); } System.out.println(); } } class MyExcption extends Exception { MyExcption(String str) { super(str); } } public static void main(String[] args) { ChessBoard cb; try { cb = new ChessBoard(8); cb.run(0, 1); } catch (MyExcption e) { // TODO Auto-generated catch block e.printStackTrace(); } } }