Struct OptimalBot 

pub struct OptimalBot { /* private fields */ }

A Strategy that plays perfectly, backed by a Solver.

The default construction solves lazily: the first decision of a fresh game triggers close to a full solve, which takes seconds in a release build. Use presolved to pay that cost up front, or from_solver to share a table you already built.

Implementations

impl OptimalBot

pub fn new() -> Self

A bot that solves on demand.

pub fn presolved() -> Self

A bot with the whole game solved up front; see Solver::solve.

pub const fn from_solver(solver: Solver) -> Self

A bot backed by an existing solver, keeping its solved states.

pub const fn solver(&mut self) -> &mut Solver

The underlying solver, for inspection or further queries.

Trait Implementations

impl Clone for OptimalBot

fn clone(&self) -> OptimalBot

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for OptimalBot

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for OptimalBot

fn default() -> OptimalBot

Returns the “default value” for a type.

impl Strategy for OptimalBot

fn choose_action(&mut self, view: &View<'_>) -> TurnAction

Decides with rolls remaining: hold and reroll, or score now.

fn choose_category(&mut self, view: &View<'_>) -> Category

Decides after the final roll: which category to score.

fn name(&self) -> &str

A short display name for logs and arenas.