Problem
Traveling Salesman
shortest Hamiltonian cycle
Phrase Evolution
match a target string
Curve Fitting
evolve sinusoidal parameters
Population
50
100
200
Mutation
Low
Med
High
Cities (TSP)
15
25
40
Elitism (keep top)
2
5
10
Steps / frame
×1
×5
×20
⏸ Pause
↺ Reset
★ Shuffle
problem =
TSP
gen =
0
best =
—
avg =
—
pop =
100
mut =
Med