Brute Force Iteration Comparison

Is there an algorithm for comparing all possible variables to pick an optimal solution?

Using "fitness", like Galapagos, one could guarantee the most fit at the sacrifice of computing time.

For example, If I have two sliders of 10 driving a polygon, and I wanted to find the two numbers that resulted in the largest area, it would run through all 10² possible combinations to find the optimal.

Much thanks!

Replies to This Discussion

Permalink Reply by David Rutten on April 24, 2013 at 12:14pm

Not possible using Galapagos. What you can do is create all possible permutations of sliders using the Cross Reference component and then compute all possible outcomes at the same time. This obviously puts a lot of pressure on memory consumption and processing power. I used this approach to create these images of Fitness landscapes:

http://www.grasshopper3d.com/photo/minbbox-1

http://www.grasshopper3d.com/photo/veryslowly-1

David Rutten

david@mcneel.com

Poprad, Slovakia

RSS