棋盘覆盖算法

import java.util.Scanner;
import static java.lang.System.out;

class ChessBoardCover {

private static int tile = 0;
private static int[][] board;
private static char[][] domino;
private static int length;

ChessBoardCover(int length) {
	board = new int[length][];
	domino = new char[2 * length][];
	for (int i = 0; i < length; ++i)
		board[i] = new int[length];

	for (int i = 0; i < 2 * length; ++i)
		domino[i] = new char[2 * length];
}

public void showBoard() {
	for(int i = 0;i<2*length;++i){
		for (int j = 0; j < 2 *length ; ++j) {
			out.printf("%-2c", domino[i][j]);
		}
		out.println();
	}
}

public static void main(String[] args) {

	int k = 0;
	Scanner scanner = new Scanner(System.in);
	out.println("请输入K的值");
	k = scanner.nextInt();
	length = (int) Math.pow(2, k);
	ChessBoardCover chess = new ChessBoardCover(length);
	out.println("请输入棋盘所在的位置坐标");
	int x = 0, y = 0;
	x = scanner.nextInt();
	y = scanner.nextInt();
	board[x-1][y-1]=-1;
	chess.ChessBoard(0, 0, x - 1, y - 1, length);
	chess.beauty();
	domino[2*x-2][2*y-2]='&';
	chess.showBoard();
	scanner.close();
}

private void beauty() {
	for (int i = 0; i < length; ++i)
		for (int j = 0; j < length; ++j) {
			domino[2 * i][2 * j] = '*';
		}
	for (int i = 0; i < length-1; ++i) {
		for (int j = 0; j < length; ++j) {
			
			if (j != 0 && j != length - 1) {
				if (board[i][j] == board[i][j + 1] && board[i][j] == board[i + 1][j])
					domino[2*i][2*j+1]=domino[2*i+1][2*j]='*';
				else if (board[i][j] == board[i][j + 1] && board[i][j] == board[i + 1][j + 1])
				     domino[2*i][2*j+1]=domino[2*i+1][2*j+2]='*';
				else if (board[i][j] == board[i + 1][j] && board[i][j] == board[i + 1][j + 1])
					domino[2*i+1][2*j]=domino[2*i+2][2*j+1]='*';
				else if(board[i][j] == board[i + 1][j] && board[i][j] == board[i + 1][j - 1])
					domino[2*i+1][2*j]=domino[2*i+2][2*j-1]='*';
			}
			else if(j == 0) {
				if (board[i][j] == board[i][j + 1] && board[i][j] == board[i + 1][j])
					domino[2*i][2*j+1]=domino[2*i+1][2*j]='*';
				else if (board[i][j] == board[i][j + 1] && board[i][j] == board[i + 1][j + 1])
				     domino[2*i][2*j+1]=domino[2*i+1][2*j+2]='*';
				else if (board[i][j] == board[i + 1][j] && board[i][j] == board[i + 1][j + 1])
					domino[2*i+1][2*j]=domino[2*i+2][2*j+1]='*';
			}
			else if(j == length-1) {
				if(board[i][j] == board[i + 1][j] && board[i][j] == board[i + 1][j - 1])
					domino[2*i+1][2*j]=domino[2*i+2][2*j-1]='*';
			}
		}
	}

}

public void ChessBoard(int tr, int tc, int dr, int dc, int size) {
	if (size == 1)
		return;
	int t = tile++, 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);
	}
}

}
`|