#include<iostream>
#include<vector>
#include <iomanip>
using namespace std;
vector<vector<int>> board;
int tile;
/*
tr: 棋盘左上角方格的行号;
tc: 棋盘左上角方格的列号;
dr: 特殊方格所在的行号;
dc:特殊方格所在的列号;
size: size = 2^k,棋盘规格为2^k * 2^k;
*/
void chessBoard(int tr, int tc, int dr, int dc, int size)
{
if (1 == size) return;
int t = tile++, //L型骨牌号
s = size >> 1; //分割棋盘
//覆盖左上角子棋盘
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 //此棋盘中无特殊方格
{
//用t号L型骨牌覆盖左下角
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 //用t号L型骨牌覆盖右上角
{
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 //用t号L型骨牌覆盖左上角
{
board[tr + s][tc + s] = t;
//覆盖其余方格
chessBoard(tr + s, tc + s, tr + s, tc + s, s);
}
}
int main()
{
tile = 1;
int size = 8;
board = vector<vector<int>>(size, vector<int>(size, 0));
chessBoard(0, 0, 2, 2, size);
for (int i = 0; i < board.size(); i++)
{
for (int j = 0; j < board[i].size(); j++)
cout <<setw(5)<< board[i][j] ;
cout << endl;
}
system("pause");
return 0;
}
棋盘覆盖问题 (分治)
猜你喜欢
转载自blog.csdn.net/weixin_40823740/article/details/103464696
今日推荐
周排行