MarkovJunior VS jetscii

Our of curiosity, have you seen MarkovJunior, from the same developer? It's a generalization of WFC into a far more powerful probabilistic programming language capable of not only assembling random maps, but even generating solveable Sokoban levels?

It's not WFC but I'll be working on this soon too. For now I rewrote MarkovJunior in Rust, and made it into a library that is both faster and easly extensible.

Github source by the mxgmn

Have https://cragl.cs.gmu.edu/pixelate/ be used to preserve features of your input image and keep the resolution input low for WFC, then randomly select features (shapes) from the input image to be used for procedural creation, like in the Dungeon Growth example from: https://github.com/mxgmn/MarkovJunior

I've done a similar thing myself when trying to test operations on a hierarchical database for my internal product.

Biggest difficulty for me was that some combinations of operations were illegal and I had to think about all the edge cases and filter them out, and this took a long time.

My SO works in hardware, and she says they always use a constraint solver to generate test cases / test vectors, and she never understood why this wasn't popular in software. I googled it a bit and found lots of academic papers but no concrete implementation.

I've also thought about generating test vectors using a generator based on Markov chains, I wrote about that here [0], based on this [1] submission.

I'm not familiar enough with either using constraint solvers to generate test cases, or Markov chains, to know if I'm talking nonsense here or is it just something that nobody thought to develop properly.

[0] https://news.ycombinator.com/item?id=31704791

[1] https://github.com/mxgmn/MarkovJunior

Have you played with MarkovJunior? You can write game rules in 2 or 3 dimensions (or any other dimension) using colors.

I implemented my own take on MarkovJunior (https://github.com/mxgmn/MarkovJunior), which is fancy pattern replacement (from the same mind who gave us WaveFunctionCollapse). Here is some dungeon creation algorithm.

If you enjoy reading Rust code, you can see some examples I have...

1. This example [1] compares a SIMD-accelerated implementation of an algorithm vs the naive implementation. This is usually referred to as an "oracle".

2. This example [2] tests an XML document object model library. The tests construct a sequence of operations to apply to a document ("add an element", "delete an element", "move an element" etc) and then assert properties that you expect to be true for a DOM tree (a parent and child are always cross-linked, for example)

[1]: https://github.com/shepmaster/jetscii/blob/8d7e44ad7da990ef1...

[2]: https://github.com/shepmaster/sxd/pull/21/files#diff-fc21cbf...