From: mconst@OCF.Berkeley.EDU (Michael Constant) Subject: Michael's New Corewar Tournament: Round 1 Revised Date: 28 Oct 1993 17:44:43 GMT Message-ID: <2ap0eb$i03@agate.berkeley.edu> -------------------------------------- - Michael's New Corewar Tournament - - - - Revised Rules for Round 1 - -------------------------------------- While there is still discussion about later rounds, round 1 has been finalized. Submissions will fight against this challenge program (it's the same one I posted about a week ago): ;redcode ;name Challenge 1 ;author Michael Constant ;strategy figure it out yourself! spl 0, #2 mov -1, @2 add #3044, 1 jmp -2, 3044 mov -6, <-5 jmp -1, <-7 Their 3-1-0 score will be recorded, and then each warrior will be awarded a score based on their rank (if there are n warriors in round 1, the best gets n points, the second-best gets n-1 points, etc.). Each author's total points will be recorded throughout the tournament. Note that since the best program gets as many points as there were submissions for that round, you get a lot more points by beating 100 other submissions than you do by beating one other program, even if it was the only other submission on the round. In round 1 only '88 programs will be accepted, but there will be at least one '94 round in the tournament - probably several. Submissions must be received by Thursday, November 11 (two weeks from today). Send submissions to me (mconst@ocf.berkeley.edu). I will post the winning code and any other interesting submissions to the net. If you don't like this rule too bad. Start writing your programs now! On Stefan Strack's advice, round 2 (the prime number computing round) will be replaced with something a little more difficult. The most likely candidate right now is calculating s(A) (Nandor's optima constants). Talk about redcode for redcode's sake! :-) I would appreciate any opinions on this (too hard, too easy (I don't think so!), whatever). -- - Michael Constant mconst@ocf.berkeley.edu