以下是代碼：
/*
Author: Tanky Woo
Blog: www.WuTianQi.com
棋盤覆蓋問題
分治法
2010-12-3
*/
#include <iostream>
using namespace std;
const int N = 11;
int Board[N][N];
int tile = 0;
/*
tr:棋盤左上角方格的行號
tc:棋盤左上角方格的列號
dr:特殊方格所在的行號
dc:特殊方格所在的列號
size:方形棋盤的邊長
*/
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 // 此棋盤無特殊方格
{
// 用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);
}
}
void DisplayBoard(int size)
{
for(int i=1; i<=size; ++i)
{
for(int j=1; j<=size; ++j)
printf("%2d ", Board[i][j]);
printf("\n");
}
}
int main()
{
ChessBoard(1, 1, 1, 2, 4);
DisplayBoard(4);
return 0;
}