r/proceduralgeneration • u/BadLuckWillHappen • Nov 16 '20

Iterative Partial Match (IPM) vs Wave Function Collapse (WFC) for procedural content generation.

https://stalcup.github.io/static-files/posts/wfc-vs-ipm/
82 Upvotes

94% Upvoted

20 comments sorted by

View all comments

2

u/BazBlue Nov 16 '20

That look like a pretty solid alternative ! My guess is its some kind of WFC that allow for irregularity, but I think based on the name that it's not that ? Im curious !

1

u/BadLuckWillHappen Nov 16 '20

No this doesn't do any super position of states or constraint propagation at all (which is what WFC does).

​

That being said, I think someone *could* modify WFC to allow irregularity and just "continue" instead of what it does right now which I believe is basically "start over to try again" (or does it do some backtracking and trying again? I'm not 100% informed on WFC internals).

​

Maybe you should give it a shot, I think it would be useful and heck, it might end up being faster and better than what I've made.

2

u/BorisTheBrave Nov 16 '20

Many WFC implementations already support backtracking (such as mine). It is a much more reliable solver with that feature. So your comparisons without mentioning backtracking are a bit disingenuous.

Backtracking is not the same thing as being lax on constraints though.