+/IBCS
git clone https://git.julia.blue/+/IBCS
c6bf06e
master
1import numpy as np 2 3#a = raw_input() 4inputData = ["4321, 412341, 32, 22, 12, 1222" , 5"2124, 23, 13, 22, 41, 3321" , 6"1233, 14, 22, 41, 22, 2312" , 7"33213, 42, 23 ,15, 22, 21, 22341" , 8"23312, 22, 15, 33, 41, 23, 21332" ] 9for a in inputData : 10"input:" ,a 11a = [i .strip ()for i in a .split (',' )] 12boardSize = len (a [0 ]) 13board = [[0 ]+ [int (i )for i in a [0 ]]+ [0 ]] 14for i in a [1 :- 1 ]: 15board .append ([int (i [0 ])]+ [- 1 ]* boardSize + [int (i [- 1 ])]) 16board .append ([0 ]+ [int (i )for i in a [- 1 ]]+ [0 ]) 17board = np .array (board ) 18isValid = lambda n : [n [i ]> max (n [1 :i ])if i > 1 else True for i in range (1 ,boardSize + 1 )].count (True )== n [0 ] 19 20def checkBoard (n ): 21temp = [n [1 :- 1 ],n .T [1 :- 1 ]] 22for i in temp : 23if 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 ]: 24return False 25for j in i : 26if not (isValid (j )and isValid (j [::- 1 ]))and - 1 not in j : 27return False 28return True 29 30def prune (node ): 31if node .children == []: 32if sum ([i .count (- 1 )for i in node .b .tolist ()])!= 0 : 33return False 34else : 35', ' .join (['' .join ([str (j )for j in i [1 :- 1 ]])for i in node .b .tolist ()[1 :- 1 ]]) 36return True 37return True in [prune (i )for i in node .children ] 38 39class State : 40 41def __init__ (self ,newBoard ): 42self .children = [] 43self .b = newBoard 44for i in range (boardSize ): 45for j in range (boardSize ): 46if self .b [i + 1 ][j + 1 ]== - 1 : 47for k in range (boardSize ): 48temp = np .copy (self .b ) 49temp [i + 1 ][j + 1 ]= k + 1 50if checkBoard (temp ): 51self .children .append (State (temp )) 52return 53 54head = State (board ) 55prune (head )