Main Page | Class Hierarchy | Class List | File List | Class Members

LeastCandidatesStrategy Class Reference

#include <LeastCandidatesStrategy.h>

Inheritance diagram for LeastCandidatesStrategy:

Strategy List of all members.

Detailed Description

A strategy for solving Sudoku puzzles that chooses as a start cell the last cell found having the least number of candidates.


Public Member Functions

 LeastCandidatesStrategy (const Puzzle &p)
 Constructs a LeastCandidatesStrategy for solving the given Puzzle.

 ~LeastCandidatesStrategy ()
 Destructor.

void setStartCell (size_t &x, size_t &y)
 Sets the start cell for this Strategy's Puzzle.


Private Member Functions

 LeastCandidatesStrategy (const LeastCandidatesStrategy &l)
 Copy constructor.

LeastCandidatesStrategyoperator= (const LeastCandidatesStrategy &l)
 Assignment operator.


Constructor & Destructor Documentation

LeastCandidatesStrategy::LeastCandidatesStrategy const LeastCandidatesStrategy l  )  [private]
 

Copy constructor.

Not implemented.


Member Function Documentation

LeastCandidatesStrategy& LeastCandidatesStrategy::operator= const LeastCandidatesStrategy l  )  [private]
 

Assignment operator.

Not implemented.


The documentation for this class was generated from the following files:
Generated on Tue Aug 2 12:58:48 2005 for Generalized Sudoku Puzzle Solver by doxygen 1.3.4