分治法で碁盤カバーC++を実現

#include
using namespace std;
const int size = 8;
static int tile = 1;
static int board[size][size] = { 0 };


class CHESSBOARD
{
public:
	/*
	         
	*/
	static void chessBoard(int tr, int tc, int dr, int dc, int size)
	{
		//       1，   
		if (1 == size)
		{
			return;
		}
		//L   
		int t = tile++;
		//    
		int 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
		{
			//     ， 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
		{
			//  ，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
		{
			//L     
			board[tr + s][tc + s] = t;
			//          
			chessBoard(tr + s, tc + s, tr + s, tc + s, s);
		}
	}

	//        
	static void output()
	{
		for (int i = 0; i