Struct backtrack::problems::bit_queens::BitQueens

pub struct BitQueens { /* fields omitted */ }

Implementations

impl BitQueens

pub fn max_n() -> usize

Returns largest solvable size

pub fn new(n: usize) -> Self

Trait Implementations

impl CheckInc<usize> for BitQueens

type Accumulator = QueenField

fn fold_acc(
    &self,
    accu: Option<Self::Accumulator>,
    x: &usize,
    _position: usize
) -> Self::Accumulator

Produce Accumulator for quick-checking next candidates in accu_sat

fn accu_sat(
    &self,
    accu: &Self::Accumulator,
    _x: &usize,
    _position: usize
) -> bool

Check if next value is valid against accumulated checks from fold_acc

impl Debug for BitQueens

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

Formats the value using the given formatter.

impl Scope<'_, usize> for BitQueens

fn size(&self) -> usize

Return number values needed for a complete solution

fn value(&self, index: usize) -> usize

Return value from solution domain

fn len(&self) -> usize

Return number of domain values

fn is_empty(&self) -> bool

fn iter_values(&'a self) -> ScopeIter<'a, T> where
    Self: Sized,