Find a good solution to the house robber problem, using a Genetic Algorithm.
The solution found is not necessarily optimal.
A robber wishes to maximize the value of robbing houses on a given street full of houses. However, he/she cannot rob adjacent houses; if attempted, this will result in being caught.
Values of robbing each house, as floats, one per line - on stdin.
On genetic algorithms: Wikipedia article
You can e-mail the author with questions or comments: