[63]

I always found "wave function collapse" to be a terribly overcomplicated name for a pretty intuitive concept. The first paragraph does a good job explaining the term, but still I wonder how many people stray away from such things when the name alone is overwhelming.

[zzyzek]

For many, the name is intuitive as its encapsulating the idea that a cell can hold a variety of states until it gets "collapsed".

[TuringTest]

I prefer the name given in mathematical optimization, which is Constraints Satisfaction Problems; instead of using an imprecise physics metaphor, it gets a descriptive logical term of what's going on.

In CSPs, each cell is a 'decision variable' with a 'domain' of values, which get pruned by 'constraints' that propagate to values invalidated by the decisions made in the connected variables, until the whole 'problem' gets into either a solution which 'satisfies' all the constraints, or a contradictory state where a variable's domain is empty, causing the algorithm to backtrack.

CSPs have the advantage of having clear and efficient methods to go back to a previous state and keep exploring every alternate possibility, rather than having to restart from the beginning. The article hints at that possibility ('saving checkpoints' or'reverse the collapsing of a cell'); there's a whole field of study dedicated on the best ways to do that on a large scale for very general problems.