I could ignore this guess, but since it’s verbatim the rule that I have in mind it would feel silly not to confirm it ![]()
Well done!
I could ignore this guess, but since it’s verbatim the rule that I have in mind it would feel silly not to confirm it ![]()
Well done!
Nice! My hypothesis was something about the smallest path going through all Black stones
I’m not sure I’d want to solve the traveling salesman problem every time I check a koan
![]()
Well, you’d only have to check it for a small number of stones, 4 or 5 at most
Martin, do you want to do the next puzzle? Otherwise I’m happy to do another one, I’m not short on possible rules ![]()
There are just (2 to the power of legal positions) rules if I’m not mistaken. So don’t waste them too quickly!
Oh, then let’s just pick one of those at random!
We’ll only have to guess every legal position to pin it down precisely ![]()
On larger boards I sense a problem with writing them down in the observable universe.
Thank you for hosting, and please feel free to start a new one! ![]()
Ok new rule. Good Luck and have fun!
initial koans:


guessed koans:



























guessed rules:
more black than white stones. Counter:


A black stone between white stones must touch one of them. Counter:

If there are at least two white chains, one of them sees all other white chains. Counter:


Let’s pin down the first quantifier again.


Number of black stones >= number of white stones
counterexamples:


Starting simple:


Decomposing #475:





Rule guess: If there is a black stone between two white stones (same row or column), it is touching one of them.
With the empty board being green, and considering Koan 475 and its variations, I’m thinking the rule could be something like “Red if there are stones satisfying [condition]”. If this is the case, we might be able to pinpoint this condition by further removing stones from 484, e.g.:
