From: mconst@soda.berkeley.edu (Michael Constant) Subject: MNCT Lives! Date: 31 Jan 1994 21:13:38 GMT Message-ID: <2ijsa2$rqg@agate.berkeley.edu> Due to popular request (3 letters!), MNCT has returned! Round 3 was where I left off, I think. Just to refresh your memory, the rules for round 3 are: Style: Standard round-robin (each entry fights each other entry) Standard: 94 Coresize: unknown (that is, your program must function in a variety of coresizes) but always < 64K Deadline: February 12, same late policy as usual (late entries accepted as long as you let me know beforehand) Send Entries, Comments, Suggestions, etc to: mconst@soda.berkeley.edu BTW, since this round will incorporate large coresizes, this might be a good time for me to mention, once again, my optima calculator which handles coresize up to 64K. It is available by anon ftp from soda.berkeley.edu, in the /pub/corewar/incoming (soon to be /pub/corewar/misc) directory, as optimapc.exe (self-extracting archive for the PC) or optima.shar (for any system other than PC). Both files include source; the PC version also has the executable. Also, someone pointed out my error in stating that coresizes of prime-1 have no imps. They were perfectly correct - imps can exist in almost all coresizes. This means that adaptive imps (like P. Kline's (?) Improvisation) will be a possible strategy for round 3. -- - Michael Constant mconst@soda.berkeley.edu