3 ms·
The algorithm used is actually very very different even if the results are visually similar.
by antirez 10y ago
The algorithm used is actually very very different even if the results are visually similar.
- fogleman 10y agoIndeed!
- RBerenguel 10y agoI did a simulated annealing version 5 or 6 years ago (so I could have a neat Christmas card), and was surprisingly slow (well, I had a slower computer, too). Congrats on making it fast and nice (and exporting in vectors, which is something I didn't bother to even try!)
- KennyCason 10y agoI found similar results in my simulations as well. Even my genetic implementations were "slowish" both simple hill climbing (single parent) and two parent with cross-over/mutation. Though, after seeing this awesome implementation, I'm going to go do some work on improving mine.
- RBerenguel 10y agoGood luck! I don't plan on revisiting mine for the time being (more interested in some Scala stuff I have parked on the side)
- KennyCason 10y agoThanks. :) I wrote mine in Kotlin ("genetic_draw" on my GH). The best of both worlds, fun side project + new language.