没有合适的资源?快使用搜索试试~ 我知道了~
c语言写的象棋,很强大。
资源推荐
资源详情
资源评论
#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
int main()
{
stac int a[11][10]={
0,0,0,0,0,0,0,0,0,0,
0,1,2,3,4,5,4,3,2,1,
0,0,0,0,0,0,0,0,0,0,
0,0,6,0,0,0,0,0,6,0,
0,7,0,7,0,7,0,7,0,7,
0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,
0,-7,0,-7,0,-7,0,-7,0,-7,
0,0,-6,0,0,0,0,0,-6,0,
0,0,0,0,0,0,0,0,0,0,
0,-1,-2,-3,-4,-5,-4,-3,-2,-1};
void che_rule(int i,int j,int m,int n,int XQ[][10]);
void ma_rule(int i,int j,int m,int n,int XQ[][10]);
void xiang_rule(int i,int j,int m,int n,int XQ[][10]);
void shi_rule(int i,int j,int m,int n,int XQ[][10]);
void pao_rule(int i,int j,int m,int n,int XQ[][10]);
void bing_rule(int i,int j,int m,int n,int XQ[][10]);
void jiang_rule(int i,int j,int m,int n,int XQ[][10]);
void display(int XQ[11][10]);
void Xiang_Qi(int XQ[][10]);
display(a);
Xiang_Qi(a);
return 0;
}
void display(int XQ[11][10])
{
int i,j;
int m,n=0;
for(m=0;m<10;m++)
{
XQ[n][m]=m;
cout<<" "<<XQ[n][m]<<" ";
}
for(i=1;i<11;i++)
{
cout<<endl;
cout<<endl;
cout<<" "<<i<<" ";
for(j=1;j<10;j++)
switch(XQ[i][j])
{
case 1:
cout<<"─车─";
break;
case 2:
cout<<"─马─";
break;
case 3:
cout<<"─象─";
break;
case 4:
cout<<"─士─";
break;
case 5:
cout<<"─将─";
break;
case -1:
cout<<"─車─";
break;
case -2:
cout<<"─馬─";
break;
case -3:cout<<"─像─";
break;
case -4:cout<<"─仕─";
break;
case -5:cout<<"─帥─";
break;
case 6:cout<<"─炮─";
break;
case 7:cout<<"─兵─";
break;
case -6:cout<<"─泡─";
break;
case -7:cout<<"─卒─";
break;
case 0:cout<<"─ ─";┼
break;
}
}
cout<<endl;
}
/////**********************///////车的规则//////////************************/
void che_rule(int i,int j,int m,int n,int XQ[][10])
{
int k;
if(XQ[i][j]==1 || XQ[i][j]==-1)
{
if(m==i && j<n)
{
int consider=0;
for(k=j+1;k<n;k++)
{
if(XQ[i][k]!=0)
{
cout<<"移动错误"<<endl;
consider++;
break;
}
}
if(consider==0)
{
if(XQ[i][j]==1)
{
if(XQ[m][n]==1 || XQ[m][n]==5 || XQ[m][n]==2 ||
XQ[m][n]==3 || XQ[m][n]==4 || XQ[m][n]==6 || XQ[m][n]==7)
cout<<"移动错误"<<endl;
else
{
XQ[m][n]=XQ[i][j];
XQ[i][j]=0;
system("cls");
display(XQ);
}
}
if(XQ[i][j]==-1)
{
if(XQ[m][n]==-1 || XQ[m][n]==-5 || XQ[m][n]==-2 ||
XQ[m][n]==-3 || XQ[m][n]==-4 || XQ[m][n]==-6 || XQ[m][n]==-7)
cout<<"移动错误"<<endl;
else
{
XQ[m][n]=XQ[i][j];
XQ[i][j]=0;
system("cls");
display(XQ);
}
}
}
}
if(m==i && j>n)
{
int consider=0;
for(k=n+1;k<j;k++)
{
if(XQ[i][k]!=0)
{
cout<<"移动错误"<<endl;
consider++;
break;
}
}
if(consider==0)
{
if(XQ[i][j]==1)
{
if(XQ[m][n]==1 || XQ[m][n]==5 || XQ[m][n]==2 ||
XQ[m][n]==3 || XQ[m][n]==4 || XQ[m][n]==6 || XQ[m][n]==7)
cout<<"移动错误"<<endl;
else
{
XQ[m][n]=XQ[i][j];
XQ[i][j]=0;
system("cls");
display(XQ);
}
}
if(XQ[i][j]==-1)
{
if(XQ[m][n]==-1 || XQ[m][n]==-5 || XQ[m][n]==-2 ||
XQ[m][n]==-3 || XQ[m][n]==-4 || XQ[m][n]==-6 || XQ[m][n]==-7)
cout<<"移动错误"<<endl;
else
{
XQ[m][n]=XQ[i][j];
XQ[i][j]=0;
system("cls");
display(XQ);
}
}
}
}
if(n==j && m<i)
{
int consider=0;
for(k=m+1;k<i;k++)
{
if(XQ[k][j]!=0)
{
cout<<"移动错误"<<endl;
consider++;
break;
}
}
if(consider==0)
{
if(XQ[i][j]==1)
{
if(XQ[m][n]==1 || XQ[m][n]==5 || XQ[m][n]==2 ||
XQ[m][n]==3 || XQ[m][n]==4 || XQ[m][n]==6 || XQ[m][n]==7)
cout<<"移动错误"<<endl;
else
{
XQ[m][n]=XQ[i][j];
XQ[i][j]=0;
system("cls");
display(XQ);
}
}
if(XQ[i][j]==-1)
{
if(XQ[m][n]==-1 || XQ[m][n]==-5 || XQ[m][n]==-2 ||
XQ[m][n]==-3 || XQ[m][n]==-4 || XQ[m][n]==-6 || XQ[m][n]==-7)
cout<<"移动错误"<<endl;
else
{
XQ[m][n]=XQ[i][j];
XQ[i][j]=0;
system("cls");
display(XQ);
}
}
剩余25页未读,继续阅读
资源评论
L63C
- 粉丝: 8
- 资源: 27
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功