09-06-2020, 08:49 AM
(09-06-2020, 07:54 AM)Eric Piette Wrote: Hi Michael,Thank you for trying :)
I just read all the messages but I am not sure after all of these messages what exactly you try to do.
Can you explain it to me again here and show me maybe with 2 or 3 examples the expected results?
Regards,
Eric Piette
Imagine a game where you each turn place a number of connected stones of your color. Say, for simplicity, that you always place two connected stones. Naturally, you have to do this by first placing one stone and then a second stone next to it. So there are two moves each turn. Not all regions of empty cells can fit two connected stones, though. In the following image there is a region of one empty cell in the middle of the stones.
If I were to spend my first move placing here I would not be able to place a second stone connected to the first. What I can't figure out how to do is to make it illegal to place in such a region. That is: I want a restriction on where to place the first stone that ensures that I don't end up in a situation where I'm unable to place the second.
A slightly less simplified example: In the attached file you place a variable number of connected stones each turn. The number of stones, and therefore the number of moves, is dependent on where I place the first stone. But as things are in this file, I am able to place the first stone in a region where I wont be able to follow up with the rest of the stones (just like in the simpler example). What I want, but can't figure out how to define, is a restriction on where to place the first stone that ensures that I don't end up in a situation where I'm unable to place the rest.