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

format

Browse Source
This commit is contained in:
ZhuangYumin
2023-09-28 12:59:07 +08:00
parent 69e96eaea9
commit 4d51eb339c
1 changed files with 10 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
src/include/client.h
View File

@ -421,13 +421,12 @@ std::pair<int, int> TotalRandomGuess() {
} }
return std::make_pair(row, column); return std::make_pair(row, column);
} }
inline double GetProb(double default_p,const std::vector<double> &ps) inline double GetProb(double default_p, const std::vector<double> &ps) {
{ if (ps.empty()) return default_p;
if(ps.empty()) return default_p; double res = 0;
double res=0; const double v = 2;
const double v=2; for (int i = 0; i < ps.size(); i++) res += pow(ps[i], v);
for(int i=0;i<ps.size();i++) res+=pow(ps[i],v); return pow(res / ps.size(), 1.0 / v);
return pow(res/ps.size(),1.0/v);
} }
/** /**
* @brief The definition of function SimpleGuess() * @brief The definition of function SimpleGuess()
@ -482,8 +481,10 @@ std::pair<int, int> SimpleGuess() {
for (int i = 0; i < rows; i++) for (int i = 0; i < rows; i++)
for (int j = 0; j < columns; j++) for (int j = 0; j < columns; j++)
if (map_status[i][j] == 0) { if (map_status[i][j] == 0) {
double current_prob=GetProb(default_probability,probability[best_guess.first][best_guess.second]); double current_prob =
double this_prob=GetProb(default_probability,probability[i][j]); GetProb(default_probability,
probability[best_guess.first][best_guess.second]);
double this_prob = GetProb(default_probability, probability[i][j]);
if (this_prob < current_prob) { if (this_prob < current_prob) {
best_guess.first = i; best_guess.first = i;
best_guess.second = j; best_guess.second = j;