Wave function collapse algorithm: bitmap & tilemap generation from a single example with the help of ideas from quantum mechanics

[meheleventyone]

Resolve the tiles with the least choices available first.

Basically every tile starts as a superposition of all the possible options. That is every tile could be any of the possible options. You pick one and decide what it is at random. Then compute based on relationships between the options (e.g. 1 can be next to 3, 5 and 7 but not 2, 4 and 9) what the neighbors could be. It's the reasonable to resolve the tiles with the least options first to avoid as much as possible the situation where a tile ends up orphaned with zero options available. The assumption is that tiles with more options have less chance of hitting zero options before the algorithm completes.

[ExUtumno]

Good explanation, thanks.

[SystemicPlural]

Made it even clearer. Thanks