I sat down to try and write a program to solve this and ended up with this:
Starting with ? "0" ? "1" ? "2" ? "3" ? "4" ? "5" ? "6" ? "7" ? "8" ? "9" All the counts must be at least 1 1 "0" 1 "1" 1 "2" 1 "3" 1 "4" 1 "5" 1 "6" 1 "7" 1 "8" 1 "9" which makes the 1-count 11 1 "0" 11 "1" 1 "2" 1 "3" 1 "4" 1 "5" 1 "6" 1 "7" 1 "8" 1 "9" but that means an extra 1 so 1-count becomes 12, which makes the 2-count becomes 2 (which would then become 3 except that we have lost a 1) and the 1-count drops back to 11 1 "0" 11 "1" 2 "2" 1 "3" 1 "4" 1 "5" 1 "6" 1 "7" 1 "8" 1 "9"
And I have a solution. Is it the only one?
In reply to Re: Improving Evolutionary Algorithm (no code?(spoiler))
by BrowserUk
in thread Improving Evolutionary Algorithm
by jweed
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |