#include
#include
using?namespace?std;

const?int?ChessBoardScale?=?3;????????????????????????????//棋盤規(guī)模；
int?Record[ChessBoardScale][ChessBoardScale];??????????????//記錄被吃幾率；
char?Cover[ChessBoardScale][ChessBoardScale];??????????????//記錄可以放馬的位置；

class?ChessBoard{
public:
	void?GetChance（）;????????????????????//計算每一個位置被其它位置的馬吃掉的幾率；
	void?ReCaculateChance（/**/ChessBoard?Cb）;????????????//主題算法：計算極小覆蓋；
	void?GetMinCover（ChessBoard?Cb）;????????????????????//輸出最終結(jié)果；
	void?Condition（int?a?int?b）;???????????????//被吃幾率的再次計算；
};

void?ChessBoard::GetChance（）{
	for?（int?i?=?0;?i?		for?（int?j?=?0;?j?			int?k?=?0;
			if?（j?-?2?>=?0?&&?i?-?1?>=?0）{?Record[i?-?1][j?-?2]++;?}
			if?（j?-?1?>=?0?&&?i?-?2?>=?0）{?Record[i?-?2][j?-?1]++;?}
			if?（j?-?2?>=?0?&&?i?+?1?			if?（j?-?1?>=?0?&&?i?+?2?			if?（j?+?2?=?0）{?Record[i?-?1][j?+?2]++;?}
			if?（j?+?1?=?0）{?Record[i?-?2][j?+?1]++;?}
			if?（j?+?2?			if?（j?+?1?		}
	}
}

//主體算法------------------------------------
void?ChessBoard::ReCaculateChance（ChessBoard?Cb）{
	int?Max?=?Record[0][0];
	int?Max_i?=?0?Max_j?=?0;
	for?（int?i?=?0;?i?		for?（int?j?=?0;?j?			if?（Record[i][j]?>?Max）{
				Max?=?Record[i][j];
				Max_i?=?i;
				Max_j?=?j;
			}
		}
	}

	if?（Record[Max_i][Max_j]?>=?0）{??///////在棋盤中被吃幾率最大的位置放馬；
		Cover[Max_i][Max_j]?=?‘@‘;
		Record[Max_i][Max_j]?=?-1;
		cout?<		cout?<		cout?<	}????????????????????????????????????////////////棋盤的輸出；////////////******************

	//------------------------------------------------------------------------------------極小覆蓋的算法；

	if?（Max_j?-?2?>=?0?&&?Max_i?-?1?>=?0）{
		Record[Max_i?-?1][Max_j?-?2]?=?-1;
		int?i?=?Max_i?-?1;
		int?j?=?Max_j?-?2;
		Cb.Condition（i?j）;
	}

	if?（Max_j?-?1?>=?0?&&?Max_i?-?2?>=?0）{
		Record[Max_i?-?2][Max_j?-?1]?=?-1;
		int?i?=?Max_i?-?2;
		int?j?=?Max_j?-?1;
		Cb.Condition（i?j）;
	}

	if?（Max_j?-?2?>=?0?&&?Max_i?+?1		Record[Max_i?+?1][Max_j?-?2]?=?-1;
		int?i?=?Max_i?+?1;
		int?j?=?Max_j?-?2;
		Cb.Condition（i?j）;
	}

	if?（Max_j?-?1?>=?0?&&?Max_i?+?2		Record[Max_i?+?2][Max_j?-?1]?=?-1;
		int?i?=?Max_i?+?2;
		int?j?=?Max_j?-?1;
		Cb.Condition（i?j）;
	}

	if?（Max_j?+?2=?0）{
		Record[Max_i?-?1][Max_j?+?2]?=?-1;
		int?i?=?Max_i?-?1;
		int?j?=?Max_j?+?2;
		Cb.Condition（i?j）;
	}

	if?（Max_j?+?1=?0）{
		Record[Max_i?-?2][Max_j?+?1]?=?-1;
	

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2017-10-21?16:40??horse1\
?????文件?????????898??2017-10-21?16:40??horse1\horse.dev
?????文件?????1928525??2017-10-21?16:39??horse1\horse.exe
?????文件??????????96??2017-10-21?16:40??horse1\horse.layout
?????文件????????7313??2017-10-21?16:39??horse1\main.cpp
?????文件???????12997??2017-10-21?16:39??horse1\main.o
?????文件????????1065??2017-10-21?16:39??horse1\Makefile.win