Can you find a path in the following graph that sums to 100? When you follow a blue edge, you add the number, and when you follow a red edge, you must subtract the number. So, starting at 13 and following

Dr. Joris Dormans wrote a chapter in "Procedural Generation in Game Design" (Tanya X. Short and Tarn Adams, editors) about cyclic generation, and he included this short example of a graph grammar

A lot of the existing packages for graph grammars seem to have GUIs for writing rules, and in some of them that seems to be your only option. Tonight I prototyped a way to export a graph grammar as a HTML

This is the first example I tried that really pushed my engine hard. It would be better broken up into multiple grammars, I think. I wanted to run Rule 30, a 1-d cellular automata, as a graph grammar in

Let's create a graph grammar with Soffit that generates a fixed-sized binary tree. How do we tell a graph grammar when to stop working? One option is to only run it for a fixed number of iterations, but

Suppose we want to create a graph grammar that makes rectangular grids. A first cut at it would be something like "expand outwards from any edge that hasn't already been used", something like

I've gotten Soffit to the point where it can now produce interesting graphs, like this one: full size The rule set that produces this graph is: { "version" : "0.1", "start"

I started at doc/examples directory for the soffit project, and my first two examples are there. Unfortunately, only one of them looks any good. The way I finally convinced graphviz to lay things out the

The #1 question about graphviz seems to be "why can't I get it to lay out my clusters in the way I want", judging from the number of StackOverflow questions I see. I wrote some code in Soffit

My library finally performed a graph rewrite today! Still a ways from a "launch" version, but the core of the engine works, at least in a simple case. Repository: As of this commit I have a unit

Github repo: I completely replaced or-tools with python-constraint, a pure-Python constraint solver. What effect this will have on my ability to handle large graphs I don't know. I had written tests that

I finally figured out (I think) how to encode the "dangling condition" for graph rewriting into or-tools, but then it started crashing on me with some regularity. I created a pull request: to

Github repository: Previous entry: "My #Procjam Project: Soffit" I was supposed to go out and have fun this weekend; instead I both got sick and handled two customer escalations. But I made a

As usual, my #procjam project is way too ambitious for what I can actually get done in a work week, particularly one where I'm out at headquarters in California. I'm trying to build a graph grammar engine

Nora Reed has developed tons of popular Twitter bots. Their works include infinite_scream, breathebot_10, hydratebot, bad_passwords, botblique, NerdGarbageBot, DOTHINGSBOT, and many more. Today I'll higlight

This week is ProcJam 2018: "Make something that makes something"! I've been doing this series of articles on Twitter bots (using the #procjam tag), and saved one of the biggest hitters for this

@LSystemBot is a Twitter bot that generates random L-Systems and plots the result. (Somebody at #roguelikecel told me about this bot, but unfortunately I forget who!) An L-System is a grammar that specifies

@pico8bot is a Twitter bot that generates a random mathematical formula, then plots it using the Pico-8 graphics palette. The Pico-8 is a "fantasy" virtual video game console with a 128x128 pixel

Today's review features three Twitter bots by Kate Compton (@galaxykate on Twitter), who is the author of Tracery, the framework that powers the three bots today and others I've talked about. Kate worked

@botaphor aka "my bot is like a summer's day" is a Twitter bot that makes comparisons. It's written by Mouse Reeve (@tripofmice on Twitter) and they have made the source code available on Github: