SIMULATED ANNEALING

0 Comments

Here’s an update on our earlier post about genetic programming. altered Qualia has posted a new implementation of [Ron Alsing]’s idea. It starts with 50 polygons as well as then randomly changes one parameter with each optimization step. If the the modification results in fewer differences from the target image, it’s kept as the new best DNA. This search method is similar to simulated annealing. The image above is the result of 1500 good mutations out of 35900 possible. The implementation lets you select any type of image, however smaller implies the fitness calculation is faster. It’s written in JavaScript using the environment. You’ll absolutely get much better performance using newer browser builds.

[Original image by R Stevens]

[via Waxy]

Leave a Reply

Your email address will not be published. Required fields are marked *