// JiuG.h: interface for the CJiuG class.

#if !defined(AFX_JIUG_H__A836D34F_3D4D_450C_BB2A_1412429F6451__INCLUDED_)
#define AFX_JIUG_H__A836D34F_3D4D_450C_BB2A_1412429F6451__INCLUDED_

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

#include <afxcoll.h>//包含類CPtrList

typedef struct JiuGongState{
	int curdistance;//當前的距離，從初始節(jié)點開始
	int state[3][3];
	struct JiuGongState *prestate;//上一個節(jié)點的指針
	struct JiuGongState *nextstate;//下一個節(jié)點的指針
}JGState;//定義九宮結(jié)構(gòu)

class CJiuG  
{
public:
	JGState StateInit;//初始狀態(tài)
	JGState StateObj;//目標狀態(tài)
	JGState StateCur;//當前狀態(tài)

	CPtrList OpenList;//Open表
	CPtrList CloseList;//Close表
	CPtrList ResultList;//保存結(jié)果
	JGState *curstep;

public:
	int m_ndepth;//搜索深度
	int ComputeJO(JGState *jo);//計算狀態(tài)的奇偶性
	CJiuG();
	virtual ~CJiuG();
	bool MoveLeft(JGState *src,JGState *result);//左移
	bool MoveRight(JGState *src,JGState *result);//右移
	bool MoveUp(JGState *src,JGState *result);//上移
	bool MoveDown(JGState *src,JGState *result);//下移
	bool Compare(JGState *src1,JGState *src2);//比較兩個狀態(tài)是否相等
	int ComputeFn(JGState *cur,JGState *dest);//估價函數(shù)的計算，我們采用了Pn
	bool Search();//用A*算法搜索最優(yōu)解
	void FreeList(CPtrList *list);//釋放內(nèi)存
	void CopyJG(JGState *src,JGState *dest);//復(fù)制九宮
};

#endif // !defined(AFX_JIUG_H__A836D34F_3D4D_450C_BB2A_1412429F6451__INCLUDED_)