棋盘覆盖问题的算法设计

//tr:棋盘左上角方格的行号
//tc:棋盘左上角方格的列号
//dr:特殊方格所在的行号
//dc:特殊方格所在的列号
//size:棋盘的边长
int title = 0;
void ChessBoard(int tr, int tc, int dr, int dc, int size)
{
	if(size == 1)
		return;
	int t = ++tile;//L型骨牌号
    int s = size/2;//分割棋盘
	//覆盖左上角子棋盘
	if(dr<tr+s && dc<tc+s)
		//特殊方格在此棋盘中
		ChessBoard(tr, tc, dr, dc, s);
	else   // 此棋盘无特殊方格
	{
		// 用t号L型骨型牌覆盖右下角
		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);
	}
}