棋盘覆盖问题

#include<iostream>
using namespace std;
static int tile = 1;
const int Board_size = 8;
static int Board[Board_size][Board_size] = { 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 < s + tc)//特殊方格在此棋盘中
{
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 >= s + tc)//特殊方格在此棋盘中
{
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 < s + tc)//特殊方格在此棋盘中
{
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 >= s + tc)//特殊方格在此棋盘中
{
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 print_chess_board()
{
cout.setf(ios::left);//左对齐
for (int i = 0; i < Board_size; i++)
{
for (int j = 0; j < Board_size; j++)
{
cout.width(3);
cout << Board[i][j];
}
cout << endl;
}
}


int main()
{
ChessBoard(0, 0, 3, 4, Board_size);
print_chess_board();
system("pause");
return 0;
}