universe@3: /*
universe@3:  * Copyright 2013 Mike Becker. All rights reserved.
universe@3:  * 
universe@3:  * Redistribution and use in source and binary forms, with or without
universe@3:  * modification, are permitted provided that the following conditions are met:
universe@3:  * 
universe@3:  * 1. Redistributions of source code must retain the above copyright
universe@3:  *    notice, this list of conditions and the following disclaimer.
universe@3:  * 
universe@3:  * 2. Redistributions in binary form must reproduce the above copyright
universe@3:  *    notice, this list of conditions and the following disclaimer in the
universe@3:  *    documentation and/or other materials provided with the distribution.
universe@3:  * 
universe@3:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@3:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@3:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@3:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@3:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@3:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@3:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@3:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@3:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@3:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@3:  * POSSIBILITY OF SUCH DAMAGE.
universe@3:  */
universe@3: 
universe@2: package de.uapcore.sudoku;
universe@2: 
universe@2: /**
universe@2:  *
universe@2:  * @author mike
universe@2:  */
universe@2: public final class Solver {
universe@2:     
universe@2:     public Solver() {
universe@2:     }
universe@2:     
universe@2:     public boolean check(Field f) {
universe@2:         int line[];
universe@2:         for (int i = 0 ; i < 9 ; i++) {
universe@5:             line = f.getRow(i);
universe@2:             if (!valid(line)) {
universe@2:                 return false;
universe@2:             }
universe@5:             line = f.getColumn(i);
universe@2:             if (!valid(line)) {
universe@2:                 return false;
universe@2:             }
universe@2:         }
universe@2:         
universe@2:         int square[][];
universe@2:         for (int x = 0 ; x < 3 ; x++) {
universe@2:             for (int y = 0 ; y < 3 ; y++) {
universe@5:                 square = f.getSquare(x, y);
universe@2:                 if (!valid(square)) {
universe@2:                     return false;
universe@2:                 }
universe@2:             }
universe@2:         }
universe@2:         
universe@2:         return true;
universe@2:     }
universe@2:     
universe@2:     private boolean complete(int[][] square) {
universe@2:         for (int x = 0 ; x < 3 ; x++) {
universe@2:             for (int y = 0 ; y < 3 ; y++) {
universe@2:                 if (square[x][y] == 0) {
universe@2:                     return false;
universe@2:                 }
universe@2:             }    
universe@2:         }
universe@2:         return true;
universe@2:     }
universe@2:     
universe@2:     private boolean complete(int[] line) {
universe@2:         for (int i = 0 ; i < 9 ; i++) {
universe@2:             if (line[i] == 0) {
universe@2:                 return false;
universe@2:             }
universe@2:         }
universe@2:         return true;
universe@2:     }
universe@2:     
universe@2:     private boolean valid(int[] line) {
universe@5:         int numbers[];
universe@5:         numbers = new int[9];
universe@2:         for (int i = 0 ; i < 9 ; i++) {
universe@2:             int l = line[i]-1;
universe@2:             if (l >= 0) {
universe@5:                 if ((++numbers[l]) > 1) {
universe@2:                     return false;
universe@2:                 }
universe@2:             }
universe@2:         }
universe@2:         
universe@2:         return true;
universe@2:     }
universe@2:     
universe@2:     private boolean valid(int[][] square) {
universe@2:         int[] line = new int[9];
universe@2:         for (int x = 0 ; x < 3 ; x++) {
universe@5:             System.arraycopy(square[x], 0, line, 3*x, 3);
universe@2:         }
universe@2:         return valid(line);
universe@2:     }
universe@2: }