遞迴與分治之 棋盤覆蓋

/*  時間：2011-10-9  作者：xiaosi  題目：棋盤覆蓋*/#include"stdio.h"#include<iostream>using namespace std;int tile=1;//表示L型骨牌的編號int Board[4][4]={0};//定義棋盤並初始化棋盤void ChessBoard(int tr,int tc,int dr,int dc,int size);int main(){cout<<"請輸入特殊盤的下標號:"<<endl;int x,y;cin>>x>>y;ChessBoard(0,0,x,y,4);cout<<endl<<endl;for(int i=0;i<4;i++){for(int j=0;j<4;j++){cout<<Board[i][j]<<" ";}cout<<endl;}return 0;}void ChessBoard(int tr,int tc,int dr,int dc,int size){//採用分治策略的棋盤演算法if(size==1)return;int t=tile++,//L型骨牌號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);}}++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++