[−][src]Trait graph_solver::Puzzle

pub trait Puzzle: Clone {
    type Pos: Copy + Debug;
    type Val: PartialEq<Self::Val> + Copy + Debug;
    fn set(&mut self, pos: Self::Pos, val: Self::Val);

    fn get(&self, pos: Self::Pos) -> Self::Val;

    fn print(&self);

    fn is_solved(&self) -> bool;

    fn remove(&mut self, other: &Self);

    fn solve_simple<F>(&mut self, _f: F)
    where
        F: FnMut(&mut Self, Self::Pos, Self::Val),
    { ... }
}

Implemented by puzzles.

A puzzle stores the state of the problem, and can be modified by inserting a value at a position within the puzzle. The solver does not understand the internal structure of the puzzle, but is still able to find a solution (if any exists).

The initial state does not have to empty, and you can get the difference at the end by setting SolveSettings::difference(true).

Associated Types

type Pos: Copy + Debug

The type of position.

type Val: PartialEq<Self::Val> + Copy + Debug

The type of values stored in the puzzle.

Loading content...

Required methods

fn set(&mut self, pos: Self::Pos, val: Self::Val)

Sets a value at position.

fn get(&self, pos: Self::Pos) -> Self::Val

Gets value at position.

fn print(&self)

Print puzzle out to standard output.

fn is_solved(&self) -> bool

Whether puzzle is solved.

fn remove(&mut self, other: &Self)

Removes values from other puzzle to show changes.

Loading content...

Provided methods

fn solve_simple<F>(&mut self, _f: F) where
    F: FnMut(&mut Self, Self::Pos, Self::Val), 

Solve simple stuff faster. This will reduce the number of steps in solution. If you do not know how to solve this, leave it empty.

Call the closure when making a simple choice.

Loading content...

Implementors

impl Puzzle for Graph[src]

type Pos = (usize, usize)

type Val = Color

Loading content...