This example uses genetic algorithms to find a solution to the knapsack problem. The knapsack is a container in which to put items of various sizes. The goal is to fill the knapsack as much as possible.

Knapsack size (positive integer):
Maximum generations to evolve through (positive integer):
Space separated list of item sizes: