1. Weights Found

2. Matchup to Input Frequencies

Input Input Frequencies Generated Frequencies Input Number (exact) Generated Number
Candidate 1 0.500 0.501 50088 50137
Candidate 2 0.500 0.499 49912 49863

/Input/:

Constraint 1 (.001)

Constraint 2 (0)
☞   Candidate 1 (0.501)

 

*

     Candidate 2 (0.499)

*

*

3. Hasse Diagram

The following Hasse diagram (in output folder at NeutralPatternHasse.gif) summarizes the rankings obtained.

4. Testing the Grammar: Details

The grammar was tested for 100000 cycles.

Average error per candidate: 0.000 percent

Learning time: 0.013 minutes

5. Parameter Values Used