compare_first.h

滑块问题求解系统：利用深度优先搜索和广度优先搜索解决有趣的滑块问题求解系统。

#pragma once
#include "searcher.h"
#include "dfs.h"
#include "bdfs.h"
#include "idfs.h"
#include "bfs.h"
#include "tbfs.h"
#include "astar1.h"
#include "astar2.h"
#include "ida.h"


// CCompare_first 对话框

class CCompare_first : public CDialog
{
	DECLARE_DYNAMIC(CCompare_first)

public:
	CCompare_first(CWnd* pParent = NULL);   // 标准构造函数
	virtual ~CCompare_first();

// 对话框数据
	enum { IDD = IDD_COMPARE };

	//各种搜索算法
	DFS dfs;
	BDFS bdfs;
	IDFS idfs;
	BFS bfs;
	TBFS tbfs;
	ASTAR1 astar1;
	ASTAR2 astar2;
	IDA ida;

	//控件资源
	struct COMP{
		searcher *search;
		int step_item;
		int node_item;
		int key_item;
	}comp[9];

	//搜索是否停止状态
	int stop;    

	int m_heuristic;		// 启发函数系数
	int m_maxstep;    //有界深度优先函数界限
	int m_begin, m_end;    //开始结束状态

	void getHer(int her){m_heuristic = her;}
	void getMaxstep(int maxstep){m_maxstep = maxstep;}
	void getStatus(int begin, int end){m_begin = begin, m_end = end;} 

protected:
	virtual void DoDataExchange(CDataExchange* pDX);    // DDX/DDV 支持

	DECLARE_MESSAGE_MAP()
public:
	afx_msg void OnBnClickedCompSearch();
};