Article 3018 of rec.games.corewar: Path: news.cs.utah.edu!utah-morgan!cs.utexas.edu!howland.reston.ans.net!vixen.cso.uiuc.edu!newsrelay.iastate.edu!dunix.drake.edu!acad.drake.edu!pk6811s From: pk6811s@acad.drake.edu Newsgroups: rec.games.corewar Subject: Re: length 100??? Date: 15 Jun 94 08:19:38 CST Organization: Drake University, Des Moines, Iowa Lines: 72 Message-ID: <1994Jun15.081938.1@acad.drake.edu> References: NNTP-Posting-Host: acad.drake.edu In article , ez003207@chip.ucdavis.edu (Rrrrrrryan) writes: >... > then...So what went wrong? Is my scanning engine just too slow? Are all > those programs really 100 instructions long??? Or are they super-efficient > short programs padded with 50 point imp spirals??? > I can vouch for Keystone and Torch. They both copy their active code away from the startup location, leaving a large decoy behind. Against a quick-scanning opponent I should have 10-20 cycles to get away, then while he attacks the decoy my program does its thing. 'booting' or 'bootstrapping' is a time-honored way of distracting scanners. Here's the source for Keystone so you know what you are up against: ;redcode-94 quiet ;name Keystone t33 ;kill Keystone ;author P.Kline ;strategy stone + anti-vamp ;macro spacing equ 2517 ; mod-1, approximates a mod-4 step for 29 dat #-(start*8),2667 rof start mov #-6,hideto+5582 ; avamp pointer mov #100,hideto+5582+78 mov hide4,inc-2269 mov -27 ; moved by stone onto hide3 hide6 djn.f #0,<-25 ; moved by stone onto cnt for gate hideto dat #7242-2073-8+527 hidefr dat #hide3+1 hptr2 dat #hide6+2512+527+1 hide7 djn.f 0,>-26 ; moved by stone onto hide3 hide8 djn.f #0,<-24 ; moved by stone onto cnt for gate for 37 dat #-(start*8),2667 rof end start Paul Kline @c@ pk6811s@acad.drake.edu - ignorance exceeded only by inquisitance -