3 ms·

I've never heard this referred to as "Wave Function Collapse" before. Isn't this just constraint satisfaction being solved via backtracking? Like this is the st

I've never heard this referred to as "Wave Function Collapse" before. Isn't this just constraint satisfaction being solved via backtracking? Like this is the standard way of solving the N-queens problem. Make a random choice, propagate the constraints, and repeat, backtracking if you reach a contradiction. https://en.wikipedia.org/wiki/Backtracking https://en.wikipedia.org/wiki/Backtracking

deleted 5y ago
[deleted]
_0ffh 5y ago
After reading [1], I'm not really sure backtracking is even an integral part of WFC, as apparently it sometimes fails to find a solution and needs to retry from start. Backtracking seems to be more of an optional add-on. [1] https://paulmerrell.org/wp-content/uploads/2021/07/comparison.pdf https://paulmerrell.org/wp-content/uploads/2021/07/compariso...
max_ 5y ago
The original implementation[0] has a comprehensive description in the README file. [0] https://github.com/mxgmn/WaveFunctionCollapse https://github.com/mxgmn/WaveFunctionCollapse
eutectic 5y ago
I think the statistical aspect is an important part of the algorithm; it's trying to match the statistics of the input data. I guess you can think of it as an approximate sampler for Markov Random Fields.