МаГ

Hmmm, the link says that whether an extended bitmap satisfying C1 exists in NP-hard, but isn't it undecidable?

Undecidable if the size of an output is not bounded, yes. NP-hard for a fixed size, depending on the size.

this is So-Cool! I am wondering if this could work with images. You can use PatchMatch to find and count Mathew very effectively.

which one of the three in particular?

I mean all of the three compared to WFC. PatchMatch just makes patch search faster,you can combine it with any algorithm.

Yes. That's what I meant. Can't it be used with the wfc algorithm with real texture or tile images?

It can, but (floating point) error will accumulate during propagation, and results will look like texture synthesis for larger N.

@hellogames there is a fix for No Man's sky from @ExUtumno, Sean Murray may fix his false ads using it.

@ExUtumno awesome Algo! any chance for a more noob friendly explanation, or a commented code version? also thanks for sharing ;) !

Thanks! First see the tiled gifs and try http://oskarstalberg.com/game/wave/wave.html …. It starts in a state where in every position all tiles are possible.

Chooses a tile at random. Crosses out all tiles that contradict the choice or contradict the recently crossed tiles and so on. Then repeats.

:) that part I got. I'm trying to get my head around the code on github. Any chance you'll comment it? :)

No, I don't plan to comment it. But if you're puzzled by anything particular, I can explain.

hi! Did you try to use the forth dimension as time with WFC? What can we expect from adding the fourth dimension?

I'm doing this right now =). Expect very very cool animations.

hehe! It's time for night work! Isn't it?