From 7a07c7a60d376b92683d6e70c974d90c4a22274a Mon Sep 17 00:00:00 2001
From: Andy Donato <anthony.donato@ymail.com>
Date: Thu, 18 Apr 2019 00:13:09 -0400
Subject: [PATCH] oopsie

---
 test.py | 87 +++++++++++++++++++++++++++++++++------------------------
 1 file changed, 50 insertions(+), 37 deletions(-)

diff --git a/test.py b/test.py
index fd68511..c6747a5 100644
--- a/test.py
+++ b/test.py
@@ -4,43 +4,56 @@
 """
 from constraint import *
 import numpy as np
-<<<<<<< HEAD
+import math
 
 
-def test():
+def test(board):
+    """
+    Return an N by N array that is the solution to the N by N input board
+
+    Uses the python-constraint CSP library. The library solution comes out as a
+    dictionary, but I convert it to an N by N array in the last step
+    """
+    size = len(board)
+    sqrt_size = int(math.sqrt(size))
     problem = Problem()
-    for i in range(81):
-        problem.addVariable(i, [1,2,3,4,5,6,7,8,9])
-
-	rows = np.array([i for i in range(0,9)])
-	cols = np.array([j for j in range(0,81,9)])
-	
-	# Add 27 AllDif constraints, one for each row, column, and box
-	for i in range(9):
-		add = np.ones(9, np.int8)*i*9
-		constr = (rows+add).tolist()
-		problem.addConstraint(AllDifferentConstraint(), constr)
-
-	for i in range(9):
-		add = np.ones(9, np.int8)*i
-		constr = (cols+add).tolist()
-		problem.addConstraint(AllDifferentConstraint(), constr)
-
-	for i in range(0, 7, 3):
-		box = [i, i+1, i+2, i+9, i+10, i+11, i+18, i+19, i+20]
-		problem.addConstraint(AllDifferentConstraint(), box)
-
-	for i in range(27, 34, 3):
-		box = [i, i+1, i+2, i+9, i+10, i+11, i+18, i+19, i+20]
-		problem.addConstraint(AllDifferentConstraint(), box)
-
-	for i in range(54, 61, 3):
-		box = [i, i+1, i+2, i+9, i+10, i+11, i+18, i+19, i+20]
-		problem.addConstraint(AllDifferentConstraint(), box)
-	answer = problem.getSolution()
-	return answer
-
-
-def make_board_from_dict(board):
-	new_board = [[board[i+9*j] for i in range(9)] for j in range(9)]
-  	return new_board
+
+    # Iterate through the input board and add each element as a variable
+    # The domain will be just the value if it's given, or [1, ..., size] otherwise
+    for i in range(size**2):
+        if board[i//size][i % size] == 0:
+            problem.addVariable(i, [i for i in range(1, size+1)])
+        else:
+            problem.addVariable(i, [board[i//size][i % size]])
+
+    rows = np.array([i for i in range(size)])
+    cols = np.array([j for j in range(0, size**2, size)])
+
+    # Create size # of AllDiff constraints for each row
+    for i in range(size):
+        add = np.ones(size, np.int8)*i*size
+        constr = (rows+add).tolist()
+        problem.addConstraint(AllDifferentConstraint(), constr)
+
+    # Create size # of AllDiff constraints for each column
+    for i in range(size):
+        add = np.ones(size, np.int8)*i
+        constr = (cols+add).tolist()
+        problem.addConstraint(AllDifferentConstraint(), constr)
+
+    # Create size # of AllDiff constraints for each box
+    for i in range(sqrt_size):
+        for j in range(sqrt_size):
+            box = []
+            # The top left entry of each box, will be 0, 3, 6, 26, 30, 33, etc for a 9 x 9
+            top_left = size*sqrt_size*i + sqrt_size*j
+            for k in range(sqrt_size):
+                box.extend((top_left+k*size, top_left+k*size+1, top_left+k*size+2))
+            problem.addConstraint(AllDifferentConstraint(), box)
+
+    answer = problem.getSolution()
+
+    # Make an array from the solution dictionary
+    new_board = [[answer[i+size*j] for i in range(size)] for j in range(size)]
+    return new_board
+