Cooperative Zendo

[DanielH]

Somewhere pages ago I said that if the rule involved composite numbers it might be a good idea to arrange them in a grid, but I never tried it because I forgot that idea once I had the chance to try. I don’t know if trying would have helped me or not; Lambda cane up with the ascenders/descenders idea and I don’t know if I’d have gotten it on my own.

[Unbitwise]

I was so tempted to encourage investigation of the grid thing.

[Lambda]

I think it was pretty obscure, yeah.

I think "aaaacccdpeeemmmm" fits Unbitwise's rule but not DanielH's.

I did try to arrange guesses in grids, but I misunderstood what you meant.

[Lambda]

actual example: "allergen"

Code: Select all

al
le
rg
en

alle
rgen

[DanielH]

That fits my rule. Here l is 8 and p is 2, so l/p is 4. Only the first four letters have ascenders, and only the last four have descenders.

[Lambda]

Oh, I see. Yes.

[DanielH]

Okay, I’ll start the next game.

Projected difficulty: Tricky, but not difficult.

Allowed strings: Zero or more hexadecimal digits, in lowercase; [0-9a-f]*
Rule SHA-1: 074b5f19b6226a5ef8e524985218f102e41fc5f5
Initial yes: f8
Initial no: b4

Apparently my rule (using leetspeak) allows the future but not the past.

[DanielH]

(This post will be edited)

For your convenience, I’ll automatically convert uppercase to lowercase and strip off a leading 0x. Okay, I’m not at all sure that last part will help with anybody’s convenience, but I’ll do it anyway.

[Throne3d]

(empty string)
0
1

f7
f6
f5
f4
e4
d4
c4

[DanielH]

Yes: 0, 1, e4, f5, (the empty string)
No: c4, d4, f4, f6, f7

Information

---

Initial post: [url]None[/url]
SHA-1: 074b5f19b6226a5ef8e524985218f102e41fc5f5

Yes:
(the empty string)
0
1
e4
f5
f8

No:
b4
c4
d4
f4
f6
f7