Go Zendo

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 :smiley:

Well done!

8 Likes

Nice! My hypothesis was something about the smallest path going through all Black stones

2 Likes

I’m not sure I’d want to solve the traveling salesman problem every time I check a koan :smiley: :smiley:

8 Likes

Well, you’d only have to check it for a small number of stones, 4 or 5 at most

1 Like

Martin, do you want to do the next puzzle? Otherwise I’m happy to do another one, I’m not short on possible rules :slight_smile:

1 Like

There are just (2 to the power of legal positions) rules if I’m not mistaken. So don’t waste them too quickly!

5 Likes

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 :smiley:

3 Likes

On larger boards I sense a problem with writing them down in the observable universe.

1 Like

Thank you for hosting, and please feel free to start a new one! :grin:

2 Likes

Ok new rule. Good Luck and have fun!

initial koans:
imageimage

guessed koans:
imageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimageimage

guessed rules:

more black than white stones. Counter:
imageimage
A black stone between white stones must touch one of them. Counter:
image image
If there are at least two white chains, one of them sees all other white chains. Counter:
imageimage

5 Likes

Let’s pin down the first quantifier again.

image

2 Likes

image

1 Like

Number of black stones >= number of white stones

2 Likes

counterexamples:
imageimage

3 Likes

Starting simple:

image image

2 Likes

image image

3 Likes

Decomposing #475:

imageimageimageimage

3 Likes

image image image image

2 Likes

Rule guess: If there is a black stone between two white stones (same row or column), it is touching one of them.

1 Like

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.:

Koan_492

2 Likes