|
|
Posted by Don on 06/30/05 19:28
mensanator@aol.com wrote:
>
>
> Chung Leong wrote:
>> Isn't that an NP-complete problem or am I crazy?
>
> That makes it a more realistic challange, doesn't it?
>
> Suppose it was something simple, like calculating a
> minimal spanning tree. Every program would produce the
> same output. What kind of contest would that be?
I was thinking maybe you could use a genetic algorithm, where the fitness
function would caluclate the amount of waste. I'm not very familar with how
to implement this sort of thing, though.
-Don
Navigation:
[Reply to this message]
|