| 1 | /* |
| 2 | * Copyright (c) 2005 The PseudoQ Project. |
| 3 | * |
| 4 | * This file is part of PseudoQ. |
| 5 | * |
| 6 | * PseudoQ is free software; you can redistribute it and/or modify |
| 7 | * it under the terms of the GNU Lesser General Public License as published by |
| 8 | * the Free Software Foundation; either version 2.1 of the License, or |
| 9 | * (at your option) any later version. |
| 10 | * |
| 11 | * PseudoQ is distributed in the hope that it will be useful, |
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 | * GNU Lesser General Public License for more details. |
| 15 | * |
| 16 | * You should have received a copy of the GNU Lesser General Public License |
| 17 | * along with PseudoQ; if not, write to the Free Software |
| 18 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA |
| 19 | */ |
| 20 | |
| 21 | package net.sourceforge.pseudoq.solver; |
| 22 | |
| 23 | import java.util.Map; |
| 24 | |
| 25 | import net.sourceforge.pseudoq.model.Coordinate; |
| 26 | import net.sourceforge.pseudoq.model.Puzzle; |
| 27 | import net.sourceforge.pseudoq.model.Region; |
| 28 | |
| 29 | /** |
| 30 | * Solver for TINY type puzzles. |
| 31 | * @author <a href="http://sourceforge.net/users/stevensa">Andrew Stevens</a> |
| 32 | */ |
| 33 | public class TinySolver extends AbstractSolver { |
| 34 | /** Log4J logger */ |
| 35 | private static final org.apache.log4j.Logger log = |
| 36 | org.apache.log4j.LogManager.getLogger(TinySolver.class); |
| 37 | |
| 38 | /** |
| 39 | * Creates a new instance of TinySolver |
| 40 | */ |
| 41 | public TinySolver(Puzzle puzzle) { |
| 42 | super(puzzle); |
| 43 | } |
| 44 | |
| 45 | protected void setupCounters(Puzzle puzzle) { |
| 46 | Map<String, Region> regions = puzzle.getRegions(); |
| 47 | int maxint = puzzle.getMaxInt(); |
| 48 | |
| 49 | log.debug("Setting up counters"); |
| 50 | for (int i = 0; i < maxint; i++) { |
| 51 | counters.put("rowValueCount-" + i, new RegionValueCounter(regions.get("row-" + i))); |
| 52 | counters.put("columnValueCount-" + i, new RegionValueCounter(regions.get("column-" + i))); |
| 53 | counters.put("boxValueCount-" + i, new RegionValueCounter(regions.get("box-" + i))); |
| 54 | for (int j = 1; j <= maxint; j++) { |
| 55 | counters.put("rowIndicatorCount-" + i + "-" + j, |
| 56 | new RegionValueIndicatorCounter(regions.get("row-" + i), j)); |
| 57 | counters.put("columnIndicatorCount-" + i + "-" + j, |
| 58 | new RegionValueIndicatorCounter(regions.get("column-" + i), j)); |
| 59 | counters.put("boxIndicatorCount-" + i + "-" + j, |
| 60 | new RegionValueIndicatorCounter(regions.get("box-" + i), j)); |
| 61 | } |
| 62 | } |
| 63 | for (int i = 0; i < 2; i++) { |
| 64 | for (int j = 1; j <= maxint; j++) { |
| 65 | counters.put("superRowIndicatorCount-" + i + "-" + j, |
| 66 | new RegionValueIndicatorCounter(regions.get("superRow-" + i), j)); |
| 67 | counters.put("superColumnIndicatorCount-" + i + "-" + j, |
| 68 | new RegionValueIndicatorCounter(regions.get("superColumn-" + i), j)); |
| 69 | } |
| 70 | } |
| 71 | for (Coordinate coord : grid.keySet()) { |
| 72 | // only care about cells that aren't already filled |
| 73 | if (Integer.valueOf(0).equals(grid.get(coord))) { |
| 74 | Region cellRegions = new Region(); |
| 75 | // find all the Rows, Columns & Boxes that contain this cell |
| 76 | for (Region region : regions.values()) { |
| 77 | if (region.contains(coord) && region.getName() != null && |
| 78 | (region.getName().startsWith("Row ") || |
| 79 | region.getName().startsWith("Column ") || |
| 80 | region.getName().startsWith("Box "))) { |
| 81 | cellRegions.addAll(region); |
| 82 | } |
| 83 | } |
| 84 | counters.put("cellPossibilitiesCount-" + coord.getRow() + "-" + coord.getColumn(), |
| 85 | new CellPossibilitiesCounter(coord, maxint, cellRegions)); |
| 86 | } |
| 87 | } |
| 88 | } |
| 89 | |
| 90 | protected void setupStrategies(Puzzle puzzle) { |
| 91 | Map<String, Region> regions = puzzle.getRegions(); |
| 92 | int maxint = puzzle.getMaxInt(); |
| 93 | |
| 94 | log.debug("Setting up strategies"); |
| 95 | for (int i = 0; i < maxint; i++) { |
| 96 | strategies.add(new GapFillRegionStrategy(grid,counters.get("rowValueCount-" + i), |
| 97 | regions.get("row-" + i), maxint)); |
| 98 | strategies.add(new GapFillRegionStrategy(grid, counters.get("columnValueCount-" + i), |
| 99 | regions.get("column-" + i), maxint)); |
| 100 | strategies.add(new GapFillRegionStrategy(grid, counters.get("boxValueCount-" + i), |
| 101 | regions.get("box-" + i), maxint)); |
| 102 | } |
| 103 | for (int i = 0; i < maxint; i++) { |
| 104 | strategies.add(new ScanRowsStrategy(0, i + 1, 0, 1, grid, counters, 0, 1, 2)); |
| 105 | strategies.add(new ScanColumnsStrategy(0, i + 1, 0, 1, grid, counters, 0, 2, 2, 2)); |
| 106 | strategies.add(new ScanRowsStrategy(1, i + 1, 2, 3, grid, counters, 2, 3, 2)); |
| 107 | strategies.add(new ScanColumnsStrategy(1, i + 1, 2, 3, grid, counters, 1, 3, 2, 2)); |
| 108 | } |
| 109 | for (Coordinate coord : grid.keySet()) { |
| 110 | // only care about cells that aren't already filled |
| 111 | if (Integer.valueOf(0).equals(grid.get(coord))) { |
| 112 | strategies.add(new SingleCellStrategy(coord, grid, |
| 113 | counters.get("cellPossibilitiesCount-" + coord.getRow() + "-" + coord.getColumn()))); |
| 114 | } |
| 115 | } |
| 116 | } |
| 117 | |
| 118 | } |