Struct rlifesrc_lib::search::Backjump

pub struct Backjump<R: Rule> {
    level: u32,
    front: Vec<CellRef<R>>,
    learnt: Vec<CellRef<R>>,
}

(Experimental) Adding Backjumping to the original lifesrc algorithm.

Backjumping will reduce the number of steps, but each step will takes a much longer time. The current implementation is slower for most search, only useful for large (e.g., 64x64) still lifes.

Currently it is only supported for non-Generations rules.

Fields

level: u32

The global decision level for assigning the cell state.

front: Vec<CellRef<R>>

All cells in the front.

learnt: Vec<CellRef<R>>

A learnt clause.

Trait Implementations

impl<R: Rule<IsGen = False>> Algorithm<R> for Backjump<R>

type Reason = Reason<R>

Reasons for setting a cell.

type ConflReason = ConflReason<R>

Reasons for a conflict. Ignored in LifeSrc algorithm.

fn new() -> Self

Generate new algorithm data.

fn confl_from_cell(cell: CellRef<R>) -> Self::ConflReason

Conflict when constitifying a cell.

fn confl_from_sym(cell: CellRef<R>, sym: CellRef<R>) -> Self::ConflReason

Conflict from symmetry.

fn init_front(world: World<R, Self>) -> World<R, Self>

Conflict when constitifying a cell.

fn set_cell( world: &mut World<R, Self>, cell: CellRef<R>, state: State, reason: Self::Reason ) -> Result<(), Self::ConflReason>

Sets the state of a cell, push it to the set_stack, and update the neighborhood descriptor of its neighbors.

fn go(world: &mut World<R, Self>, step: &mut u64) -> bool

Keeps proceeding and backtracking, until there are no more cells to examine (and returns true), or the backtracking goes back to the time before the first cell is set (and returns false).

fn retreat(world: &mut World<R, Self>) -> bool

Retreats to the last time when a unknown cell is decided by choice, and switch that cell to the other state.

fn deser_reason( world: &World<R, Self>, ser: &ReasonSer ) -> Result<Self::Reason, Error>

Available on crate feature serde only.

Restore the reason from a ReasonSer.

impl<R: Clone + Rule> Clone for Backjump<R>

fn clone(&self) -> Backjump<R>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<R: Debug + Rule> Debug for Backjump<R>

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

Formats the value using the given formatter.

impl<R: Rule<IsGen = False>> Default for Backjump<R>

fn default() -> Self

Returns the “default value” for a type.

impl<R: PartialEq + Rule> PartialEq for Backjump<R>

fn eq(&self, other: &Backjump<R>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<R: Eq + Rule> Eq for Backjump<R>

impl<R: Rule> Sealed for Backjump<R>

impl<R: Rule> StructuralEq for Backjump<R>

impl<R: Rule> StructuralPartialEq for Backjump<R>