Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Enemy found... it's the code! solution in Creative category for Find Enemy by smilicic
import math, string
M = {'N': -1, 'S': 1, 'SE': 1j, 'SW': 1-1j, 'NW': -1j, 'NE': -1+1j}
a = lambda z: (z.real + z.imag/2 + z.imag*math.sqrt(3)/2 * 1j)
g = lambda z: (round(z.real - z.imag/math.sqrt(3)) + round(z.imag*2/math.sqrt(3)) * 1j)
i = lambda z: (lambda I=string.ascii_uppercase.index(z[0]): (-(I+1)//2+int(z[1])+I*1j))()
c = lambda z: int(abs(z.real)+abs(z.imag) if z.real*z.imag >=0 else max(abs(z.real),abs(z.imag)))
k = lambda z: 'LFB.R'[(z.real>max(0,-z.imag)) + ((z.real
Dec. 12, 2016