+/IBCS

git clone https://git.julia.blue/+/IBCS

Joseph Ryanadd final projectc6bf06e

master
1.7 KiB57 linesraw
1import numpy as np
2
3#a = raw_input()
4inputData = ["4321, 412341, 32, 22, 12, 1222"]
5a = inputData[0]
6a = [i.strip() for i in a.split(',')]
7boardSize = len(a[0])
8board = [[0] + [int(i) for i in a[0]] + [0]]
9for i in a[1:-1]:
10    board.append([int(i[0])] + [-1] * boardSize + [int(i[-1])])
11board.append([0] + [int(i) for i in a[-1]] + [0])
12board = np.array(board)
13isValid = lambda n: [n[i] > max(n[1:i]) if i > 1 else True for i in range(1, boardSize + 1)].count(True) == n[0]
14answer = []
15
16
17def checkBoard(n):
18    temp = [n[1:-1], n.T[1:-1]]
19    for i in temp:
20        if False in [len([k for k in j[1:-1] if k != -1]) == len(set([k for k in j[1:-1] if k != -1])) for j in i]:
21            return False
22        for j in i:
23            if not(isValid(j) and isValid(j[::-1])) and -1 not in j:
24                return False
25    return True
26
27
28def prune(node):
29    global answer
30    if node.children == []:
31        if sum([i.count(-1) for i in node.b.tolist()]) != 0:
32            return False
33        else:
34            answer = node.b
35            return True
36    return True in [prune(i) for i in node.children]
37
38
39class State:
40
41    def __init__(self, newBoard):
42        self.children = []
43        self.b = newBoard
44        for i in range(boardSize):
45            for j in range(boardSize):
46                if self.b[i + 1][j + 1] == -1:
47                    for k in range(boardSize):
48                        temp = np.copy(self.b)
49                        temp[i + 1][j + 1] = k + 1
50                        if checkBoard(temp):
51                            self.children.append(State(temp))
52                    return
53
54head = State(board)
55prune(head)
56for i in inputData[1:]:
57    print answer[int(i[0])][int(i[-1])]