FGA is a simple yet powerful implementation of a general genetic algorithm, and
provides many types of crossover and selection procedures.
It is suitable to solve mathematical problems such as combinatorical
optimization ones, as well as to build artificial life simulations.
