Article 844 of rec.games.corewar:
From: wms@iwarp.intel.com (William Shubert)
Newsgroups: rec.games.corewar
Subject: Re: Smallest jumper ?
Message-ID: <1992May6.163944.18854@iWarp.intel.com>
Date: 6 May 92 16:39:44 GMT
References: <1992May5.183233.250@vlsi.polymtl.ca> <58593@cup.portal.com>
Sender: news@iWarp.intel.com
Organization: Intel iWarp, Beaverton, Oregon, USA
Lines: 44
Nntp-Posting-Host: z.iwarp.intel.com

While this "split-for-faster-copy" is being discussed, one of my programs on
the experimental hill uses this technique and works pretty well.  Here it is:

;name Shoggoth 1.1
;author Bill Shubert
;strategy Crawl through memory, sweeping aside everything in the way.
;strategy V1.1 - Faster & smaller with a bigger attack range.
wdist	equ	250

procs	equ	16
cpnum	equ	11

st	spl	st1
st1	spl	st2
st2	spl	st3
st3	spl	st4
st4	jmp	shog

from	dat	#0
to	dat	#from
shog	mov	#from-to,to
	mov	to,<to
	mov	to,<to

	mov	to,<to
	mov	to,<to
	mov	to,<to
	mov	to,<to
	mov	to,<to

	mov	to,<to
	mov	to,<to
	mov	to,<to
	mov	to,<to
	mov	>from,>to

	jmp	(from-procs*cpnum)+(shog-from)

	end	st

As you can see, it clears out memory very fast by executing each of the
"mov to,<to" instructions sixteen times.  Then it copies itself with the single
"mov >from,>to" instruction, and jumps to the new copy.
				-Bill (wms@iwarp.intel.com)