ZYM/BH2023-Minesweeper
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

mile stone

Browse Source
This commit is contained in:
ZhuangYumin
2023-09-28 11:04:38 +08:00
parent 805dc08146
commit 119460808e
1 changed files with 14 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
src/include/client.h
View File

@ -247,7 +247,7 @@ std::vector<std::vector<double> > GaussianJordanElimination(
std::vector<double> equa_template; std::vector<double> equa_template;
equa_template.resize(m); equa_template.resize(m);
// assert(n + 1 == m); // assert(n + 1 == m);
for (int tot = 0; tot < 3; tot++) { for (int tot = 0; tot < 5; tot++) {
n = equations.size(); n = equations.size();
for (int i = 0; i < n; i++) { for (int i = 0; i < n; i++) {
int pivot = i; int pivot = i;
@ -276,7 +276,7 @@ std::vector<std::vector<double> > GaussianJordanElimination(
total_num += v; total_num += v;
} }
if (error_occur) continue; if (error_occur) continue;
if(total_num==1) continue; if (total_num == 1) continue;
if (NearbyInt(equations[i][m - 1]) == 0) { if (NearbyInt(equations[i][m - 1]) == 0) {
for (int j = 0; j < m - 1; j++) for (int j = 0; j < m - 1; j++)
if (NearbyInt(equations[i][j]) > 0) { if (NearbyInt(equations[i][j]) > 0) {
@ -284,8 +284,13 @@ std::vector<std::vector<double> > GaussianJordanElimination(
for (int k = 0; k < m; k++) equations[equations.size() - 1][k] = 0; for (int k = 0; k < m; k++) equations[equations.size() - 1][k] = 0;
equations[equations.size() - 1][m - 1] = 0; equations[equations.size() - 1][m - 1] = 0;
equations[equations.size() - 1][j] = 1; equations[equations.size() - 1][j] = 1;
std::pair<int, int> pos = variaID_to_position[j];
if (map_status[pos.first][pos.second] == 0) {
map_status[pos.first][pos.second] = 1;
no_mine_block_to_be_clicked.push(pos);
}
} }
equations.erase(equations.begin()+i); equations.erase(equations.begin() + i);
i--; i--;
} else if (NearbyInt(equations[i][m - 1]) == total_num) { } else if (NearbyInt(equations[i][m - 1]) == total_num) {
for (int j = 0; j < m - 1; j++) for (int j = 0; j < m - 1; j++)
@ -294,8 +299,12 @@ std::vector<std::vector<double> > GaussianJordanElimination(
for (int k = 0; k < m; k++) equations[equations.size() - 1][k] = 0; for (int k = 0; k < m; k++) equations[equations.size() - 1][k] = 0;
equations[equations.size() - 1][m - 1] = 1; equations[equations.size() - 1][m - 1] = 1;
equations[equations.size() - 1][j] = 1; equations[equations.size() - 1][j] = 1;
std::pair<int, int> pos = variaID_to_position[j];
if (map_status[pos.first][pos.second] == 0) {
map_status[pos.first][pos.second] = -1;
}
} }
equations.erase(equations.begin()+i); equations.erase(equations.begin() + i);
i--; i--;
} }
} }
@ -385,7 +394,7 @@ void PreProcessData() {
// 3. interpret the result of Gaussian-Jordan Elimination,store the result in // 3. interpret the result of Gaussian-Jordan Elimination,store the result in
// map_status and push the newly found block that definitely has no mine // map_status and push the newly found block that definitely has no mine
// into no_mine_block_to_be_clicked // into no_mine_block_to_be_clicked
for (int i = 0; i < 4; i++) { for (int i = 0; i < 8; i++) {
std::vector<std::vector<double> > equations = GenerateEquations(); std::vector<std::vector<double> > equations = GenerateEquations();
equations = GaussianJordanElimination(equations); equations = GaussianJordanElimination(equations);
InterpretResult(equations); InterpretResult(equations);