Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
single_statement solution in Creative category for Berserk Rook by ciel
def solve(head,enemy):
try:
return max(
solve(enemy[i],enemy[:i]+enemy[i+1:])+1
for i in range(len(enemy)) if any(
enemy[i][n]==head[n] and
not any(
enemy[j][n]==head[n] and (head[n^1]
Aug. 6, 2014
