@@ -4,48 +4,48 @@ FULL="O"
class Piece:
def __init__(self,variants):
self.variants=variants
pieces=[]
pieceSet=dict()
pieces.append(Piece([
pieceSet["sq"]=Piece([
# OO
((0,0),(0,1),(1,0),(1,1))
]))
])
pieceSet["long"]=Piece([
# OOOO
((0,0),(0,1),(0,2),(0,3)),
((0,0),(1,0),(2,0),(3,0))
pieceSet["boat"]=Piece([
# OOO
# .O.
((0,0),(0,1),(0,2),(1,1)),
((0,0),(1,0),(2,0),(1,1)),
((0,0),(1,-1),(1,0),(1,1)),
((0,0),(1,-1),(1,0),(2,0))
pieceSet["sz"]=Piece([
# .OO
# OO.
((0,0),(0,1),(1,-1),(1,0)),
((0,0),(1,0),(1,1),(2,1)),
((0,0),(0,1),(1,1),(1,2)),
((0,0),(1,0),(1,-1),(2,-1))
pieceSet["el"]=Piece([
# O..
((0,0),(1,0),(0,1),(0,2)),
((0,0),(1,0),(2,0),(2,1)),
((0,0),(1,-2),(1,-1),(1,0)),
((0,0),(0,1),(1,1),(2,1)),
@@ -53,30 +53,33 @@ pieces.append(Piece([
# ..O
((0,0),(0,1),(0,2),(1,2)),
((0,0),(0,1),(1,0),(2,0)),
((0,0),(1,0),(1,1),(1,2)),
((0,0),(1,0),(2,0),(2,-1))
WIDTH=5
WIDTH=8
HEIGHT=5
board=[[EMPTY]*WIDTH for r in range(HEIGHT)]
def fill(board):
def fill(board,pieces):
point=firstEmpty(board)
if not point: return True
res=[]
for p in pieces:
for (i,(k,p)) in enumerate(pieces):
if k==0: continue
for v in p.variants:
if place(board,point,v):
partialRes=fill(board)
pieces[i][0]-=1
partialRes=fill(board,pieces)
if partialRes:
res+=[((point,v), partialRes)]
remove(board,point,v)
pieces[i][0]+=1
return res
def firstEmpty(board):
for (r,row) in enumerate(board):
for (c,cell) in enumerate(row):
@@ -109,11 +112,11 @@ def visualise(board,tree,letter="A"):
for (((r,c),piece),rest) in tree:
for (ri,ci) in piece:
board[r+ri][c+ci]=letter
visualise(board,rest,chr(ord(letter)+1))
res=fill(board)
res=fill(board,[[k,pieceSet[x]] for (k,x) in [(2,"sq"),(2,"el"),(2,"boat"),(2,"long"),(2,"sz")]])
if res:
visualise(board,res)
else:
print(res)
Status change: