Struct BeamSearchResult 

pub struct BeamSearchResult {
    pub best_leaf: Option<BeamLeaf>,
    pub terminal_leaves: Vec<BeamLeaf>,
    pub reached_terminal: bool,
    pub max_depth_reached: u32,
    pub stats: BeamStats,
    pub root_player: u8,
    pub frontier_leaves: Vec<BeamLeaf>,
}

Result of a beam search run.

Fields

best_leaf: Option<BeamLeaf>

Best leaf for the ROOT player to move.

terminal_leaves: Vec<BeamLeaf>

All terminals discovered, best first (root-player perspective).

reached_terminal: bool

max_depth_reached: u32

stats: BeamStats

root_player: u8

Player to move at the root.

frontier_leaves: Vec<BeamLeaf>

Non-terminal leaves still live at max_depth_reached; empty once the search fully resolves (reached_terminal is true).

Implementations

impl BeamSearchResult

pub fn ranked_root_moves(&self, top_k: Option<usize>) -> Vec<RankedRootMove>

Aggregate every collected leaf by its first move from the root.

Groups terminal_leaves and frontier_leaves by the first move of each leaf’s principal variation and summarizes each group’s value from the root player’s perspective. See RankedRootMove for the caveat: these are beam-sampled statistics, not proven minimax values.

Trait Implementations

impl Clone for BeamSearchResult

fn clone(&self) -> BeamSearchResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BeamSearchResult

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

Formats the value using the given formatter.

impl PartialEq for BeamSearchResult

fn eq(&self, other: &BeamSearchResult) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for BeamSearchResult