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

Heurestic GA

{{$t('general.by')}}
Kof
(Kryštof Pešek)
I was watching some lectures for students here who reproduced parametrically Kandinsky's paintings.. they made it well, but it was bit frustrating to me. Interesting problem for genetic algorithm.. the method used here is described as stochastic brute-force model.. It reminds me a story of unlimited amount of monkeys writing Shakespeare's play in unlimited amount of time. Results are not so accurate so far. (maybe it needs another algorithm to optimize it's settings, well, then probably another one to optimize such optimizer, then it is easier to just redraw it ..)
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') }}