seat.h

汉诺(hanoi)问题采用递归算法解决

// Seat.h: interface for the CSeat class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_SEAT_H__9EF1838F_4B16_11D6_AAE6_B74EAB06404E__INCLUDED_)
#define AFX_SEAT_H__9EF1838F_4B16_11D6_AAE6_B74EAB06404E__INCLUDED_

#include "Tray.h"
#define MAX 10   // 最多盘子个数
#define DELAY 20   // ms

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


class CSeat  
{
public:
	CSeat(){}
	CSeat(CString name, int x, int y,int trayNumber, int halfWidth=80);
	virtual ~CSeat();
	void  Draw(CDC *pDC);
	void  DrawTray(CDC *pDC);
	void  MoveTo(CDC *pDC, CSeat * to);
	void  MoveHorizental(CDC *pDC, CTray *moveTray, int y, int x1, int x2);
	void  MoveVirtical(CDC *pDC, CTray *moveTray, int x, int y1, int y2);
	bool  Valid( CSeat * to);
public:
	CString m_strName;
	CPoint m_ptPosition;   //位置中心点
	int m_nTrayNumber;	   //位置的盘子数	
	int m_nHalfWidth;      //位置宽度的一半
	int m_nHight;          //针的高度
	CTray *m_pTray[MAX];  //位置上盘子的指针  
};

#endif // !defined(AFX_SEAT_H__9EF1838F_4B16_11D6_AAE6_B74EAB06404E__INCLUDED_)