Noratrieb/minmax
1
0
Fork 0
mirror of https://github.com/Noratrieb/minmax.git synced 2026-01-16 08:15:04 +01:00
Code Issues Projects Releases Packages Wiki Activity Actions

tests

Browse source
This commit is contained in:
nora 2023-01-14 18:42:54 +01:00
parent 36fb1a5d3b
commit d3973cc96f
5 changed files with 125 additions and 64 deletions
Download patch file Download diff file Expand all files Collapse all files

9
minmax-rs/src/tic_tac_toe/board.rs
View file

@ -138,8 +138,13 @@ impl Game for TicTacToe {
TicTacToe::result(self)
}
fn rate(&self, _: Player) -> Score {
unimplemented!("we always finish the board")
fn rate(&self, player: Player) -> Score {
match self.result() {
State::Winner(winner) if player == winner => Score::WON,
State::Winner(_) => Score::LOST,
State::InProgress => Score::TIE,
State::Draw => Score::TIE,
}
}
fn make_move(&mut self, position: Self::Move, player: Player) {

38
minmax-rs/src/tic_tac_toe/mod.rs
View file

@ -3,41 +3,3 @@ mod game;
mod player;
pub use {board::TicTacToe, player::*};
#[cfg(test)]
mod tests {
use crate::{minmax::PerfectPlayer, tic_tac_toe::board::TicTacToe, GamePlayer, Player};
use crate::player::{GreedyPlayer, RandomPlayer};
fn assert_win_ratio<X: GamePlayer<TicTacToe>, O: GamePlayer<TicTacToe>>(
runs: u64,
x_win_ratio: f64,
x: impl Fn() -> X,
o: impl Fn() -> O,
) {
let mut results = [0u64, 0, 0];
for _ in 0..runs {
let result = TicTacToe::empty().play::<X, O>(&mut x(), &mut o());
let idx = Player::as_u8(result);
results[idx as usize] += 1;
}
let total = results.iter().copied().sum::<u64>();
let ratio = (total as f64) / (results[0] as f64);
println!("{ratio} >= {x_win_ratio}");
assert!(ratio >= x_win_ratio);
}
#[test]
fn perfect_always_beats_greedy() {
assert_win_ratio(1, 1.0, || PerfectPlayer::new(false), || GreedyPlayer);
}
#[test]
fn perfect_beats_random() {
assert_win_ratio(10, 0.95, || PerfectPlayer::new(false), || RandomPlayer);
}
}