Struct SolverHeuristic 

pub struct SolverHeuristic;

Minimax Heuristic that only looks at board outcomes. When there are multiple winning moves it picks the shortest one, and when there are only losing moves it picks the longest one.

Trait Implementations

impl Debug for SolverHeuristic

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

Formats the value using the given formatter.

impl<B: Board> Heuristic<B> for SolverHeuristic

type V = SolverValue

The type used to represent the heuristic value of a board.

fn value(&self, board: &B, length: u32) -> SolverValue

Return the heuristic value for the given board from the the next player POV. depth is the current depth, the number of moves played since the board the search was started on. Can be used to prefer faster wins or slower losses.

fn merge(old: SolverValue, new: SolverValue) -> (SolverValue, Ordering)

Merge old and new into a new value, and compare their values. For standard minimax searches this can simply be implemented as: (max(old, new), new.cmp(old))

fn value_update( &self, board: &B, board_value: Self::V, board_length: u32, mv: B::Move, child: &B, ) -> Self::V

Return the value of child, given the previous board, its value and the move that was just played. This function can be overridden to improve performance.