MCWFC

An implementation of the Wave Function Collapse algorithm in Minecraft.

How it works

My method may be wrong on some points, if it is, feel free to open an issue.

1- The generation of the dataset (sample)

With the command /mcwfc generate dataset <piece size>, the user can generate a dataset with their WorldEdit selection. The selection gets "translated" if we can say so in a MCVirtualSpace, and the method generatePieces(int pieceSize) is then called.

• A Sample is a WeightedSet<PieceNeighbors> (where each PieceNeighbors has a weight above or equal to 1)

• A PieceNeighbors is a center Piece with its neighbors, there can be only zero or one neighbors (also a Piece) per Face (NORTH, SOUTH, EAST, WEST, TOP, BOTTOM, the others are not used)

• A Piece is what other people also call "tile" or "pattern" and is a cube of N*N*N blocks (in Minecraft, a block is represented by a BlockData), where N is the pieceSize

• A MCVirtualSpace is a VirtualSpace<BlockData>, because BlockData is minecraft's block class.

• A VirtualSpace is an extendable 3-dimensional grid that can grow when you add new elements to it.

2- (trying to) Collapse the wave

The user can make a new selection and call the command /mcwfc generate to create a wave within that selection and try to collapse it. The logic for the is in the Wave class.

The wave is basically a VirtualSpace<Sample>, and at the beginning, there is a copy of the dataset generated before at each "node" (point of the grid). Keeping Samples at each node and not just Pieces is useful because we need to keep track of which PieceNeighbors collapsed, so we can know what that exact PieceNeighbors is expecting at each side (Face). Keeping only Pieces would just let us know what all PieceNeighbors in the dataset with that piece as the centerpiece are expecting at each side.

---

PS: I'm French, so if you see some badly named or explained things, feel free to tell me !