movegenerator.h

人工智能上机实验题目：自动求解八数码难题。 八数码难题：在3×3的方格棋盘上

// MoveGenerator.h: interface for the CMoveGenerator class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_MOVEGENERATOR_H__9244EBE9_F114_4672_BE1A_647E4425455B__INCLUDED_)
#define AFX_MOVEGENERATOR_H__9244EBE9_F114_4672_BE1A_647E4425455B__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include "Define.h"
#include "Evaluation.h"
#include <queue>

using namespace std;

//走法产生器
class CMoveGenerator  
{
public:
	CMoveGenerator();
	virtual ~CMoveGenerator();

public:
	int CreatePossibleMove(BYTE byBoard[][3],int iPly);//产生最好的走法
	bool IsValidMove(BYTE byBoard[][3],int x,int y);   //是否是一个有效的移动
	void MakeMove(BYTE byBoard[][3],CHESSMOVE cm);
	void UnMakeMove(BYTE byBoard[][3],CHESSMOVE cm);
	int Existed(CHESSMOVE m_MoveList[][800],CHESSMOVE cm,int iPly);

protected:
	
	void AddMove(CHESSMOVE cm,int iPly);//在m_MoveList中插入一个走法,nPly表明插入到List第几层
	void PrintState(BYTE byBoard[][3]);


public:
	CHESSMOVE m_MoveList[100][800];//存放CreatePossibleMove产生的所有走法的队列

protected:
	int m_nMoveCount;		     //记录m_MoveList中走法的数量
	CEvaluation* m_pEval;		 //估值核心
	queue<CHESSMOVE> m_queueMove;//存放走法的队列
	int m_iCurPly;               //当前节点所在层数
};

#endif // !defined(AFX_MOVEGENERATOR_H__9244EBE9_F114_4672_BE1A_647E4425455B__INCLUDED_)