Thanks for the feedback. Looks more complex than it is. Every tile has 6 nodes which randomly are true/false (green/red). Every node search for the closest node and compare the status. Very basic but very effective. Here how looks:
The tile rotation is a magic trick, the nodes are children of the tile, so when you rotate you are rotating the children, not the tile. The tile change the sprite and then the nodes were update pairing with the closest one again. One challenge I didn't forsee was a cascade effect, if a red node makes another node red, after rotation this red node will make the next node red. For that, I created another bool which save if you are green/red by your own. That's prevent false red nodes.
Not relying in the game physics has advantages. The debbug is mostly code and perhaps some clipping (layers order), so less than 4 hours to fix the annoying bugs (some of them are still in the game). And the "fun" of the game can validate without opening the project.
Have a wonderful day.