Article 784 of rec.games.corewar: Organization: Penn State University Date: Tuesday, 28 Apr 1992 14:17:09 EDT From: Jeff Raven Message-ID: <92119.141709JAR129@psuvm.psu.edu> Newsgroups: rec.games.corewar Subject: Nevermore 3.2 Lines: 45 For those of you out there who could use another warrior to test against, here's Nevermore 3.2. It's a fairly simple B-field scanner, but it does OK against most competition (although it gets massacred by dwarves). The only thing distinctive about it is the bombing mechanism, which alternates between DAT and SPL bombs. I'm not sure that the alternating is particulary useful, but without it the original algorithm looked entirely too much like XTC. (Incidentally, if anyone's got any recommendations for improvements, I'd like to hear them ;) ------CUT HERE------ ;redcode verbose ;name Nevermore 3.2 ;author Jeff Raven ; ;strategy - Version 3.2 ;strategy - Scans the core, looking for a non-zero B-field, and then ;strategy - proceeds to bomb the memory around the suspicious address. ;strategy - As for how it bombs .......... the algorithm has finally ;strategy - been fixed, and hopefully it should tie a lot less now. ; basis EQU 4 ; Basic step size for the search step EQU 3044 ; Step size for the search delta EQU (point - alpha) ; Constant used in the bomb exchange double EQU (2 * delta) ; Constant used in the bomb exchange offset EQU basis ; Distance ahead of target to start bombing correct EQU (basis - 1) ; Corrective value used after bombing times EQU (2 * basis - 1) ; Number of bombs to place start ADD #step, target target JMZ start, counter ADD @point, point SUB #delta, point ADD #offset, target counter MOV #times, counter kill MOV @point,