Cooperative Zendo

[pedromvilar]

Yes, I edited the post to clarify that.

[pedromvilar]

I like being the Master so I'll do it again and link to this post (and if anyone else wants to we can run more than one game here, or run more games in other threads). This time I'm hashing using SHA1 as per http://www.sha1-online.com/.

The acceptable format for Koans is strings of Roman alphabet letters (disregarding accents) and numbers.

The hash of the rule is: 65d628ed70ecb5044091a435e47531b718adec22

'bbc' obeys the rule
'bee' does not

This is a very complex rule and I expect it might take days for people to solve it.

[Throne3d]

old trials that I am actually not submitting

---

See the edit – these are not being submitted.
The letters of the alphabet ('a' through 'z', that is), one letter per string. ('a', 'b', …)
(And uppercase equivalents?)

abcdefghijklmnopqrstuvwxyz
ABCDEFGHIJKLMNOPQRSTUVWXYZ
1234567890
0123456789
9876543210
0987654321
987654321

1
2
3
4
5
6
7
8
9
0

Yes, I am just trying a bunch of the easy ones from last time.
Edit: I feel mean posting such a large list, and MTC has suggested we have a limit for the number of koans you can test at once. So. Maybe we should come up with one of those.

Edit2: People seem to (in the IRC) want to settle on 5 or 10 at a time per person? So I'll instead change what I'm testing to these five:
'0'
'1'
'2'
'3'
'4'

[pedromvilar]

old trials that I am actually not submitting

---

See the edit – these are not being submitted.
The letters of the alphabet ('a' through 'z', that is), one letter per string. ('a', 'b', …)
(And uppercase equivalents?)

abcdefghijklmnopqrstuvwxyz
ABCDEFGHIJKLMNOPQRSTUVWXYZ
1234567890
0123456789
9876543210
0987654321
987654321

1
2
3
4
5
6
7
8
9
0

Yes, I am just trying a bunch of the easy ones from last time.
Edit: I feel mean posting such a large list, and MTC has suggested we have a limit for the number of koans you can test at once. So. Maybe we should come up with one of those.

Edit2: People seem to (in the IRC) want to settle on 5 or 10 at a time per person? So I'll instead change what I'm testing to these five:
'0'
'1'
'2'
'3'
'4'

No, no, yes, yes, no

And yeah that seemed like a reasonable rule, I think limiting the number of unanswered Koans per person to 10 is a good and added that to the rules at the top.

Information

---

Acceptable Format
Strings of Roman alphabet letters (disregarding accents) and numbers.

Rule Hash
65d628ed70ecb5044091a435e47531b718adec22

Yes
bbc
2
3

No
bee
0
1
4

[Throne3d]

'5'
'6'
'7'
'8'
'9'
'a'
'b'
'c'
'd'
'e'

Edit: 'e' instead of '0' <_<

[pedromvilar]

'5'
'6'
'7'
'8'
'9'
'a'
'b'
'c'
'd'
'e'

Yes, no, yes, no, no, no, yes, yes, no, yes

I am revising my estimate of the difficulty of this rule down, significantly.

Information

---

Acceptable Format
Strings of Roman alphabet letters (disregarding accents) and numbers.

Rule Hash
65d628ed70ecb5044091a435e47531b718adec22

Yes
bbc
2
3
5
7
b
c
e

No
bee
0
1
4
6
8
9
a
d

[MTC]

02
03
04
13
15
ABCDEFGHIJKLMNOPQRSTUVWXYZ
abcdefghijklmnopqrstuvwxyz
A
BBC
BEE

[Throne3d]

I feel like I have to do math now. The fact the numbers went 'no, no, yes, yes, no, yes, no, yes, no, no' (0 through 9) seems – curious somehow? Maybe? I'm guessing it's something like ASCII or an ordinal representation of each number, then you're, I dunno, adding together and seeing if it's a multiple of two? Except not two, because it looks like something like maybe-fizzbuzz. (This isn't an actual guess, just my thoughts for other people.)

'00'
'01'
'05'
'10'
'11'
'20'
'21'
'30'
'40'
'50'

[DanielH]

'bb'
'b'
'be'

'BBC'
'BEE'

'11'
'13'
'17'

'10'
'12'

[DanielH]

Throne: for single digits the rule is identical to primes. No clue how that extends to the alphabet yet.