黑白棋C++源码

最新推荐文章于 2024-07-16 15:51:15 发布

尧哥大魔王

最新推荐文章于 2024-07-16 15:51:15 发布

阅读量1.2k

点赞数

分类专栏： CPP

本文链接：https://blog.csdn.net/whuyao/article/details/84980349

版权

CPP 专栏收录该内容

7 篇文章 1 订阅

订阅专栏

//大一C++黑白棋答案
//未测试，不一定正确
//抄袭0分

#include <iostream>
using namespace std;

#define VALID 0
#define WHITE 1
#define BLACK 2

#define GRID_SIZE 8	//棋盘大小

int pData[GRID_SIZE][GRID_SIZE]; //棋盘

void display()	//输出pData并显示
{
	//输出pData并显示
	for(int i=0; i<GRID_SIZE; i++)
	{
		for(int j=0; j<GRID_SIZE; j++)
			cout << pData[i][j] << "\t";
		
		cout<<endl;
	}
}

bool play(int curX, int curY, int curColor = BLACK)
{
	if (curX < 0 || curY < 0 || curX >= GRID_SIZE || curY >= GRID_SIZE)
		return false;
	
	if (pData[curX][curY] == VALID)
		return false;
	
	//在这里编写黑白棋的逻辑，更新pData
	int searchX = curX, searchY = curY;
	int i, j;
	
	//横着找
	for(searchX = curX; searchX < GRID_SIZE, pData[searchX][searchY] == VALID; searchX++)
	{
		if (pData[searchX][searchY] == curColor)
		{
			for (i=curX; i<searchX; i++)
				pData[i][searchY] = curColor;
			
			break;
		}
	}
	
	searchX = curX;
	searchY = curY;
	for(searchX = curX; searchX >= 0, pData[searchX][searchY] == VALID; searchX--)
	{
		if (pData[searchX][searchY] == curColor)
		{
			for (i=curX; i>=searchX; i--)
				pData[i][searchY] = curColor;
			
			break;
		}
	}
	
	//竖着找
	searchX = curX;
	searchY = curY;
	for(searchY = curY; searchY < GRID_SIZE, pData[searchX][searchY] == VALID; searchY++)
	{
		if (pData[searchX][searchY] == curColor)
		{
			for (i=curY; i<searchY; i++)
				pData[searchX][i] = curColor;
			
			break;
		}
	}
	
	searchX = curX;
	searchY = curY;
	for(searchY = curY; searchY >= 0, pData[searchX][searchY] == VALID; searchY--)
	{
		if (pData[searchX][searchY] == curColor)
		{
			for (i=curY; i>=searchY; i--)
				pData[searchX][i] = curColor;
			
			break;
		}
	}
	
	//斜着找
	searchX = curX;
	searchY = curY;
	for(searchX = curX,searchY = curY; searchY < GRID_SIZE, searchY < GRID_SIZE, pData[searchX][searchY] == VALID; searchX++,searchY++)
	{			
		if (pData[searchX][searchY] == curColor)
		{
			for (i=curX, j=curY; i<searchX, j<searchY; i++, j++)
				pData[i][j] = curColor;
			
			break;
		}	
		
	}
	
	searchX = curX;
	searchY = curY;
	for(searchX = curX,searchY = curY; searchY >= 0, searchY >= 0, pData[searchX][searchY] == VALID; searchX--,searchY--)
	{			
		if (pData[searchX][searchY] == curColor)
		{
			for (i=curX, j=curY; i>=searchX, j>=searchY; i--, j--)
				pData[i][j] = curColor;
			
			break;
		}	
		
	}
	
	
	return true;
}

int main()
{
	int i, j;
	for (i=0; i<GRID_SIZE; i++)
		for (j=0; j<GRID_SIZE; j++)
			pData[i][j] = VALID;
		
	//左上角右下角分别为黑和白
	pData[0][GRID_SIZE-1] = BLACK;
	pData[GRID_SIZE-1][0] = WHITE;
	
	int curColor = BLACK;	
	int curX, curY;
	while (1)
	{
		cout << "Input Location (X, Y): "<<endl;
		cin >> curX >> curY;
		
		//修改pData
		bool bResult = play(curX, curY, curColor);
		
		if(bResult)
		{
			display();	//输出
			if (curColor == BLACK) curColor = WHITE;
			if (curColor == WHITE) curColor = BLACK;
		}
		if(!bResult)
			cout<<"Input X and Y Error!"<<endl;
		
	}
	
	return 0;
}