EA

A few simple tasks solved with evolutionary algorithms

The One-Max Problem

The goal is simply to find a bit vector (of some pre-determined length) containing all 1’s.

The LOLZ Prefix problem is to maximize the number of leading ones (LO) or leading zeros (LZ) in a bit string.

Surprising sequences are those that are completely free of repeating patterns.

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.settings		.settings
bin/com/main		bin/com/main
lib		lib
res/Saved graphics		res/Saved graphics
src/com/main		src/com/main
.classpath		.classpath
.project		.project
README.md		README.md
data-ea.csv		data-ea.csv
global.txt		global.txt