fangqimcro.h

人工智能对弈黑白棋的源程序！ 全部原创 但是对弈时间有点长！ 请支持

////必须角为边二倍
#define fangqi 	if(data[mover][movec]==0){\
		if(mover>1&&data[mover-1][movec]==-side){\
		for(int n=mover-1;n>=1;n--)\
		{\
			if(data[n][movec]!=-side)\
				break;\
		}\
	    if(data[n][movec]==side&&n>=1)\
		{\
	    	for(int nn=mover;nn>n;nn--)\
			      data[nn][movec]=side;\
			sign=1;\
			if((movec==1||movec==boardsize)&&mover!=boardsize)\
				money+=(mover-nn-1)*bian;\
			else if((movec==1||movec==boardsize)&&mover==boardsize)\
				money+=((mover-nn-1)*bian);\
			else\
				money+=(mover-nn-1);\
		}\
	}\
    if(mover>1&&movec<boardsize&&data[mover-1][movec+1]==-side){\
		for(int n=mover-1,m=movec+1;n>=1&&m<=boardsize;n--,m++)\
		{\
			if(data[n][m]!=-side)\
				break;\
		}\
	    if(data[n][m]==side&&n>=1&&m<=boardsize)\
		{\
		    for(int nn=mover,mm=movec;nn>n&&mm<m;nn--,mm++)\
			    data[nn][mm]=side;\
		    money+=(mm-movec-1);\
			sign=1;\
		}\
	}\
    if(movec<boardsize&&data[mover][movec+1]==-side){\
		for(int m=movec+1;m<=boardsize;m++)\
		{\
			if(data[mover][m]!=-side)\
				break;\
		}\
	    if(data[mover][m]==side&&m<=boardsize)\
		{\
	    	for(int mm=movec;mm<m;mm++)\
			      data[mover][mm]=side;\
			sign=1;\
			if((mover==1||mover==boardsize)&&movec!=1)\
				money+=(mm-movec-1)*bian;\
			else if((mover==1||mover==boardsize)&&movec==1)\
				money+=((mm-movec-1)*bian);\
			else\
				money+=(mm-movec-1);\
		}\
	}\
    if(mover<boardsize&&movec<boardsize&&data[mover+1][movec+1]==-side){\
		for(int n=mover+1,m=movec+1;n<=boardsize&&m<=boardsize;n++,m++)\
		{\
			if(data[n][m]!=-side)\
				break;\
		}\
	    if(data[n][m]==side&&n<=boardsize&&m<=boardsize)\
		{\
		    for(int nn=mover,mm=movec;nn<n&&mm<m;nn++,mm++)\
			    data[nn][mm]=side;\
		    money+=(mm-movec-1);\
			sign=1;\
		}\
	}\
    if(mover<boardsize&&data[mover+1][movec]==-side){\
		for(int n=mover+1;n<=boardsize;n++)\
		{\
			if(data[n][movec]!=-side)\
				break;\
		}\
	    if(data[n][movec]==side&&n<=boardsize)\
		{\
	    	for(int nn=mover;nn<n;nn++)\
			      data[nn][movec]=side;\
			sign=1;\
			if((movec==1||movec==boardsize)&&mover!=1)\
				money+=(nn-mover-1)*bian;\
			else if((movec==1||movec==boardsize)&&mover==1)\
				money+=((nn-mover-1)*bian);\
			else\
				money+=(nn-mover-1);\
		}\
	}\
    if(mover<boardsize&&movec>1&&data[mover+1][movec-1]==-side){\
		for(int n=mover+1,m=movec-1;n<=boardsize&&m>=1;n++,m--)\
		{\
			if(data[n][m]!=-side)\
				break;\
		}\
	    if(data[n][m]==side&&n<=boardsize&&m>=1)\
		{\
		    for(int nn=mover,mm=movec;nn<n&&mm>m;nn++,mm--)\
			    data[nn][mm]=side;\
		    money+=(movec-mm-1);\
			sign=1;\
		}\
	}\
    if(movec>1&&data[mover][movec-1]==-side){\
		for(int m=movec-1;m>=1;m--)\
		{\
			if(data[mover][m]!=-side)\
				break;\
		}\
	    if(data[mover][m]==side&&m>=1)\
		{\
	    	for(int mm=movec;mm>m;mm--)\
			      data[mover][mm]=side;\
			sign=1;\
			if((mover==1||mover==boardsize)&&movec!=boardsize)\
				money+=(movec-mm-1)*bian;\
			else if((mover==1||mover==boardsize)&&movec==boardsize)\
				money+=((movec-mm-1)*bian);\
			else\
				money+=(movec-mm-1);\
		}\
	}\
       if(mover>1&&movec>1&&data[mover-1][movec-1]==-side){\
    		for(int n=mover-1,m=movec-1;n>=1&&m>=1;n--,m--)\
		{\
			if(data[n][m]!=-side)\
				break;\
		}\
	    if(data[n][m]==side&&n>=1&&m>=1)\
		{\
		    for(int nn=mover,mm=movec;nn>n&&mm>m;nn--,mm--)\
			    data[nn][mm]=side;\
		    money+=(movec-mm-1);\
			sign=1;\
		}\
	}\
       if(sign==1){\
	       money++;\
 	       if(mover==1||mover==boardsize)\
		       if(movec==1||movec==boardsize)\
                    money+=jiao-1;\
			   else\
	                money+=bian-1;\
	       else if(movec==1||movec==boardsize)\
		       if(mover==1||mover==boardsize)\
                    money+=jiao-1;\
			   else\
	                money+=bian-1;\
	   }\
	 }