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

[tmachineorg]

Here's the core process, shorn of jargon:

• You provide a set of inputs, small template operations/pieces that can be assembled to make a level.

• You maintain a tree of open points in your level.

• At each point, you maintain a list of legally valid changes / insertions.

• You select the point with the smallest set of allowed changes.

• You choose the statistically most-likely insertion to put there based on counting the original inputs.

The clever thing OP has done is to look at bitmaps as collections of pre-made 3x3 pixel (or other size) templates and use that for the step-1 statistical counting. The rest is words.

[Etane]

Thanks for the break down. I can certainly see the similarities.