changed knapsack type from bool slice to uint slice

The boolean slice forced this into the 0-1 knapsack problem - the problem in which a Thief may only take either one or none of each item. By changing the type to uint, I allow the program to solve the unbounded knapsack problem, in which the Thief may take as many of each item. If, for whatever reason, I choose to solve the 0-1 knapsack problem, then the uint slice may still hold 0 and 1.
rethinking design. eliminating Thief.

An individual genome is a robbery incidence, not a Thief.