basedef.cpp

VC各工程的源码集合

#include "StdAfx.h"
#include "BaseDef.h"

#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif

//以下是全局函数实现:

int rnd(const int& n)
   {
	static int seed=0,c1=29,c2=217,c3=1024;

	if (seed==0)seed=(UINT)::GetTickCount();

	seed=(seed*c1+c2)%c3;
	
	return seed*n/c3;
   }

BOOL  CanGo(int manmap[11][12],
		   const int & man,
		   const int & xfrom,
		   const int & yfrom,
		   const int & xto,
		   const int & yto)
{
	static int i,j;

	if(!IsNormal(ManToType[man],xto,yto))	//这个棋子不能放在目标位置
	{
		//如果不是将|帅 (将|帅可以"照相")
		if(ManToType[man]!=RED_K&& ManToType[man]!=BLACK_K)return FALSE;

		else if(ManToType[man]==RED_K &&			//走的是帅
			ManToType[manmap[xto][yto]]==BLACK_K)	//目标是将
		{
			BOOL flag=FALSE;
			for(j= yfrom-1;j>0;j--)
			{
				if (manmap[xfrom][j]!=32)
				{
					if(ManToType[manmap[xfrom][j]]==BLACK_K)	//照相
						flag=TRUE;
					break;				
				}
			}
			if(flag)return TRUE;
			else return FALSE;
		}
		else if(ManToType[manmap[xto][yto]]==RED_K)	//走的是将,目标是帅							
		{
			BOOL flag=FALSE;
			for(j= yfrom+1;j<11;j++)
			{
				if (manmap[xfrom][j]!=32)
				{
					if(ManToType[manmap[xfrom][j]]==RED_K)	//照相
						flag=TRUE;	
					break;
				}
			}
			if(flag)return TRUE;
			else return FALSE;
		}
		else return FALSE;
	}

	//下面几行判断目标点是否己方的棋子:
	if(SideOfMan[man]==0)
	{
		if(manmap[xto][yto]!=32&& SideOfMan[manmap[xto][yto]]==0)return FALSE;		
	}
	else if(SideOfMan[man]==1)
	{
		if(manmap[xto][yto]!=32&& SideOfMan[manmap[xto][yto]]==1)return FALSE;		
	}
	//--------------------------------

	//以下是各棋子的规则:
	switch(ManToType[man])	
		{
		case RED_B:
			//兵不回头:
			if(yto > yfrom)return FALSE;
			//兵只走一步直线:
			if(yfrom-yto+abs(xto-xfrom)>1)return FALSE;	
			break;

		case BLACK_B:
			//卒不回头:
			if(yto < yfrom)return FALSE;
			//卒只走一步直线:
			if(yto-yfrom+abs(xto-xfrom)>1)return FALSE;	
			break;

		case RED_S:
		case BLACK_S:
			//士走斜线一步:
			if(abs(yfrom-yto)>1||abs(xto-xfrom)>1)return FALSE;	
			break;

		case RED_X:
		case BLACK_X:
			//相走田:
			if(abs(xfrom-xto)!=2||abs(yfrom-yto)!=2)return FALSE;
			//相心:
			if(manmap[(xfrom+xto)/2][(yfrom+yto)/2]!=32)return FALSE;
			break;

		case RED_K:
		case BLACK_K:
			//将帅只走一步直线:
			if(abs(yfrom-yto)+abs(xto-xfrom)>1)return FALSE;
			break;

		case RED_J:
		case BLACK_J:
			//车只能走直线:
			if(yfrom!=yto&&xfrom!=xto)return FALSE;	
			//车经过的路线中不能有棋子: -----------
			if(yfrom==yto)
			{
				if(xfrom<xto)
				{
					for(i=xfrom+1;i<xto;i++)
						if(manmap[i][yfrom]!=32)return FALSE;
				}
				else
				{
					for(i=xto+1;i<xfrom;i++)
						if(manmap[i][yfrom]!=32)return FALSE;
				}
			}
			else
			{
				if(yfrom<yto)
				{
					for(j=yfrom+1;j<yto;j++)
						if(manmap[xfrom][j]!=32)return FALSE;
				}
				else
				{
					for(j=yto+1;j<yfrom;j++)
						if(manmap[xfrom][j]!=32)return FALSE;
				}
			}
			//以上是车---------------------------------
			break;

		case RED_P:
		case BLACK_P:
			//炮只能走直线:
			if(yfrom!=yto&&xfrom!=xto)return FALSE;	
			//炮不吃子时经过的路线中不能有棋子:------------------
			if(manmap[xto][yto]==32)
			{
				if(yfrom==yto)
				{
					if(xfrom<xto)
					{
						for(i=xfrom+1;i<xto;i++)
							if(manmap[i][yfrom]!=32)return FALSE;
					}
					else
					{
						for(i=xto+1;i<xfrom;i++)
							if(manmap[i][yfrom]!=32)return FALSE;
					}
				}
				else
				{
					if(yfrom<yto)
					{
						for(j=yfrom+1;j<yto;j++)
							if(manmap[xfrom][j]!=32)return FALSE;
					}
					else
					{
						for(j=yto+1;j<yfrom;j++)
							if(manmap[xfrom][j]!=32)return FALSE;
					}
				}
			}
			//以上是炮不吃子-------------------------------------
			//吃子时:=======================================
			else	
			{
				int count=0;
				if(yfrom==yto)
				{
					if(xfrom<xto)
					{
						for(i=xfrom+1;i<xto;i++)
							if(manmap[i][yfrom]!=32)count++;
						if(count!=1)return FALSE;
					}
					else
					{
						for(i=xto+1;i<xfrom;i++)
							if(manmap[i][yfrom]!=32)count++;
						if(count!=1)return FALSE;
					}
				}
				else
				{
					if(yfrom<yto)
					{
						for(j=yfrom+1;j<yto;j++)
							if(manmap[xfrom][j]!=32)count++;
						if(count!=1)return FALSE;
					}
					else
					{
						for(j=yto+1;j<yfrom;j++)
							if(manmap[xfrom][j]!=32)count++;
						if(count!=1)return FALSE;
					}
				}
			}
			//以上是炮吃子时================================
			break;	

		case RED_M:
		case BLACK_M:
			//马走日:
			if(!(
				(abs(xto-xfrom)==1&&abs(yto-yfrom)==2)
				||(abs(xto-xfrom)==2&&abs(yto-yfrom)==1)
				))return FALSE;
			
			//找马脚:
			if		(xto-xfrom==2){i=xfrom+1;j=yfrom;}
			else if	(xfrom-xto==2){i=xfrom-1;j=yfrom;}
			else if	(yto-yfrom==2){i=xfrom;j=yfrom+1;}
			else if	(yfrom-yto==2){i=xfrom;j=yfrom-1;}
			
			//绊马脚:
			if(manmap[i][j]!=32)return FALSE;
			break;

		default:	
			break;
		}

	return TRUE;	//上面的规则全通过!
}

BOOL  IsNormal(const int & mantype,const int & x,const int & y)
{
	if(x<1||x>9||y<1||y>10)return FALSE;
	switch(mantype)
	{
	case RED_K:	
		//帅不能在红方宫外:
		if( x>6|| x<4|| y<8)return FALSE;
		break;

	case RED_S:	
		//仕只能在宫内特定点:
		if(!(
			( x==4&& y==10)||
			( x==4&& y==8)||
			( x==5&& y==9)||
			( x==6&& y==10)||
			( x==6&& y==8)
			))return FALSE;
		break;

	case RED_X:
		//七个相位:
		if(!(
			( x==1&& y==8)||
			( x==3&& y==10)||
			( x==3&& y==6)||
			( x==5&& y==8)||
			( x==7&& y==10)||
			( x==7&& y==6)||
			( x==9&& y==8)
			))return FALSE;
		break;

	case RED_B:
		//兵不能在兵位后:
		if( y>7)return FALSE;
		//兵过河前不能左右移动:
		if( y>5&& x%2==0)return FALSE;
		break;

	case BLACK_K:
		//帅不能在红方宫外:
		if( x>6|| x<4|| y>3)return FALSE;
		break;

	case BLACK_S:
		//仕只能在宫内特定点:
		if(!(
			( x==4&& y==1)||
			( x==4&& y==3)||
			( x==5&& y==2)||
			( x==6&& y==1)||
			( x==6&& y==3)
			))return FALSE;
		break;

	case BLACK_X:
		//七个相位:
		if(!(
			( x==1&& y==3)||
			( x==3&& y==1)||
			( x==3&& y==5)||
			( x==5&& y==3)||
			( x==7&& y==1)||
			( x==7&& y==5)||
			( x==9&& y==3)
			))return FALSE;
		break;

	case BLACK_B:
		//兵不能在兵位后:
		if( y<4)return FALSE;
		//兵过河前不能左右移动:
		if( y<6&& x%2==0)return FALSE;
		break;

	default:
		break;
	}
	return TRUE;
}

void  FixManMap(CFace & face, int map[11][12])
{
	memcpy(map,_defaultmap,132*sizeof(int));

	static CXY * pman;
	static int i;
	for(i=0;i<32;i++)
	{
		pman = & face.man[i];
		if(pman->x)
			map[pman->x][pman->y]=i;
	}
		
}