From: mconst@soda.berkeley.edu (Michael Constant) Subject: MNCT Round 2 Rules Date: 15 Nov 1993 04:58:39 GMT Message-ID: <2c729v$fkg@agate.berkeley.edu> -------------------------------------- - Michael's New Corewar Tournament - - - - Round 2 Rules - -------------------------------------- For round 2, submissions will be given a number, and they must find its prime factorization. Specifically, there should be a label in your program called "input", whose B-field I will set to the test number before running your program. (If you would prefer the A-field just let me know.) Your program must produce, somewhere in memory, a list of numbers which correspond to the prime factors of the number given (in any order). If there are repetitions your program must find them. For example, if the test number was 12, your program would output the numbers 2, 2, and 3. After finding all prime factors, your program must terminate. There is no limit to the size of your program. However, your program's score will be (length*2000) + cycles, where length is the number of lines in your program and cycles is the number of cycles it takes to complete. Lower scores are obviously better. Programs which produce incorrect output will be disqualified. However, if your program does give wrong answers I will try to let you know so that you can fix it. As in round 1, late submissions will be accepted as long as you let me know beforehand. The deadline for submissions is Saturday, November 27. P.S. For fairness, I will use more than one test number (probably three). From: mconst@soda.berkeley.edu (Michael Constant) Subject: whoops Date: 15 Nov 1993 05:04:10 GMT Message-ID: <2c72ka$fmr@agate.berkeley.edu> Whoops, my sig got lost on the last post. Send tournament submissions to: -- - Michael Constant mconst@ocf.berkeley.edu