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 SUPER type puzzles. |
31 | * @author <a href="http://sourceforge.net/users/stevensa">Andrew Stevens</a> |
32 | */ |
33 | public class SuperSolver extends AbstractSolver { |
34 | /** Log4J logger */ |
35 | private static final org.apache.log4j.Logger log = |
36 | org.apache.log4j.LogManager.getLogger(SuperSolver.class); |
37 | |
38 | /** |
39 | * Creates a new instance of SuperSolver |
40 | */ |
41 | public SuperSolver(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 < 4; i++) { |
64 | for (int j = 1; j <= maxint; j++) { |
65 | Region superRow = regions.get("superRow-" + i); |
66 | counters.put("superRowIndicatorCount-" + i + "-" + j, |
67 | new RegionValueIndicatorCounter(superRow, j)); |
68 | } |
69 | } |
70 | for (int i = 0; i < 3; i++) { |
71 | for (int j = 1; j <= maxint; j++) { |
72 | Region superColumn = regions.get("superColumn-" + i); |
73 | counters.put("superColumnIndicatorCount-" + i + "-" + j, |
74 | new RegionValueIndicatorCounter(superColumn, j)); |
75 | } |
76 | } |
77 | for (Coordinate coord : grid.keySet()) { |
78 | // // only care about cells that aren't already filled |
79 | // if (Integer.valueOf(0).equals(grid.get(coord))) { |
80 | Region cellRegions = new Region(); |
81 | // find all the Rows, Columns & Boxes that contain this cell |
82 | for (Region region : regions.values()) { |
83 | if (region.contains(coord) && region.getName() != null && |
84 | (region.getName().startsWith("Row ") || |
85 | region.getName().startsWith("Column ") || |
86 | region.getName().startsWith("Box "))) { |
87 | cellRegions.addAll(region); |
88 | } |
89 | } |
90 | counters.put("cellPossibilitiesCount-" + coord.getRow() + "-" + coord.getColumn(), |
91 | new CellPossibilitiesCounter(coord, maxint, cellRegions)); |
92 | // } |
93 | } |
94 | } |
95 | |
96 | protected void setupStrategies(Puzzle puzzle) { |
97 | Map<String, Region> regions = puzzle.getRegions(); |
98 | int maxint = puzzle.getMaxInt(); |
99 | |
100 | log.debug("Setting up strategies"); |
101 | for (int i = 0; i < maxint; i++) { |
102 | strategies.add(new GapFillRegionStrategy(grid, counters.get("rowValueCount-" + i), |
103 | regions.get("row-" + i), maxint)); |
104 | strategies.add(new GapFillRegionStrategy(grid, counters.get("columnValueCount-" + i), |
105 | regions.get("column-" + i), maxint)); |
106 | strategies.add(new GapFillRegionStrategy(grid, counters.get("boxValueCount-" + i), |
107 | regions.get("box-" + i), maxint)); |
108 | } |
109 | for (int i = 0; i < maxint; i++) { |
110 | strategies.add(new ScanRowsStrategy(0, i + 1, 0, 2, grid, counters, 0, 2, 4)); |
111 | strategies.add(new ScanRowsStrategy(1, i + 1, 3, 5, grid, counters, 3, 5, 4)); |
112 | strategies.add(new ScanRowsStrategy(2, i + 1, 6, 8, grid, counters, 6, 8, 4)); |
113 | strategies.add(new ScanRowsStrategy(3, i + 1, 9, 11, grid, counters, 9, 11, 4)); |
114 | strategies.add(new ScanColumnsStrategy(0, i + 1, 0, 3, grid, counters, 0, 9, 3, 3)); |
115 | strategies.add(new ScanColumnsStrategy(1, i + 1, 4, 7, grid, counters, 1, 10, 3, 3)); |
116 | strategies.add(new ScanColumnsStrategy(2, i + 1, 8, 11, grid, counters, 2, 11, 3, 3)); |
117 | } |
118 | for (Coordinate coord : grid.keySet()) { |
119 | // only care about cells that aren't already filled |
120 | if (Integer.valueOf(0).equals(grid.get(coord))) { |
121 | strategies.add(new SingleCellStrategy(coord, grid, |
122 | counters.get("cellPossibilitiesCount-" + coord.getRow() + "-" + coord.getColumn()))); |
123 | } |
124 | } |
125 | for (int i = 0; i < maxint; i++) { |
126 | for (int j = 1; j <= maxint; j++) { |
127 | strategies.add(new ValuePossibilitiesStrategy(regions.get("row-" + i), j, |
128 | (RegionValueIndicatorCounter) counters.get("rowIndicatorCount-" + i + "-" + j), |
129 | counters)); |
130 | strategies.add(new ValuePossibilitiesStrategy(regions.get("column-" + i), j, |
131 | (RegionValueIndicatorCounter) counters.get("columnIndicatorCount-" + i + "-" + j), |
132 | counters)); |
133 | strategies.add(new ValuePossibilitiesStrategy(regions.get("box-" + i), j, |
134 | (RegionValueIndicatorCounter) counters.get("boxIndicatorCount-" + i + "-" + j), |
135 | counters)); |
136 | } |
137 | } |
138 | } |
139 | |
140 | } |