pub struct AStarSolver { /* private fields */ }Expand description
A solver implementing the A* search algorithm.
This solver is only able to handle short, small-depth scrambles due to the massive space usage of A* search and similar BFS-style search algorithms. Thus, we strongly recommend using IDASolver instead.
Implementations§
Trait Implementations§
Source§impl Solver for AStarSolver
impl Solver for AStarSolver
Source§fn get_start_state(&self) -> &CubeState
fn get_start_state(&self) -> &CubeState
Gets a reference to the starting configuration.
Source§fn solve(&self) -> MoveSequence
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.
Auto Trait Implementations§
impl Freeze for AStarSolver
impl RefUnwindSafe for AStarSolver
impl Send for AStarSolver
impl Sync for AStarSolver
impl Unpin for AStarSolver
impl UnwindSafe for AStarSolver
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more