#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#include<bits/stdc++.h>
#include<random>
#include<ctime>
#include<windows.h>
#include<omp.h>
#define pll pair<int,int>
using namespace std;
static default_random_engine e;
struct Chess {
int des[10][9];
};
int maxnumcore;
int maxstep=8;
int thinktime=30;
int nodelimt=7;
int qzw[32] = {100,3,3,3,3,7,7,15,15,10,10,1,1,1,1,1,-100,-3,-3,-3,-3,-7,-7,-15,-15,-10,-10,-1,-1,-1,-1,-1};
pair<int, int> limx[16] = { {0,2},{0,2},{0,2},{0,4},{0,4},{0,9},{0,9},{0,9},{0,9},{0,9},{0,9},{0,9},{0,9},{0,9},{0,9},{0,9}};
pair<int, int> limy[16] = { {3,5},{3,5},{3,5},{0,8},{0,8},{0,8},{0,8},{0,8},{0,8},{0,8},{0,8},{0,8},{0,8},{0,8},{0,8},{0,8}};
Chess prec;
class cheess{
public:
pair<int, int> POS[32];
Chess base;
void init() {
POS[0] = { 0,4 }; POS[1] = { 0,3 }; POS[2] = { 0,5 }; POS[3] = { 0,2 }; POS[4] = { 0,6 };
POS[5] = { 0,1 }; POS[6] = { 0,7 }; POS[7] = { 0,0 }; POS[8] = { 0,8 }; POS[9] = { 2,1 };
POS[10] = { 2,7 }; POS[11] = { 3,0 }; POS[12] = { 3,2 }; POS[13] = { 3,4 }; POS[14] = { 3,6 };
POS[15] = { 3,8 }; POS[16] = { 9,4 }; POS[17] = { 9,5 }; POS[18] = { 9,3 }; POS[19] = { 9,6 };
POS[20] = { 9,2 }; POS[21] = { 9,7 }; POS[22] = { 9,1 }; POS[23] = { 9,8 }; POS[24] = { 9,0 };
POS[25] = { 7,7 }; POS[26] = { 7,1 }; POS[31] = { 6,0 }; POS[30] = { 6,2 }; POS[29] = { 6,4 };
POS[28] = { 6,6 }; POS[27] = { 6,8 };
for (int i = 0; i < 10; i++)for (int j = 0; j < 9; j++)base.des[i][j] = -1;
for (int i = 0; i < 32; i++) base.des[POS[i].first][POS[i].second] = i;
//base.des[6][0]=base.des[6][2]=base.des[6][4]=base.des[6][6]=base.des[6][8]=-1;
//base.des[3][0]=base.des[3][2]=base.des[3][4]=base.des[3][6]=base.des[3][8]=-1;
}
inline Chess rev(Chess& a) {
Chess k;
for(int i=0;i<10;i++)for(int j=0;j<9;j++)k.des[i][j]=-1;
for (int i = 0; i < 10; i++)for (int j = 0; j < 9; j++){
if(a.des[9 - i][8 - j]>15)k.des[i][j] = a.des[9 - i][8 - j]-16;
else if(a.des[9 - i][8 - j]>=0)k.des[i][j] = a.des[9 - i][8 - j]+16;
}
return k;
}
inline int calval(Chess&u){
int cn=0;
for(int i=0;i<10;i++)for(int j=0;j<9;j++)
if(u.des[i][j]>=0)cn+=qzw[u.des[i][j]];
return cn;
}
inline Chess Creatdes(int posxi, int posyi, int posx, int posy, Chess p) {
int i = p.des[posxi][posyi];
p.des[posx][posy] = i;
p.des[posxi][posyi] = -1;
return rev(p);
}
inline int judge(Chess& u, int i, int posx, int posy) {
if (i == 0 && u.des[posx][posy] == 16)return 1;
if (!(limx[i].first <= posx && posx <= limx[i].second && limy[i].first <= posy && posy <= limy[i].second))return 0;
if (!(u.des[posx][posy] == -1 || u.des[posx][posy] > 15))return 0;
return 1;
}
inline vector<Chess> step(Chess tmp, int sw) {
pair<int, int> poi[32];
for (int i = 0; i < 32; i++)poi[i] = { -1,-1 };
for (int i = 0; i < 10; i++)for (int j = 0; j < 9; j++)if (tmp.des[i][j] >= 0)poi[tmp.des[i][j]] = { i,j };
vector<Chess> ans;
int nposx, nposy, posx, posy;
auto work = [&](int i)-> void {
if (judge(tmp, i, nposx, nposy))
ans.push_back(Creatdes(posx, posy, nposx, nposy, tmp));
};
for (int i = 0; i <= 15; i++) {
if(sw==0)i=e()%16;
if (poi[i].first == -1)continue;
posx = poi[i].first, posy = poi[i].second;
if (i == 0) {
nposx = posx - 1, nposy = posy;
work(i);
nposx = posx + 1, nposy = posy;
work(i);
nposx = posx, nposy = posy + 1;
work(i);
nposx = posx, nposy = posy - 1;
work(i);
if (posy == poi[16].second) {
nposx = poi[16].first, nposy = poi[16].second;
int x=0;
for(int j=posx+1;j<=nposx-1;j++)if(tmp.des[j][posy]!=-1)x=1;
if(x==0){
work(i);
}
}
}
else if (i == 1 || i == 2) {
nposx = posx - 1, nposy = posy - 1;
work(i);
nposx = posx + 1, nposy = posy + 1;
work(i);
nposx = posx - 1, nposy = posy + 1;
work(i);
nposx = posx + 1, nposy = posy - 1;
work(i);
}
else if (i == 3 || i == 4) {
if (posx - 1 >= 0 && posy - 1 >= 0 && tmp.des[posx - 1][posy - 1] == -1) {
nposx = posx - 2, nposy = posy - 2;
work(i);
}
if (posx + 1 <= 9 && posy + 1 <= 8 && tmp.des[posx + 1][posy + 1] == -1) {
nposx = posx + 2, nposy = posy + 2;
work(i);
}
if (posx + 1 <= 9 && posy - 1 >= 0 && tmp.des[posx + 1][posy - 1] == -1) {
nposx = posx + 2, nposy = posy - 2;
work(i);
}
if (posx - 1 >= 0 && posy + 1 <= 8 && tmp.des[posx - 1][posy + 1] == -1) {
nposx = posx - 2, nposy = posy + 2;
work(i);
}
}
else if (i == 5 || i == 6) {
if (posx - 1 >= 0 && tmp.des[posx - 1][posy] == -1) {
nposx = posx - 2, nposy = posy - 1;
work(i);
nposx = posx - 2, nposy = posy + 1;
work(i);
}
if (posx + 1 <= 9 && tmp.des[posx + 1][posy] == -1) {
nposx = posx + 2, nposy = posy + 1;
work(i);
nposx = posx + 2, nposy = posy - 1;
work(i);
}
if (posy - 1 >= 0 && tmp.des[posx][posy - 1] == -1) {
nposx = posx - 1, nposy = posy - 2;
work(i);
nposx = posx + 1, nposy = posy - 2;
work(i);
}
if (posy + 1 <= 8 && tmp.des[posx][posy + 1] == -1) {
nposx = posx - 1, nposy = posy + 2;
work(i);
nposx = posx + 1, nposy = posy + 2;
work(i);
}
}
else if (i == 7 || i == 8) {
for (int j = 1; j <= 9; j++) {
nposx = posx + j, nposy = posy;
work(i);
if (posx + j > 9 || tmp.des[posx + j][posy] != -1)break;
}
for (int j = 1; j <= 9; j++) {
nposx = posx - j, nposy = posy;
work(i);
if (posx - j < 0 || tmp.des[posx - j][posy] != -1)break;
}
for (int j = 1; j <= 8; j++) {
nposx = posx, nposy = posy + j;
work(i);
if (posy + j > 8 || tmp.des[posx][posy + j] != -1)break;
}
for (int j = 1; j <= 8; j++) {
nposx = posx, nposy = posy - j;
work(i);
if (posy - j < 0 || tmp.des[posx][posy - j] != -1)break;
}
}
else if (i == 9 || i == 10) {
for (int j = 1; j <= 9; j++) {
if (posx + j > 9)break;
if (tmp.des[posx + j][posy] == -1) {
nposx = posx + j, nposy = posy;
work(i);
}
if (tmp.des[posx + j][posy] != -1) {
j++;
while (posx + j <= 9 && tmp.des[posx + j][posy] == -1)j++;
nposx = posx + j, nposy = posy;
work(i);
break;
}
}
for (int j = 1; j <= 9; j++) {
if (posx - j < 0)break;
if (tmp.des[posx - j][posy] == -1) {
nposx = posx - j, nposy = posy;
work(i);
}
if (tmp.des[posx - j][posy] != -1) {
j++;
while (posx - j >= 0 && tmp.des[posx - j][posy] == -1)j++;
nposx = posx - j, nposy = posy;
work(i);
break;
}
}
for (int j = 1; j <= 8; j++) {
if (posy + j > 8)break;
if (tmp.des[posx][posy + j] == -1) {
nposx = posx, nposy = posy + j;
work(i);
}
if (tmp.des[posx][posy + j] != -1) {
j++;
while (posy + j <= 8 && tmp.des[posx][posy + j] == -1)j++;
nposx = posx, nposy = posy + j;
work(i);
break;
}
}
for (int j = 1; j <= 8; j++) {
if (posy - j < 0)break;
if (tmp.des[posx][posy - j] == -1) {
nposx = posx, nposy = posy - j;
work(i);
}
if (tmp.des[posx][posy - j] != -1) {
j++;
while (posy - j >= 0 && tmp.des[posx][posy - j] == -1)j++;
nposx = posx, nposy = posy - j;
work(i);
break;
}
}
}
else {
nposx = posx + 1, nposy = posy;
work(i);
if (posx > 4) {
nposx = posx, nposy = posy + 1;
work(i);
nposx = posx, nposy = posy - 1;
work(i);
}
}
if(sw==0&&ans.size())return ans;
}
return ans;
}
inline int Checkend(Chess &u){
int x=1;
for(int i=limx[0].first;i<=limx[0].second;i++)
for(int j=limy[0].first;j<=limy[0].second;j++)
if(u.des[i][j]==0)x=0;
return x;
}
int rollout(Chess u,int dep) {
int ans = 0;
if (Checkend(u)) {
return 1e9;
}
for (int tp = 1; tp <= thinktime; tp++) {
auto tmp = u;
int cnt = maxstep - dep;
int lun=1;
while (cnt>=0) {
vector<Chess> mulp;
while(mulp.size()<1)mulp=step(tmp,0);
int fe = 1;
lun=!lun;
for (auto& v : mulp) {
if(!Checkend(v))continue;
if (lun==0)ans += calval(v);
else ans-=calval(v);
fe=0;
}
if(fe==0)break;
random_shuffle(mulp.begin(), mulp.end());
tmp=mulp.back();
cnt--;
if(cnt<0){
if (lun==0)ans += calval(tmp);
else ans-=calval(tmp);
}
}
}
return ans;
}
int maxn=-1e9;
Chess ans;
int nay=0;
/*a:前面最大已经取到了a,b:前面最小已经取到了b*/
/*在MAX层,如果前面最小都已经取到b了,你在这层大于b可以直接退出*/
/*在MIN层,如果前面最大都已经取到a了,你在这层小于a可以直接退出*/
int cnt=0;
int abcut(Chess u,int dep,int a,int b,int lun){
//cnt++;
//cout<<cnt<<'\n';
if(dep==maxstep||Checkend(u)){
if(lun==0)return calval(u);
else return -calval(u);
}
vector<Chess> snf=step(u, 1);
vector<int> roaval(snf.size());
vector<pair<int,int>> p;
#pragma omp parallel for num_threads(maxnumcore)
for(int i=0;i<snf.size();i++){
auto&v=snf[i];
roaval[i]=rollout(v,dep+1);
}
for(int i=0;i<roaval.size();i++)
p.push_back({roaval[i],i});
sort(p.begin(), p.end(),greater<pll>());
for(int i=0;i<nodelimt&&i<snf.size();i++){
if(dep==0)nay++,cout<<nay<<'\n';
auto&v=snf[p[i].second];
int tmp=abcut(v,dep+1,a,b,!lun);
if(dep==0&&tmp>maxn){
maxn=tmp;
ans=v;
}
if(lun==0)a=max(tmp,a);
else b=min(tmp,b);
if(a>=b)break;
}
if(lun==0)return a;
else return b;
}
inline void sendmessage(int rx,int ry,int px,int py){
ofstream outFile;
outFile.open("rec.txt", std::ios::out);
outFile << rx<<' '<<ry<<'\n';
outFile << px<<' '<<py<<'\n';
outFile.close();
outFile.open("message.txt", std::ios::out);
outFile<<1<<'\n';
outFile.close();
}
void cp() {
Chess now=base,tmp;
prec=base;
while (1) {
tmp=now;
maxn=-1e9;
nay=0,cnt=0;
abcut(now,0,-1e9,1e9,0);
now = ans;
prec=tmp;
tmp=rev(now);
int readx,ready,px,py;
for(int i=0;i<10;i++)for(int j=0;j<9;j++)if(prec.des[i][j]!=tmp.des[i][j]){
if(tmp.des[i][j]!=-1){
px=i,py=j;
}
else readx=i,ready=j;
}
sendmessage(readx,ready,px,py);
if(Checkend(now)){
cout<<"ERO!!!!!!!!!!!!\n";
system("pause");
break;
}
tmp=now;
maxn=-1e9;
nay=0,cnt=0;
abcut(now,0,-1e9,1e9,0);
now = ans;
prec=rev(tmp);
tmp=now;
for(int i=0;i<10;i++)for(int j=0;j<9;j++)if(prec.des[i][j]!=tmp.des[i][j]){
if(tmp.des[i][j]!=-1){
px=i,py=j;
}
else readx=i,ready=j;
}
sendmessage(readx,ready,px,py);
if(Checkend(now)){
cout<<"ERO!!!!!!!!!!!!\n";
system("pause");
break;
}
}
}
}tester;
int main()
{
//ios::sync_with_stdio(0);
cin.tie(0);
maxnumcore = omp_get_num_procs();
tester.init();
e.seed(time(0));
while (1) {
tester.cp();
}
while(1);
return 0;
}
基于alpha-beta剪枝的MaxMin算法的中国象棋AI
于 2024-03-25 11:54:15 首次发布