Press escape to exit fullscreen

{{sketch.instructions}}

CC {{sketch.licenseObject.short}}

Archived Sketch

This sketch is created with an older version of Processing,
and doesn't work on browsers anymore.

View Source Code

Capture Screenshot

evolutionary algorithm

{{$t('general.by')}}
Michael
Muehlhaus, Nils Seifert
This ist the fist test sketch of our evolutions library. The library provides the data structure of an evolutionary algorithm. In this example, the EA tries to find the Polygon (toxiclibs Polygon2D) with the best area-to-circumference ratio. It starts with 200 random polygons and calculates 150 generations to find the best solution. After that you can scroll through the path of the winning polygon by moving the mouse. The graph shows the best values of every generation (black), the slope this curve (red) and the path of the "winning" polygon (grey) more info: http://www.muehlseife.de
We recovered an unsaved version of this sketch. Please review your changes below.

As a Plus+ Member feature, this source code is hidden by the owner.

  • {{co.title}}
    •
    {{$t('sketch.mode-pjs')}} {{$t('general.learnMore')}}
    Select mode or a template
    {{liveCodeLink}}
    • {{l.url.substr(l.url.lastIndexOf('/') + 1)}}
    {{$t('sketch.layoutDescription')}}

    {{k.category}}
    {{k.label}}
    {{k.description}}

    {{$t('sketch.seeMoreShortcuts')}}

    Versions are only kept for 7 days.
    Join Plus+ to keep versions indefinitely!

    {{$t('general.joinPlus')}}

    {{$t('sketch.versionsSummarized')}}

    {{ $t('general.joinPlus') }}