Genetic Algorithm
use when need sth stochastic (randomn)

Knapsack problem using GA
Facts
- Each fact is a full solution to the problem
→ each fact represents as a tuple, each bit in this tuple indicates whether that item is picked or not such that total weight < Capacity
example

Extension rules
Extension rules create new solutions from some subset of solutions

Mutation
single point mutation

- critic: only one bit changes each time → slow

Crossover
for each bit choose either from A or B

- critic: can end up with the same one or go over Capacity

Search Control

Search Instance
