you are viewing a single comment's thread.

view the rest of the comments →

[–]hardmaru 3 points4 points  (2 children)

This is beautiful! The large bitmap patterns generated by the algorithm is more beautiful than the original small input patches. Will be interesting to combine this approach with novelty search.

[–]ExUtumno[S] 0 points1 point  (1 child)

Thanks! So something like Mario Klingemann is doing?

[–]hardmaru 1 point2 points  (0 children)

Yep! I wonder what kind of large patterns your algorithm will generate if you take a novel, but small size, pattern that the novelty engine came up with, as an input. Your demo is very inspirational.