+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
ZeroMin (zeromin): Minimization GA example with Open BEAGLE
Copyright (C) 2003
by Christian Gagne <cgagne@gmail.com>
and Marc Parizeau <parizeau@gel.ulaval.ca>
+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
Getting started
===============
Example is compiled in binary 'zeromin'. Usage options is described by
executing it with command-line argument '-OBusage'. The detailed help can
also be obtained with argument '-OBhelp'.
Objective
=========
Find a bit string filled with zeros.
Representation
==============
Bit strings made of N bits.
Fitness
=======
Number of ones in the bit string, where the perfect solution has a fitness of 0.
Brett
e125f04383