Examples of NakedSubsetUpdater

com.barrybecker4.puzzle.sudoku.model.update.updaters.NakedSubsetUpdater

The idea with this updater is that we want to find a set of n cells that contain only a subset of n digits. If we can do that, then all other cells in that row/col/bigCell can have that set of n digits removed as candidates. This is a generalization of the twins and triplets solvers described in the Sudoku Programming book. Grandma wrote: Would the twins be easier to think about if you look for n cells containing some subset of the same n digits? Is that clear? Here n would be 2, ..., N-2. See two cells with BD in the 10th row of the last grid you sent me. See also the lower left BigCell where 6 cells contain some subset of {1,5,8,0,D,E}. Then this would mean that the two cells in that mini grid can't contain any of these 6 digits. @author Barry Becker

    private List<IUpdater> createUpdaters(Board board) {
        List<IUpdater> updaters = new ArrayList<IUpdater>();
        updaters.add(new StandardCRBUpdater(board));
        updaters.add(new LoneRangerUpdater(board));
        updaters.add(new BigCellScoutUpdater(board));
        updaters.add(new NakedSubsetUpdater(board));
        return updaters;
    }

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of NakedSubsetUpdater

Examples of com.barrybecker4.puzzle.sudoku.model.update.updaters.NakedSubsetUpdater