The following uses placeholder tiles to showcase how the algo works.
Different colors also represent different tiles.
I've finally managed to move the code to C++. So now it is mostly instantaneous. It also works asynchronously and with multiple algos working at once. If they intersect it will work. Here is the new algo with delays (for showcase):
You click to spawn tile-like parts. The game is about building stuff and discovering different arrangement of tiles. The tiles automatically update to what you did. That is, you do not specifically choose them except for where they are.
Here is the algo with no delay:
The algo can also complete without checking all the tiles. This might be an obvious "duh" requirement but this is actually a forward propagation system so this is not supposed to be the case by default.
When you click, all tiles are technically invalidated. It is a bit like if you were solving a sudoku and once done you add a new starting condition. Here is a 5 I didn't tell you about. Hope that works for you.
Also visible here (where the result should be 5 grey circles). The tiles on the side don't check the center.
There is still in theory ways to improve the perf by a lot according to the profiler, but for now I'll move to making art. After that the game should be roughly in a playable state and most importantly it should be more clear what the game is about.
My expectation is that what will make the game interesting to play is for the player to find interesting tile combinations, but I'm not exactly sure how to put that into words.
