Mine sweeper solver and judge

The rule is like the original minesweeper

main2.cpp
Our main minesweeper and judge

main.cpp
A naive random sample minesweeper

testcase.cpp
Generate testcases like 8 * 8/10(easy) , 16 * 16/40(mid) , 30 * 16/99(hard)

Our final result is (you can select a mine in the first step.)

8 * 8/10(easy) : 0.5222 (10000 times,random testcases)

16 * 16/40(mid) : 0.4803 (10000 times,random testcases)

30 * 16/99(hard) : 0.102 (1000 times,random testcases)

Our final result is (you can't select a mine in the first step.)

8 * 8/10(easy) : 0.7523 (10000 times,random testcases)

16 * 16/40(mid) : 0.7054 (10000 times,random testcases)

30 * 16/99(hard) : 0.192 (1000 times,random testcases)

Speed

8 * 8/10(easy) : 0.23s

16 * 16/40(mid) : 6.96s

30 * 16/99(hard) : 48.26s

Old Data(you can select a mine in the first step.)