Genetic Algorithms in Ruby
Apress eBooks · 2008
I n Chapter 2, you simulated the average weight of pocket change given different coin systems. In order to find the best denominations of coins (given a specific sample of prices), the code did a brute force search of all possible configurations you were interested in. But it become apparent that, as the coin set grew larger, the time required became exponentially longer with each additional possible coin. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.