Struct IDASolver

pub struct IDASolver<'a> { /* private fields */ }

A solver implementing the iterative deepening A* search algorithm [Korf, 1997].

This solver uses the pruning tables pre-computed in pruning.rs to prevent the solver from exploring move sequences that will yield suboptimal solutions. This is the method typically implemented in most optimal Rubik’s Cube solvers.

Implementations

impl<'a> IDASolver<'a>

pub fn new(state: CubeState, tables: &'a PruningTables) -> Self

Trait Implementations

impl Solver for IDASolver<'_>

fn get_start_state(&self) -> &CubeState

Gets a reference to the starting configuration.

fn solve(&self) -> MoveSequence

Applies the solver-specific search algorithm to find a sequence of moves that transform the starting state into the solved state.