Article 853 of rec.games.corewar: From: JAR129@psuvm.psu.edu (Jeff Raven) Newsgroups: rec.games.corewar Subject: Leaper-X 4.0 Message-ID: <92129.002043JAR129@psuvm.psu.edu> Date: 8 May 92 04:20:43 GMT Organization: Penn State University Lines: 54 Well, since I'll be heading home for the summer in a matter of days, I figure it's about time I posted the code to Leaper-X. It has a rather interesting history, which I'll spare you, and just get to the code. True to it's name, it leaps through the core, bombing each time it jumps. The unusual thing about the bombing - and what probably gives it an edge over programs like it - is that, instead of bombing 250 locations on one side, it bombs 125 locations on each side. Although slightly less effective at taking down a charging Imp, it does protect Leaper-X on both sides simultaneously, and it will bomb its 250 locations slightly faster than others because its loop is a little more unrolled (2/3 bombs per instruction compared to the usual 1/2). As for its bombing mechanism - it will bomb 31 times with SPLs (just about hitting every location), and then will switch to DATs. It's done well (better than anything else I've written), usually staying between third and sixth. ;redcode-x verbose ;kill Leaper-X 3.0 ;name Leaper-X 4.0 ;author Jeff Raven ; ;strategy - Leaps through memory, bombing as it goes. The bombing routine ;strategy - has been changed - and hopefully improved. It now uses a more ;strategy - efficient bombing pattern, which should almost halve the time ;strategy - it takes to clear the core. ; lines EQU 14 limit EQU 250 reach EQU 125 upper EQU reach lower EQU -reach leap EQU limit - (storage - copy) time EQU 32 low DAT #0 start MOV #lower, low MOV #upper, high DJN splat, slow MOV #0, point splat MOV @point, >low MOV @point, @high DJN splat, high MOV #lines, low MOV #leap, storage copy MOV @low,