~gdanix/ingress-attack-genetic-optimizer

5a312964dbe98f263c7caacd45b537d83c4967ec — Daniel Trujillo Viedma 4 years ago af4e5de
Update README.md
1 files changed, 2 insertions(+), 2 deletions(-)

M README.md
M README.md => README.md +2 -2
@@ 4,8 4,8 @@

This is a program that tries to find the best place to fire an XMP burster, using a genetic algorithm.

The algorithm is fully configurable (see ´res/data.yaml´) and makes uses of the well-known Apache Commons Math library, which provides a specific framework to program genet ic algorithms.
The algorithm is fully configurable (see [`res/data.yaml`](/res/data.yaml)) and makes uses of the well-known Apache Commons Math library, which provides a specific framework to program genet ic algorithms.

Custom crossover and mutation policies have been implementes, but it's possible to switch to standard Apache Commons Math policies implementation from the configuration file.

Also, a special ´GeneticAlgorithm´ (´GeneticObservableAlgorithm´) has been implemented, which makes possible to inspect the evolution of the population over the time.
Also, a special `GeneticAlgorithm` ([`GeneticObservableAlgorithm`](/src/org/gdanix/genetic_examples/ingress_attack_optimizer/genetic/GeneticObservableAlgorithm.java)) has been implemented, which makes possible to inspect the evolution of the population over the time.