Closed NicMcPhee closed 9 years ago
These are results with K=6. For K=2, almost every run solves the problem almost every time, and even here solutions are awfully easy to come by. K=6 seems to be the highest value "baked in" to ECJ, though, and I'm not sure I care enough to implement a harder version just for this paper.
We'll have to decide on some reasonable values of N, K to run these on.