Struct PruningTables

pub struct PruningTables {
    pub corners: Vec<u8>,
    pub eo: Vec<u8>,
    pub ep: Vec<u8>,
}

A struct holding pruning information for certain subgroups of the Rubik’s Cube.

Each pruning table provides a lower bound on how many moves are needed to transform a given state into the solved state within each subgroup. These tables are obtained from pruning.rs.

Fields

corners: Vec<u8>

A pruning table representing the subgroup of corner permutation and orientation.

eo: Vec<u8>

A pruning table representing the subgroup of edge orientation.

ep: Vec<u8>

A pruning table representing the subgroup of edge permutation.

Implementations

impl PruningTables

pub fn default_tables() -> Self

Reads the default pruning tables from the default file names.

pub fn compute_h_value(&self, state: &CubeState) -> u8

Computes a lower bound on the number of moves needed to solve the given state, based on the pruning table values.