screen-13 VS MarkovJunior

Check out Screen 13; write shaders and use the render graph to run them easily. Resources can be created individually or as part of an automatic pool. Lots of examples, fully documented. Triangle is 100 lines including shaders.

I'd like to share what I've learned over the last week while adding a point light shadow mapping example to Screen 13, my Vulkan rendering engine.

This example in Screen 13 uses pixel shaders for a spilled-paint effect; which is similar to moving sand through advection. If you want to focus on compute and pixel shaders which update buffers and display images on the screen: this engine is really well suited.

https://github.com/attackgoat/screen-13 is an easy-to-use render graph which allows you to run shaders and handle resources with very little code. As the author, I would recommend it!

Screen 13 is an easy to use render graph library - it doesn't have opinions on your shader code or render passes and can be easy to use kind of like a modern OpenGL. Runs where Vulkan runs: Windows/Mac/Linux/Mobile - no web.

Have you considered Screen 13?

I take it this will show up at https://github.com/attackgoat/screen-13/releases and the announcement just pre-empted it?

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.