szTom/4conq
Template
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix hardcoded 4 -> n/2

Browse Source
This commit is contained in:
方而静 2024-01-30 22:31:36 +08:00
parent e02a7d2b43
commit 3bf38441f5
Signed by: szTom
GPG Key ID: 072D999D60C6473C
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Compete/Game.cpp
View File

@ -17,7 +17,7 @@ bool GameState::_checkEnd() const {
if (C[cp][i] >= (n + 1) / 2) if (C[cp][i] >= (n + 1) / 2)
v += 1; v += 1;
} }
return v >= 4; return v >= (n + 1) / 2;
} }
bool GameState::move(int x, int y) { bool GameState::move(int x, int y) {

4
Strategy/Strategy.cpp
View File

@ -16,7 +16,7 @@ std::tuple<int, int> getMove(int lstX, int lstY) {
if (lstX != -1) { if (lstX != -1) {
ctl[0][B[lstX][lstY]] += 1; ctl[0][B[lstX][lstY]] += 1;
int t = B[lstX][lstY]; int t = B[lstX][lstY];
if (ctl[0][B[lstX][lstY]] >= 4) { if (ctl[0][B[lstX][lstY]] >= (N + 1) / 2) {
for (int i = 0; i < N; ++i) { for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) { for (int j = 0; j < N; ++j) {
if (B[i][j] == t) if (B[i][j] == t)
@ -40,7 +40,7 @@ std::tuple<int, int> getMove(int lstX, int lstY) {
if (flag && B[i][j] != -1) { if (flag && B[i][j] != -1) {
ctl[1][B[i][j]] += 1; ctl[1][B[i][j]] += 1;
if (ctl[1][B[i][j]] >= 4) { if (ctl[1][B[i][j]] >= (N + 1) / 2) {
int t = B[i][j]; int t = B[i][j];
for (int i = 0; i < N; ++i) { for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) { for (int j = 0; j < N; ++j) {