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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
use engine::settings::GameSettings;
use engine::command::*;
use engine::geometry::*;
use engine::{GameState, GameStatus};
use rand::{Rng, XorShiftRng, SeedableRng};
const MAX_MOVES: u16 = 400;
use time::{Duration, PreciseTime};
#[cfg(not(feature = "single-threaded"))]
use rayon::prelude::*;
pub fn choose_move(settings: &GameSettings, state: &GameState, start_time: &PreciseTime, max_time: Duration) -> Command {
let mut command_scores = CommandScore::init_command_scores(settings, state);
loop {
#[cfg(feature = "single-threaded")]
{
command_scores.iter_mut()
.for_each(|score| {
let mut rng = XorShiftRng::from_seed(score.next_seed);
simulate_to_endstate(score, settings, state, &mut rng);
});
}
#[cfg(not(feature = "single-threaded"))]
{
command_scores.par_iter_mut()
.for_each(|score| {
let mut rng = XorShiftRng::from_seed(score.next_seed);
simulate_to_endstate(score, settings, state, &mut rng);
});
}
if start_time.to(PreciseTime::now()) > max_time {
break;
}
}
let command = command_scores.iter().max_by_key(|&c| c.win_ratio());
#[cfg(feature = "benchmarking")]
{
let total_iterations: u32 = command_scores.iter().map(|c| c.attempts).sum();
println!("Iterations: {}", total_iterations);
}
match command {
Some(command) => command.command,
_ => Command::Nothing
}
}
fn simulate_to_endstate<R: Rng>(command_score: &mut CommandScore, settings: &GameSettings, state: &GameState, rng: &mut R) {
let opponent_first = random_opponent_move(settings, state, rng);
let mut state_mut = state.simulate(settings, command_score.command, opponent_first);
for _ in 0..MAX_MOVES {
if state_mut.status != GameStatus::Continue {
break;
}
let player_command = random_player_move(settings, &state_mut, rng);
let opponent_command = random_opponent_move(settings, &state_mut, rng);
state_mut.simulate_mut(settings, player_command, opponent_command);
}
let next_seed = [rng.next_u32(), rng.next_u32(), rng.next_u32(), rng.next_u32()];
match state_mut.status {
GameStatus::PlayerWon => command_score.add_victory(next_seed),
GameStatus::OpponentWon => command_score.add_defeat(next_seed),
GameStatus::Continue => command_score.add_stalemate(next_seed),
GameStatus::Draw => command_score.add_draw(next_seed)
}
}
fn random_player_move<R: Rng>(settings: &GameSettings, state: &GameState, rng: &mut R) -> Command {
let all_buildings = state.player_affordable_buildings(settings);
random_move(&state.unoccupied_player_cells, &all_buildings, rng)
}
fn random_opponent_move<R: Rng>(settings: &GameSettings, state: &GameState, rng: &mut R) -> Command {
let all_buildings = state.opponent_affordable_buildings(settings);
random_move(&state.unoccupied_opponent_cells, &all_buildings, rng)
}
fn random_move<R: Rng>(all_positions: &[Point], all_buildings: &[BuildingType], rng: &mut R) -> Command {
let number_of_commands = all_positions.len()*all_buildings.len()+1;
let choice_index = rng.gen_range(0, number_of_commands);
if choice_index == number_of_commands - 1 {
Command::Nothing
} else {
Command::Build(
all_positions[choice_index/all_buildings.len()],
all_buildings[choice_index%all_buildings.len()]
)
}
}
#[derive(Debug)]
struct CommandScore {
command: Command,
victories: u32,
defeats: u32,
draws: u32,
stalemates: u32,
attempts: u32,
next_seed: [u32; 4]
}
impl CommandScore {
fn new(command: Command) -> CommandScore {
CommandScore {
command,
victories: 0,
defeats: 0,
draws: 0,
stalemates: 0,
attempts: 0,
next_seed: [0x7b6a_e1f4, 0x413c_e90f, 0x6781_6799, 0x770a_6bda]
}
}
fn add_victory(&mut self, next_seed: [u32; 4]) {
self.victories += 1;
self.attempts += 1;
self.next_seed = next_seed;
}
fn add_defeat(&mut self, next_seed: [u32; 4]) {
self.defeats += 1;
self.attempts += 1;
self.next_seed = next_seed;
}
fn add_draw(&mut self, next_seed: [u32; 4]) {
self.draws += 1;
self.attempts += 1;
self.next_seed = next_seed;
}
fn add_stalemate(&mut self, next_seed: [u32; 4]) {
self.stalemates += 1;
self.attempts += 1;
self.next_seed = next_seed;
}
fn win_ratio(&self) -> i32 {
(self.victories as i32 - self.defeats as i32) * 10000 / (self.attempts as i32)
}
fn init_command_scores(settings: &GameSettings, state: &GameState) -> Vec<CommandScore> {
let all_buildings = state.player_affordable_buildings(settings);
let mut commands = Vec::with_capacity(state.unoccupied_player_cells.len()*all_buildings.len()+1);
commands.push(CommandScore::new(Command::Nothing));
for &position in &state.unoccupied_player_cells {
for &building in &all_buildings {
commands.push(CommandScore::new(Command::Build(position, building)));
}
}
commands
}
}
|
