mirror of
https://github.com/Noratrieb/minmax.git
synced 2026-01-14 23:35:04 +01:00
minmax
This commit is contained in:
parent
5c95aa7536
commit
7f3a0e5ad2
3 changed files with 127 additions and 3 deletions
93
src/minmax.rs
Normal file
93
src/minmax.rs
Normal file
|
|
@ -0,0 +1,93 @@
|
|||
use std::ops::Neg;
|
||||
|
||||
use crate::{Game, GamePlayer, Player, State};
|
||||
|
||||
pub trait GameBoard {
|
||||
type Move: Copy;
|
||||
|
||||
fn possible_moves(&self) -> impl Iterator<Item = Self::Move>;
|
||||
|
||||
fn result(&self) -> State;
|
||||
|
||||
fn make_move(&mut self, position: Self::Move, player: Player);
|
||||
|
||||
fn undo_move(&mut self, position: Self::Move);
|
||||
}
|
||||
|
||||
#[derive(Debug, PartialEq, Eq, PartialOrd, Ord)]
|
||||
pub struct Score(i8);
|
||||
|
||||
impl Score {
|
||||
const LOST: Self = Self(i8::MIN);
|
||||
const TIE: Self = Self(0);
|
||||
const WON: Self = Self(i8::MAX);
|
||||
}
|
||||
|
||||
impl Neg for Score {
|
||||
type Output = Self;
|
||||
|
||||
fn neg(self) -> Self::Output {
|
||||
Self(-self.0)
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Clone)]
|
||||
pub struct PerfectPlayer<B: GameBoard> {
|
||||
best_move: Option<B::Move>,
|
||||
}
|
||||
|
||||
impl<B: GameBoard> Default for PerfectPlayer<B> {
|
||||
fn default() -> Self {
|
||||
Self::new()
|
||||
}
|
||||
}
|
||||
|
||||
impl<B: GameBoard> PerfectPlayer<B> {
|
||||
pub fn new() -> Self {
|
||||
Self { best_move: None }
|
||||
}
|
||||
|
||||
fn minmax(&mut self, board: &mut B, player: Player, depth: usize) -> Score {
|
||||
if depth < 2 {
|
||||
//print!("{board}{}| playing {player}: ", " ".repeat(depth));
|
||||
}
|
||||
match board.result() {
|
||||
State::Winner(winner) => {
|
||||
if winner == player {
|
||||
Score::WON
|
||||
} else {
|
||||
Score::LOST
|
||||
}
|
||||
}
|
||||
State::Draw => Score::TIE,
|
||||
State::InProgress => {
|
||||
let mut max_value = Score::LOST;
|
||||
|
||||
for pos in board.possible_moves() {
|
||||
board.make_move(pos, player);
|
||||
let value = -self.minmax(board, player.opponent(), depth + 1);
|
||||
|
||||
board.undo_move(pos);
|
||||
|
||||
if value > max_value {
|
||||
max_value = value;
|
||||
if depth == 0 {
|
||||
self.best_move = Some(pos);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
max_value
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl<G: Game> GamePlayer<G> for PerfectPlayer<G::Board> {
|
||||
fn next_move(&mut self, board: &mut G::Board, this_player: Player) {
|
||||
self.best_move = None;
|
||||
self.minmax(board, this_player, 0);
|
||||
|
||||
board.make_move(self.best_move.expect("could not make move"), this_player);
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue