chees.java

《算法设计与分析》王晓东编著

class Chess 
{ 
public int tile=0; 

//4*4的棋盘 
int board [][]=new int [4][4]; 


public void chessBoard(int tr,int tc,int dr,int dc,int size) 
{ 

if (size==1) return; 
int t = tile++; 

int s = size/2; 

//覆盖左上角子棋盘 
if (dr<tr+s&&dc<tc+s){ 
chessBoard(tr,tc,dr,dc,s);} 
else 
{ 
System.out.println("1: "+"tr="+tr+" tc="+tc+" dr="+dr+" dc="+dc+" size="+size); 
board[tr+s-1][tc+s-1]=t; 
System.out.println("第"+(tr+s-1)+"行的第"+(tc+s-1)+"列的值为："+board[tr+s-1][tc+s-1]); 
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 
{ 
System.out.println("2: "+"tr="+tr+" tc="+tc+" dr="+dr+" dc="+dc+" size="+size); 
board[tr+s-1][tc+s]=t; 
System.out.println("第"+(tr+s-1)+"行的第"+(tc+s)+"列的值为："+board[tr+s-1][tc+s]); 
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 
{ 
System.out.println("3: "+"tr="+tr+" tc="+tc+" dr="+dr+" dc="+dc+" size="+size); 
board[tr+s][tc+s-1]=t; 
System.out.println("第"+(tr+s)+"行的第"+(tc+s-1)+"列的值为："+board[tr+s][tc+s-1]); 
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 
{ 
System.out.println("4: "+"tr="+tr+" tc="+tc+" dr="+dr+" dc="+dc+" size="+size); 
board[tr+s][tc+s]=t; 
System.out.println("第"+(tr+s)+"行的第"+(tc+s)+"列的值为："+board[tr+s][tc+s]); 
chessBoard(tr+s,tc+s,tr+s,tc+s,s); 
} 

} 

public void tiling() 
{ 
int i,j; 
//大小为4 
int size=4; 
int tr=0,tc=0; 
int dr=2,dc=1; 
chessBoard(tr,tc,dr,dc,size); 
for (i=0;i<size ;i++ ) 
{ 
for(j=0;j<size;j++) 
System.out.print(board[i][j]); 
System.out.println(); 
} 
} 

public static void main(String[] args) 
{ 
Chess c = new Chess(); 
c.tiling(); 
} 
}