Super Code from Digital Knife Monkey Productions

Digital Knife Monkeys at Keyboards...Will Eventually Program Everything.

Digital Knife Monkey Contests

Contest 1

EDIT: This is simpler than it first appears!

three different arrays are to be tested with each combination of possible values representing one theory on how events played out IE a(0),b(0),c(0) and a(0),b(0),c(1) are two different theories either of which may be correct. now there are six possible theory components in both array A and in array C so: A(1 TO 6) and C(1 TO 6). in array B there are 10 possible values: B(1 to 10).

Now with the arrays A, B, and C we have 360 possible theories with each theory having between 0 and 3 correct components to it so the job is to figure out as quickly as possible and with as little code as possible which theory is correct with any single value possibly being the correct one.

the winner of the contest will be the one which in any condition finds the correct combination in the fewest number of cycles and with the least code.

the weighting is 2/3 ranking with number of cycles used 1/3 ranking based on how short the code is. 

use the system 

RANDOMIZE TIMER

DIM A(1 TO 6) AS _BYTE

DIM B(1 TO 10) AS _BYTE

DIM C(1 TO 6) AS _BYTE

A(INT(6*RND+1))=1

B(INT(10*RND+1))=1

C(INT(6*RND+1))=1 

 

DarthWho is not eligible to apply for this contest because he created it

if there are any questions or clarifications needed contact DarthWho through the site messaging system or in the DKM topic on QB64.NET

only DKM members are eligible to apply for this contest deadline is February 1st

You can also make multiple entries but please try to keep it below 3  entries I (DarthWho) will be scoring them myself and under worst case circumstances unless we get more members 3*7=21