Re:Show HN: Wave function collapse algorithm
by mathgenius on Friday September 30, 2016 @07:23PM
(#12615816)
I wonder if it would be interesting to purposely search for tilesets that maximize contradiction rate. What would those things look like?
Re:Show HN: Wave function collapse algorithm
by ExUtumno on Saturday October 01, 2016 @10:59AM
(#12618110)
A very good question! The opposite of it is also important, can we follow some heuristics while creating tilesets to minimize contradiction rates, but not making tilesets easy? I don't know. If someone knows please tell me.
Re:Show HN: Wave function collapse algorithm
by mathgenius on Monday October 03, 2016 @10:07PM
(#12632851)
Hmm, this possibly relates to sheaf theory. Robert Ghrist has a good book about this stuff (applied topology) if you want to check it out.
But the first thing you'll notice if you feed it an image with a lot of patterns, is that it will work very slowly.
Yeah, the corpus thing can be done if we cut out rare patterns and leave only frequent ones. I haven't tried it though.