Here are two warriors I wrote recently. The first is the REAL backward imp :). Won't win any tournament though... mov 0,0 djn @-1,-1 The second is my implementation of a binary bomber, which divide its step size by two every time it goes around the core. The cool thing is the axis change which makes it NOT rebomb the same location twice. Unfortunatly, there's not div instruction, so I must use a step table, very dangerous. Could be improved by copying the code elsewhere away from the table. ;redcode verbose ;name Bynars ;author Pierre Baillargeon ;strategy v1.0: Binary bombing (64,32,16,8,4,2,1) ;kill Bynars top sub @ns, axis ; change axis changer axis sub #32, kill ; change pointer axis inc sub #64, kill ; new position kill mov ns, -1 ; kill other count djn inc, #124 ; number of step sub #64, kill ; get zero add nc, count ; reset step count add nc, nc ; change next step count sub @ns, inc ; change step size djn top, ns ; change next step size dat #1 #0 dat #2, #0 dat #4, #0 dat #8, #0 dat #16, #0 dat #32, #0 nc dat #0, #248 ; next count down ns dat #0, #-2 ; next step end inc