This program utilizes a genetic algorithm to solve the Knapsack NP-Complete problem. The goal of this algorithm is to minimize wasted space and fill the knapsack with all the objects. The final solution-set fills the needs of the goal, but may not be the optimum ordering. There is no sure way to find the optimum order, but we can come very very close.
Space-Bar :Resets
Enter :Try Again
This chart shows each iteration's final fitness score. You can see the difference by adding mutation, because we definitively come out with better final solution and do not get stuck on local maximums and instead get closer to the global maximum.