[−][src]Trait quickbacktrack::Puzzle
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: Copy + Debug + PartialEq
The type of values stored in the puzzle.
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.
Provided methods
fn solve_simple<F: FnMut(&mut Self, Self::Pos, Self::Val)>(&mut self, _f: F)
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.