From news-rocq.inria.fr!jussieu.fr!newsfeed.eerie.fr!news.maxwell.syr.edu!news.voicenet.com!nntp.upenn.edu!msunews!mooredav Wed Jan 7 11:39:39 1998 Article: 8128 of rec.games.corewar Path: news-rocq.inria.fr!jussieu.fr!newsfeed.eerie.fr!news.maxwell.syr.edu!news.voicenet.com!nntp.upenn.edu!msunews!mooredav From: mooredav@cps.msu.edu (David Matthew Moore) Newsgroups: rec.games.corewar Subject: One Hop Date: 7 Jan 1998 00:07:24 GMT Organization: Michigan State University Lines: 43 Message-ID: <68ugvs$6u7$1@msunews.cl.msu.edu> NNTP-Posting-Host: komodo.cps.msu.edu X-Newsreader: TIN [version 1.2 PL2] X-MD5: 3cbc90d3b29003950a688078a5a90057 Here's presenting One Hop, a warrior new to the Limited Process Hill (maximum 8 processes). One Hop is about as simple as hill warriors get. It scans every cell and puts a JMP #1 on top of anything that is nonzero. Then it scans the core again, dropping DAT 0 on anything that it sees. One Hop doesn't have any imp defense. Who needs it? I just don't think that anyone will give up half of their processes to an imp. One Hop has another weakness. This type of thing would really make a person think twice before posting his warrior; but, anyway, here it is. The following program is invincible to One Hop: JMP 0, 0 The scanner never sees it. To guarantee at least a tie against One Hop, just split one of your processes to the program above. However, that would mean wasting 1/8 of the program's resources just to prevent losses to a particular warrior, so I don't think that anyone will use it. Is there any _useful_ program that runs invisibly? Here is the source code -- with a changed scan constant: ;redcode-lp ;name One Hop ;author David Moore ;assert MAXPROCESSES==8 ;strategy two phase scanner: first JMP #1,{1 then DAT 0,0 incr equ 2891 add #incr, #switch+incr start jmz.f -1, @-1 slt -2, #7 mov *switch, @-3 jmp -4, 0 dat 0,0 jump jmp #1, {1 switch dat #jump, <0 end start