With the small graph in the post, finding the solution by searching backwards from "finished" graphs (ie. single-city) using dynamic programming should be simpler than beam search and guaranteed optimal.
I think it would also be easier to add some meaningful variation to the resulting graph removals by building up instead of trying to remove and retain properties. The proposed algorithms are perhaps too predictable by the player for the game, depending on how it is played.
With the small graph in the post, finding the solution by searching backwards from "finished" graphs (ie. single-city) using dynamic programming should be simpler than beam search and guaranteed optimal.
First thing that came to my mind too.
I think it would also be easier to add some meaningful variation to the resulting graph removals by building up instead of trying to remove and retain properties. The proposed algorithms are perhaps too predictable by the player for the game, depending on how it is played.
See, that's why I have to post these things. Someone will inevitably reply with something more clever.
I love these sorts of applied maths sorts of post! Nice work, interesting reading.