Next: Majority Classification Problem
Up: Solving the Majority Classification
Previous: Solving the Majority Classification
I am currently working with cellular automata and evolutionary
computations to solve the Majority Classification
Problem. I hope to beat the existing record of about .85
completion in the MCP. I am working with test arrays that are of length 145.
The rules are based off of a 7-neighbor system and therefore need to be at
least of length
128 (there are 128 possible combinations of 7 binary cells). However, I
also added an extra cell where the value (success rate)
of the rule is stored.
Subsections
Austin L. Rachlin
2003-06-12