-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
135 lines (117 loc) · 3.65 KB
/
main.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
// Monte Carlo Tree Search.cpp : This file contains the 'main' function. Program
// execution begins and ends there.
//
#include <chrono>
#include <iostream>
#include <random>
#include <algorithm>
#include "Game.h"
#include "MCTS.h"
using namespace std;
Play getMoveFromInput(const Game& g) {
int row, col, subRow, subCol;
cout << "Quadrant to play in: " << g.getNextCoor().first << " "
<< g.getNextCoor().second << endl;
if (g.getNextCoor().first == -1 && g.getNextCoor().second == -1) {
cout << "Enter row (1-3):\n";
cin >> row;
row--;
cout << "Enter col (1-3):\n";
cin >> col;
col--;
} else {
row = g.getNextCoor().first;
col = g.getNextCoor().second;
}
cout << "Enter sub row (1-3)\n";
cin >> subRow;
subRow--;
cout << "Enter sub col (1-3)\n";
cin >> subCol;
subCol--;
Play play(row - 1, col - 1, subRow - 1, subCol - 1);
auto moves = g.moves();
bool valid = true;
if (count(moves.begin(), moves.end(), play)) valid = false;
if (valid && (row < 0 || row > 2 || col < 0 || col > 2 || subRow < 0 || subRow > 2 ||
subCol < 0 || subCol > 2)) {
cerr << "Invalid input!\n";
return getMoveFromInput(g);
}
return play;
}
double sims = 0;
int iterations = 0;
constexpr int timeout = 50;
Player simulateGame() {
Game state;
Player winner = state.winner();
cout << state << endl;
unsigned depth = 0;
while (!state.isTerminal()) {
try {
cout << "Player to move: " << state.playerToMove() << endl;
// X is MCTS, O is random
// if (state.playerToMove() == Player::X) {
MCTS mcts(state);
auto timeStart = chrono::steady_clock::now();
SearchResult searchRes = mcts.runSearch(timeout);
auto timeEnd = chrono::steady_clock::now();
auto diff = timeEnd - timeStart;
auto play = mcts.bestMove("robust");
if (depth < 2) {
iterations++;
sims += searchRes.visits;
}
state.applyMove(play.bestPlay);
cout << "This move took "
<< chrono::duration<double, milli>(diff).count() << "ms"
<< endl; // print benchmark
cout << "Root stats\tvisits: " << searchRes.visits
<< "\twins: " << searchRes.wins << endl; // stats
cout << "Best Play stats\tvisits: " << play.bestVisits
<< "\twins: " << play.bestWins << endl;
// } else {
// /*auto moves = state.moves();
// random_device r;
// default_random_engine generator{r()};
// uniform_int_distribution<int> distribution(0, moves.size() - 1);
// state.applyMove(moves[distribution(generator)]);*/
// auto move = getMoveFromInput(state);
// state.applyMove(move);
// }
depth++;
} catch (exception& e) {
cerr << e.what() << endl;
}
cout << state << endl;
// debug
for (auto& row : state.getWinCache()) {
for (auto& col : row) cout << col;
cout << endl;
}
winner = state.winner();
}
// cout << "Winner: " << winner << endl;
return winner;
}
int main() {
for (unsigned i = 0; i < 1; i++) {
cout << simulateGame();
flush(cout);
}
cout << "\nAverage simulations on the first turn in " << timeout << "ms: "
<< sims / iterations << endl;
return 0;
}
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getting Started:
// 1. Use the Solution Explorer window to add/manage files
// 2. Use the Team Explorer window to connect to source control
// 3. Use the Output window to see build output and other messages
// 4. Use the Error List window to view errors
// 5. Go to Project > Add New Item to create new code files, or Project > Add
// Existing Item to add existing code files to the project
// 6. In the future, to open this project again, go to File > Open > Project
// and select the .sln file