[−][src]Struct rusty_rubik::solver::IDASolver
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>[src]
pub fn new(state: CubeState, tables: &'a PruningTables) -> Self[src]
Trait Implementations
impl<'_> Solver for IDASolver<'_>[src]
fn get_start_state(&self) -> &CubeState[src]
fn solve(&self) -> MoveSequence[src]
Auto Trait Implementations
impl<'a> RefUnwindSafe for IDASolver<'a>
impl<'a> Send for IDASolver<'a>
impl<'a> Sync for IDASolver<'a>
impl<'a> Unpin for IDASolver<'a>
impl<'a> UnwindSafe for IDASolver<'a>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,