Were doing an autobattler that uses Multi-Phase Graph Traversal programming paradigms to simulate connections in a robot. Perhaps that might peak your interest. Essentially it would be 3 maps structural, data, and power. Each one would check the nodes upon it's destruction and bubble up either disabling, destroying, or debilitating the nodes that lose one of the structures. I haven't used this before so I could use someone on the team who might be more familiar with Euler's theorem and working in Graph Traversal if that's something you have some scope of knowledge in. Otherwise I might be working on that stack myself.
edit: forgot to drop my discord: .scottjones