munasir.bsky.social
@munasir.bsky.social
Glad that you liked it! :)
January 13, 2026 at 7:19 PM
Indeed
January 13, 2026 at 3:22 AM
I have no idea what BOFA is.
January 12, 2026 at 9:30 PM
Oh, and most importantly, you can play some generated games here: mortar-x3p7.onrender.com
Mortar
mortar-x3p7.onrender.com
January 12, 2026 at 8:09 PM
This project was done by myself, with help from
Yuchen Li, Dr. Steven James and Prof.
@togelius.bsky.social
.

You can find the paper here: arxiv.org/abs/2601.00105, and the code here: github.com/umair-nasir1...
GitHub - umair-nasir14/Mortar
Contribute to umair-nasir14/Mortar development by creating an account on GitHub.
github.com
January 12, 2026 at 8:09 PM
For example, we ran experiments where we seeded the initial population with the Sokoban push mechanic and replaced the initial level with a Sokoban level, and found interesting results. This demonstrates that mortar can provide ideas to expand your game.
January 12, 2026 at 8:08 PM
The results suggest that Mortar can open-endedly generate playable and learnable games with mechanics that contribute positively towards the game.
January 12, 2026 at 8:06 PM
LLM selects the game assets from a defined set. With some postprocessing steps to ensure playability, we send the game to our MCTS agents. Kendall’s tau rank correlation decides on the learnability of the game, and CITS decides the importance of the mechanic.
January 12, 2026 at 8:05 PM
At each node expansion, we either add a mechanic from the QD archive, or generates a new one through an LLM. The LLM generates each individual method for the game class, including the game level, in a step-by-step manner, with the context focusing on the mechanics in the node.
January 12, 2026 at 8:04 PM
The actual writing of the mechanics is done by an LLM, acting as an evolutionary operator in a Quality-Diversity algorithm. The selection operator selects a game mechanic, the LLM mutates it, and the mutated mechanic becomes the root node of the Evaluation Tree.
January 12, 2026 at 8:04 PM
At the end of this "Evaluation MCTS" we get the actual ranks of the MCTS agents, find the rank correlation throughout the games in the tree, and derive Constraint Importance Through Search (CITS) score, which is inspired by Shapley values.
January 12, 2026 at 8:03 PM
Interestingly, this makes the construction process a form of tree search itself, where the node expansions take the form of testing different mechanics. This is a form of systematic trial and error, or an evolutionary algorithm with a strange population structure.
January 12, 2026 at 8:03 PM
However, that only tells us about the game, not the mechanic. We need to know if a new mechanic makes the game better. We do this by adding new mechanics sequentially, and measuring the importance of the mechanic for the game.
January 12, 2026 at 8:02 PM
But how can you tell whether a game mechanic is good? By playing the game. In Mortar, we use different Monte Carlo tree search agents. The good ones should play it better than the bad ones. This is a measure of game depth, or learnability.
January 12, 2026 at 8:00 PM