Not a JME game but something I poke at here and there.
I got the idea after watching a Numberphile video on a graph problem… working it over in my head, simplifying it, trying to figure out how to generate solvable graphs, etc…
So I coded it up in libgdx just to see if anything happened:
It’s barely playable. Stand-in graphics, no menu, no animation… and it just plops you right into the next level when you finish one. But it lets me try level layouts and see what’s what.
To play, click a node to transfer points to all of the neighbors or suck points from all of the neighbors depending on whether it’s positive or negative (0 is positive for the sake of this determination). The object is to get everything to 0… and to do it in par or fewer moves.
I don’t know if it amounts to anything but every time I push it along a little bit, it feels better… so who knows?
Edit: a screen shot of one of the more interesting levels: