Algorithm(Solution &solution, unsigned int max_iter=0) | BackTrack::Algorithm | |
find_next_solution() | BackTrack::Algorithm | |
free_count | Sudoku::Solver | [private] |
free_list | Sudoku::Solver | [private] |
is_last_at(unsigned int level) const | Sudoku::Solver | [virtual] |
is_last_level(int level) const | Sudoku::Solver | [virtual] |
is_valid_at(int level) const | Sudoku::Solver | [virtual] |
puzzle | Sudoku::Solver | [private] |
random | Sudoku::Solver | [private] |
random_init | Sudoku::Solver | [private] |
reset() | BackTrack::Algorithm | |
reset_at(unsigned int level) | Sudoku::Solver | [virtual] |
set_first_at(unsigned int level) | Sudoku::Solver | [virtual] |
set_next_at(unsigned int level) | Sudoku::Solver | [virtual] |
solution_is_valid() | BackTrack::Algorithm | |
Solver(Puzzle &puzzle, bool random_init=false, unsigned int max_iter=0) | Sudoku::Solver | |
~Solution() | BackTrack::Solution | [inline, virtual] |