自己编的黑白棋程序c++代码.DOCVIP

#include iostream using namespace std; int qi[8][8]; void print_h(int h) { cout (char)(h+65) ¨c; for (int k=0; k8; k++) { switch (qi[h][k]) { case 0: cout ?à; break; case 1: cout ?ò; break; case 2: cout ??; break; } } cout ¨f endl; } void print() { cout ￡°￡±￡2￡3￡′￡μ￡?￡· endl; cout ¨X¨h¨h¨h¨h¨h¨h¨h¨h¨[ endl; for (int l=0; l8; l++) print_h(l); cout ¨^¨k¨k¨k¨k¨k¨k¨k¨k¨a endl; } void xiugai(int hang, int lie, int heng, int zong, int num) { for (int i=1; i=num; i++) { hang+=heng; lie+=zong; qi[hang][lie]=3-qi[hang][lie]; } } int panduan(int count, int shu, int se) { int out; // out=0:2??ìD?; out=1:?ìD?; out=2:2??ìD?2￠·μ??3é1|; if (shu==0) out=0; else if (shu==(3-se)) out=1; else if (count==1) out=0; else out=2; return out; } bool chuli(int se, int i, int j, bool leixing) { bool ctrl=false; int flag=1; int hang=i; int lie=j; int count=0; while (hang0 flag==1) // ?òé??D?? { hang--; count++; flag=panduan(count, qi[hang][lie], se); } if (flag==2) if (leixing) { xiugai(i,j,-1,0,count-1); ctrl=true; } else ctrl=true; flag=1; count=0; hang=i; lie=j; while (hang7 flag==1) // ?ò???D?? { hang++; count++; flag=panduan(count, qi[hang][lie], se); } if (flag==2) if (leixing) { xiugai(i,j,1,0,count-1); ctrl=true; } else ctrl=true; flag=1; count=0; hang=i; lie=j; while (lie0 flag==1) // ?ò×ó?D?? { lie--; count++; flag=panduan(count, qi[hang][lie], se); } if (flag==2) if (leixing) { xiugai(i,j,0,-1,count-1); ctrl=true; } else ctrl=true; flag=1; count=0; hang=i; lie=j; while (lie7 flag==1) // ?òóò?D?? { lie++; count++; flag=panduan(count, qi[hang][lie], se); } if (flag==2) if (leixing) { xiugai(i,j,0,1,count-1); ctrl=true; } else ctrl=true; flag=1; count=0; hang=i; lie=j; while (hang0 lie0 flag==1) // ?ò×óé??D?? { hang--; lie--; count++; fla