Struct AtaxxTileHeuristic

pub struct AtaxxTileHeuristic {
    pub tile_factor: i32,
    pub surface_factor: i32,
}

Fields

tile_factor: i32

surface_factor: i32

Implementations

impl AtaxxTileHeuristic

pub fn new(tile_factor: i32, surface_factor: i32) -> Self

pub fn greedy() -> Self

Trait Implementations

impl Debug for AtaxxTileHeuristic

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

Formats the value using the given formatter.

impl Default for AtaxxTileHeuristic

fn default() -> Self

Returns the “default value” for a type.

impl Heuristic<AtaxxBoard> for AtaxxTileHeuristic

type V = i32

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

fn value(&self, board: &AtaxxBoard, length: u32) -> Self::V

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: Self::V, new: Self::V) -> (Self::V, 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.