白子胜利不赢，看看Play（）函数是否错了。

Question

#include<iostream>
#include<windows.h>
#include<stdlib.h>
#include<conio.h>
#define N 15
using namespace std;
class Chess
{
public:
	void Init();
	int Play();
	void Print();
	int Put();
	int Judge();
	int Attack();
	int Defend();
	int aiPut();
	void Test();
	int Winner();
private:
	int p[N][N];
	int score1[N][N];
	int score2[N][N];
	int X; int Y;
	int count;                                   //步数
};
int main()
{
	Chess che;
	che.Test();
	return 0;
}
int Chess::Play()                                //运行游戏
{
	Init();
	count = 0;
	while (1)
	{
		Print();
		char ch = _getch();
		switch (ch)
		{
		case 32:                                 //空格下棋
			if (1 == Put())
			{
				Attack();
				Defend();
				aiPut();
				Judge();
				if (Winner() == 0)
				{
					char re;
					cout << "是否重新开始游戏？(Y/N)" << endl;
					cin >> re;
					if (re == 121 || re == 89)
					{
						Test();
					}
					else if (re == 110 || re == 78)
					{
						exit(1);
					}
				}
			}
			break;
		case 72:                                //向上 ↑
			X--; if (X < 0)X = 14;
			break;
		case 80:                                //向下 ↓  
			X++; if (X > 14)X = 0;
			break;
		case 75:                                //向左 ←
			Y--; if (Y < 0)Y = 14;
			break;
		case 77:                                //向右 →
			Y++; if (Y > 14)Y = 0;
			break;
		}
	}
}
void Chess::Init()                              //清空
{
	memset(p, 0, sizeof(p));
	memset(score1, 0, sizeof(score1));
	memset(score2, 0, sizeof(score2));
	X = Y = 7;
}
void Chess::Print()                             //打印棋盘
{
	system("cls");
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			if (X == i && Y == j)cout << "╬";
			else if (p[i][j] == 1)cout << "●";
			else if (p[i][j] == 2)cout << "○";
			else if (i == 0 && j == 0)cout << "┏";
			else if (i == 0 && j == 14)cout << "┓";
			else if (i == 14 && j == 0)cout << "┗";
			else if (i == 14 && j == 14)cout << "┛";
			else if (i == 0)cout << "┯";
			else if (i == 14)cout << "┷";
			else if (j == 0)cout << "┠";
			else if (j == 14)cout << "┨";
			else cout << "┼";
		}
		cout << endl;
	}
}
int Chess::Put()                           //玩家下子
{
	if (p[X][Y] == 0)
	{
		p[X][Y] = 1;
		return 1;
	}
	else
		return 0;
}
int Chess::Judge()                              //判断胜负
{
	int h = 1; int v = 1; int ps = 1; int sd = 1;
	for (int i = 1; i < 5; i++)
	{
		if (p[X][Y + i] == p[X][Y] && Y + i < 15)                     //向右查找相同棋子
			h++;
		else
			break;
	}
	for (int i = 1; i < 5; i++)                                 //向右查找相同棋子    
	{
		if (p[X][Y - i] == p[X][Y] && Y - i >= 0)
			h++;
		else
			break;
	}
	if (h >= 5)
	{
		if (p[X][Y] == 1)
			return 1;
		else if (p[X][Y] == 2)
			return 2;
	}
	for (int i = 1; i < 5; i++)                                 //向下查找相同棋子
	{
		if (p[X + i][Y] == p[X][Y] && X + i < 15)
			v++;
		else
			break;
	}
	for (int i = 1; i < 5; i++)                                 //向上查找相同棋子
	{
		if (p[X - i][Y] == p[X][Y] && X - i >= 0)
			v++;
		else
			break;
	}
	if (v >= 5)
	{
		if (p[X][Y] == 1)
			return 1;
		else if (p[X][Y] == 2)
			return 2;
	}
	for (int i = 1; i < 5; i++)                                 //向右下查找相同棋子
	{
		if (p[X + i][Y + i] == p[X][Y] && X + i < 15 && Y + i < 15)
			ps++;
		else
			break;
	}
	for (int i = 1; i < 5; i++)                                 //向左上查找相同棋子
	{
		if (p[X - i][Y - i] == p[X][Y] && X - i >= 0 && Y - i >= 0)
			ps++;
		else
			break;
	}
	if (ps >= 5)
	{
		if (p[X][Y] == 1)
			return 1;
		else if (p[X][Y] == 2)
			return 2;
	}
	for (int i = 1; i < 5; i++)                                 //向右上查找相同棋子  
	{
		if (p[X - i][Y + i] == p[X][Y] && X - i >= 0 && Y + i < 15)
			sd++;
		else
			break;
	}
	for (int i = 1; i < 5; i++)                                 //向左下查找相同棋子
	{
		if (p[X + i][Y - i] == p[X][Y] && X + i < 15 && Y - i >= 0)
			sd++;
		else
			break;
	}
	if (sd >= 5)
	{
		if (p[X][Y] == 1)
			return 1;
		else if (p[X][Y] == 2)
			return 2;
	}
}
int Chess::Winner()                                 //输出胜负结果
{
	int winner = Judge();
	if (winner == 1)
	{
		count = 0;
		MessageBox(NULL, L"黑子赢了", L"提示", MB_OK);
		return 0;
	}
	else if (winner == 2)
	{
		count = 0;
		MessageBox(NULL, L"白子赢了", L"提示", MB_OK);
		return 0;
	}
	else if (count == 225)
	{
		count = 0;
		MessageBox(NULL, L"平局", L"提示", MB_OK);
		return 0;
	}
}
void Chess::Test()                                 //测试运行
{
	SetConsoleTitleA("五子棋人机对战");
	system("mode con cols=50 lines=20");
	system("color 70");
	Play();
}
int Chess::Attack()                                 //计算机进攻计算权值
{
	int i1, j1;
	int k1, k2, k;
	for (int i = 0; i < 15; i++)
	{
		for (int j = 0; j < 15; j++)
		{
			if (p[i][j])
				score1[i][j] = 0;
			if (p[i][j] == 0)
			{
				k1 = k2 = 0;
				for (i1 = i, j1 = j - 1; j1 >= 0; j1--)//往左数寻找电脑棋子数
				{
					if (p[i1][j1] == 2)
						k1++;
					else
						break;
				}
				for (i1 = i, j1 = j + 1; j1 < 15; j1++)//往右数寻找电脑棋子数
				{
					if (p[i1][j1] == 2)
						k2++;
					else
						break;
				}
				k = k1 > k2 ? k1 : k2;
				k1 = k2 = 0;
				for (i1 = i - 1, j1 = j; i1 >= 0; i1--)//往上数寻找电脑棋子数
				{
					if (p[i1][j1] == 2)
						k1++;
					else
						break;
				}
				for (i1 = i + 1, j1 = j; i1 < 15; i1++)//往下数寻找电脑棋子数
				{
					if (p[i1][j1] == 2)
						k2++;
					else
						break;
				}
				k1 = k1 > k2 ? k1 : k2;
				k = k > k1 ? k : k1;
				k1 = k2 = 0;
				for (i1 = i - 1, j1 = j - 1; i1 >= 0 && j1 >= 0; i1--, j1--)//往左上数寻找电脑棋子数
				{
					if (p[i1][j1] == 2)
						k1++;
					else
						break;
				}
				for (i1 = i + 1, j1 = j + 1; i1 < 15 && j1 < 15; i1++, j1++)//往右下数寻找电脑棋子数
				{
					if (p[i1][j1] == 2)
						k2++;
					else
						break;
				}
				k1 = k1 > k2 ? k1 : k2;
				k = k > k1 ? k : k1;
				k1 = k2 = 0;
				for (i1 = i + 1, j1 = j - 1; i1 < 15 && j1 >= 0; i1++, j1--)//往左下数寻找电脑棋子数
				{
					if (p[i1][j1] == 2)
						k1++;
					else
						break;
				}
				for (i1 = i - 1, j1 = j + 1; i1 >= 0 && j1 < 15; i1--, j1++)//往右上数寻找电脑棋子数
				{
					if (p[i1][j1] == 2)
						k2++;
					else
						break;
				}
				k1 = k1 > k2 ? k1 : k2;
				k = k > k1 ? k : k1;
				switch (k)    //根据连子数赋予权值
				{
				case 1:
					score1[i][j] = 15; break;
				case 2:
					score1[i][j] = 60; break;
				case 3:
					score1[i][j] = 240; break;
				case 4:
					score1[i][j] = 3000; break;
				case 5:
					score1[i][j] = 50000; break;
				default:
					score1[i][j] = 0; break;
				}
			}
		}
	}
	return 0;
}
int Chess::Defend()                     //计算机防守计算权值
{
	int i1, j1;
	int k1, k2, k;
	for (int i = 0; i < 15; i++)
	{
		for (int j = 0; j < 15; j++)
		{
			if (p[i][j])
				score2[i][j] = 0;
			if (p[i][j] == 0)
			{
				k1 = k2 = 0;
				for (i1 = i, j1 = j - 1; j1 >= 0; j1--)//往左数寻找玩家棋子数
				{
					if (p[i1][j1] == 1)
						k1++;
					else
						break;
				}
				for (i1 = i, j1 = j + 1; j1 < 15; j1++)//往右数寻找玩家棋子数
				{
					if (p[i1][j1] == 1)
						k2++;
					else
						break;
				}
				k = k1 > k2 ? k1 : k2;
				k1 = k2 = 0;
				for (i1 = i - 1, j1 = j; i1 >= 0; i1--)//往上数寻找玩家棋子数
				{
					if (p[i1][j1] == 1)
						k1++;
					else
						break;
				}
				for (i1 = i + 1, j1 = j; i1 < 15; i1++)//往下数寻找玩家棋子数
				{
					if (p[i1][j1] == 1)
						k2++;
					else
						break;
				}
				k1 = k1 > k2 ? k1 : k2;
				k = k > k1 ? k : k1;
				k1 = k2 = 0;
				for (i1 = i - 1, j1 = j - 1; i1 >= 0 && j1 >= 0; i1--, j1--)//往左上数寻找玩家棋子数
				{
					if (p[i1][j1] == 1)
						k1++;
					else
						break;
				}
				for (i1 = i + 1, j1 = j + 1; i1 < 15 && j1 < 15; i1++, j1++)//往右下数寻找玩家棋子数
				{
					if (p[i1][j1] == 1)
						k2++;
					else
						break;
				}
				k1 = k1 > k2 ? k1 : k2;
				k = k > k1 ? k : k1;
				k1 = k2 = 0;
				for (i1 = i + 1, j1 = j - 1; i1 < 15 && j1 >= 0; i1++, j1--)//往左下数寻找玩家棋子数
				{
					if (p[i1][j1] == 1)
						k1++;
					else
						break;
				}
				for (i1 = i - 1, j1 = j + 1; i1 >= 0 && j1 < 15; i1--, j1++)//往右上数寻找玩家棋子数
				{
					if (p[i1][j1] == 1)
						k2++;
					else
						break;
				}
				k1 = k1 > k2 ? k1 : k2;
				k = k > k1 ? k : k1;
				switch (k)   //根据连子数赋予权值
				{
				case 1:
					score2[i][j] = 10; break;
				case 2:
					score2[i][j] = 40; break;
				case 3:
					score2[i][j] = 160; break;
				case 4:
					score2[i][j] = 4000; break;
				case 5:
					score2[i][j] = 1000000; break;
				default:
					score2[i][j] = 0; break;
				}
			}
		}
	}
	return 0;
}
int Chess::aiPut()                                //计算机计算最佳位置并落子
{
	int k1 = 0, k2 = 0;
	int i, j, max = 0;
	for (i = 0; i < 15; i += 1)
		for (j = 0; j < 15; j += 1)
		{
			if (max <= score1[i][j])
			{
				max = score1[i][j];
				k1 = i;
				k2 = j;
			}
		}
	for (i = 0; i < 15; i += 1)
		for (j = 0; j < 15; j += 1)
		{
			if (max <= score2[i][j])
			{
				max = score2[i][j];
				k1 = i;
				k2 = j;
			}
		}
	if (p[k1][k2] == 0)
	{
		p[k1][k2] = 2;
		cout << "○";
		count++;
		return 2;
	}
	else
		return 0;
}

Answer 1

Judge()函数判断胜负用的都是 X，Y 变量。

这X，Y 变量只是黑棋（玩家）落子的坐标。

白棋（AI）落子的坐标。没有传递给Judge()函数。

 

你应该给Judge()函数设置两个参数，传递黑棋或白棋落子的坐标

并且黑棋和白棋落子之后都要调用Judge()函数一次。