1.cpp

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

#include<iostream.h>
#include<stdlib.h>
#include "listpos.h"
#include "setpos.h"
#include "ABmove.h"
#include "fangqimcro.h"
#define boardsize 8
#define boardsizes 9
#define infinite 1000
#define bian 2
#define jiao 20
void main(void)
{
	int pos0[boardsizes][boardsizes]={
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
	},pos[boardsizes][boardsizes],datat[boardsizes][boardsizes]={
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 1,-1, 0, 0, 0,
		0, 0, 0, 0,-1, 1, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		0, 0, 0, 0, 0, 0, 0, 0, 0,
		},posnum,side=1;
		for(;;)
		{
		int ai,bi,aj,bj;
		to(pos0,pos);
		side=1;
		listposfun;
		int *p1=(int *)pos,*p2=p1,*p3=&pos[boardsize][boardsize],setposi,setposj,der;
		p1+=(boardsizes+1);
		int setposresult[4]={0,0,-infinite,0},msign=0;
		for(;p1<=p3;p1++)
		{
			if(*p1)
			{
				setposi=(p1-p2)/boardsizes;
				setposj=(p1-p2)%boardsizes;
				der=*p1;
				int data[boardsizes][boardsizes],score=-infinite;
				to(datat,data);
				setpos;
				data[0][0]=1,data[0][1]=-infinite,data[0][2]=-infinite,data[0][3]=11;
				score=-ABmove(data);
				if(setposresult[2]<score) {setposresult[2]=score,setposresult[0]=setposi,setposresult[1]=setposj,setposresult[3]=der;}
			}
		}
		int mover,movec,sign=0,money=0;
		cout<<"setposi="<<setposresult[0]<<'\t'<<"setposj="<<setposresult[1]<<'\t'<<"der="<<setposresult[3]<<"\tscore="<<setposresult[2]<<'\n';
		setposi=setposresult[0],setposj=setposresult[1],der=setposresult[3];
		int data[boardsizes][boardsizes];
		to(datat,data);
		side=1;
		setpos;
		put(data);
		cin>>mover>>movec;
		sign=0,money=0;
		side=-1;
		fangqi;
		to(data,datat);
		put(datat);
		}
}