Struct MinimaxEngine 

pub struct MinimaxEngine {
    pub config: MinimaxConfig,
    /* private fields */
}

Alpha-beta negamax search engine over the exact Quantik game tree.

Fields

config: MinimaxConfig

Implementations

impl MinimaxEngine

pub fn new(config: MinimaxConfig) -> Self

pub fn solve(&mut self, state: &State) -> Result<MinimaxResult, String>

Exact solve: Self::search with max_depth = 16 and no time limit.

Every Quantik game resolves (win or no-legal-moves) within 16 plies, so a depth-16 search from any reachable position always terminates on true terminal nodes rather than the heuristic eval cutoff.

pub fn search(&mut self, state: &State) -> Result<MinimaxResult, String>

Iterative-deepening alpha-beta negamax search from state.

Deepens from depth 1 to config.max_depth (or until config.time_limit_s elapses), seeding each iteration’s root move order with the previous iteration’s principal variation. Returns the deepest iteration that completed before any time limit; the depth-1 iteration always runs to completion.