Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Creative category for The Square Chest by panaro32
def checkio(l):
P = [(1,2,6,5,1),(1,2,3,7,11,10,9,5,1),(1,2,3,4,8,12,16,15,14,13,9,5,1)]
S = [[sorted([p[i]+k,p[i+1]+k]) for i in range(len(p)-1)] for p in P for k in range(16)]
return sum(all(x in map(sorted,l) for x in s) for s in S)
May 22, 2014
