Struct GameSum 

pub struct GameSum<'a, G, const MISERE: bool = false> {
    game: &'a mut G,
}

Fields

game: &'a mut G

Implementations

impl<'a, 'g, G> GameSum<'a, ImpartialGraph<'g, G>>

where G: Graph + VertexMap<Option<usize>>,

pub fn grundy(self) -> GameAnalysis<'a, ImpartialGraph<'g, G>, [G::Vertex], u64>

impl<'a, 'g, G, const MISERE: bool> GameSum<'a, ImpartialGraph<'g, G>, MISERE>

where G: Graph + VertexMap<Option<usize>>,

pub fn outcome( self, ) -> GameAnalysis<'a, ImpartialGraph<'g, G>, [G::Vertex], GameOutcome, MISERE>

Normal play combines generalized Grundy values, including cyclic positions. Misere explores the sum graph, which can grow exponentially in the component count.

impl<'a, S, L, F, I> GameSum<'a, Impartial<S, F>>

where S: Clone + Eq + Hash, F: FnMut(&S) -> I, I: IntoIterator<Item = Neighbor<S, L>>,

pub fn grundy(self) -> GameAnalysis<'a, Impartial<S, F>, [S], u64>

impl<'a, S, L, F, I, const MISERE: bool> GameSum<'a, Impartial<S, F>, MISERE>

where S: Clone + Eq + Hash, F: FnMut(&S) -> I, I: IntoIterator<Item = Neighbor<S, L>>,

pub fn outcome( self, ) -> GameAnalysis<'a, Impartial<S, F>, [S], GameOutcome, MISERE>

impl<'a, S, L, FL, FR, IL, IR> GameSum<'a, Partisan<S, FL, FR>>

where S: Clone + Eq + Hash, FL: FnMut(&S) -> IL, FR: FnMut(&S) -> IR, IL: IntoIterator<Item = Neighbor<S, L>>, IR: IntoIterator<Item = Neighbor<S, L>>,

pub fn value(self) -> GameAnalysis<'a, Partisan<S, FL, FR>, [S], GameValue>

impl<'a, S, L, FL, FR, IL, IR, const MISERE: bool> GameSum<'a, Partisan<S, FL, FR>, MISERE>

where S: Clone + Eq + Hash, FL: FnMut(&S) -> IL, FR: FnMut(&S) -> IR, IL: IntoIterator<Item = Neighbor<S, L>>, IR: IntoIterator<Item = Neighbor<S, L>>,

pub fn outcome( self, ) -> GameAnalysis<'a, Partisan<S, FL, FR>, [S], PartisanOutcome, MISERE>

Explores reachable sum positions, including the player to move. Reuses cached sums of numbers, ups, nimbers and switches in normal play.

impl<'a, G> GameSum<'a, G>

pub fn misere(self) -> GameSum<'a, G, true>