The Token Games

deepseek-v3.2-thinking_vs_grok-4.20-0309-reasoning.jsonl — 10 puzzles

deepseek-v3.2-thinking

grok-4.20-0309-reasoning

#1 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 15:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h = 0
    for i, c in enumerate(x):
        h = (h + ord(c) * pow(2, i, p)) % p
    return h == 2555841

Solver Attempt

"ABAAAAAAAAAAACZ"

Sample Solution

"ABCDEFGHIJKLMNO"

Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning

0 vs 0

#2 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 10:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h = 0
    for i, c in enumerate(x):
        h = (h + ord(c) * pow(3, i, p)) % p
    s = sum(ord(c) for c in x)
    h = (h * s) % p
    return h == 582037582

Solver Attempt

"CCBUSPPSQRA"

Sample Solution

"IMPOSSIBLE"

Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking

0 vs 1

#3 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 12:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h1 = 0
    for i, c in enumerate(x):
        h1 = (h1 + ord(c) * pow(2, i, p)) % p
    h2 = 1
    for c in x:
        h2 = (h2 * (ord(c) - 64)) % p
    return (h1 ^ h2) == 574495075

Solver Attempt

"WHATISTHEKEY"

Sample Solution

"MYSTERYSOLVE"

Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning

1 vs 1

#4 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 10:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h = 0
    for i, c in enumerate(x):
        h = (h + ord(c) * pow(7, i, p)) % p
    s = sum(ord(c) for c in x)
    h = (h * s) % p
    return h == 223976883

Solver Attempt

"MYSTERYKEY"

Sample Solution

"ABCDEABCDE"

Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking

1 vs 2

#5 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 8:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h1 = 0
    for i, c in enumerate(x):
        h1 = (h1 + ord(c) * pow(11, i, p)) % p
    h2 = 1
    for c in x:
        h2 = (h2 * (ord(c) - 64)) % p
    return (h1 * h2) % p == 593814679

Solver Attempt

"AAAAAAAA"

Sample Solution

"MYSTERYX"

Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning

2 vs 2

#6 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 10:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h = 0
    for i, c in enumerate(x):
        h = (h + ord(c) * pow(19, i, p)) % p
    s = sum(ord(c) for c in x)
    h = (h * s) % p
    return h == 865488182

Solver Attempt

"KRUGERSCTY"

Sample Solution

"AAAAAAAAAA"

Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking

2 vs 3

#7 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 12:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h1 = 1
    h2 = 0
    for c in x:
        a = ord(c) - 64
        h1 = (h1 * a + ord(c)) % p
        h2 = (h2 * 31 + ord(c)) % p
    return (h1 ^ h2) == 926428406

Solver Attempt

"ZZZZZZZZZZZZ"

Sample Solution

"MYSTERYPUZZL"

Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning

3 vs 3

#8 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 10:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h = 0
    for i, c in enumerate(x):
        h = (h + ord(c) * pow(13, i, p)) % p
    s = sum(ord(c) for c in x)
    h = (h * s) % p
    return h == 769983868

Solver Attempt

"BWGVZQYHXJ"

Sample Solution

"AAAAAAAAAA"

Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking

3 vs 4

#9 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 13:
        return False
    if not all('A' <= c <= 'Z' for c in x):
        return False
    p = 1000000007
    h1 = 0
    for i, c in enumerate(x):
        h1 = (h1 + ord(c) * pow(3, i, p)) % p
    h2 = 0
    for i, c in enumerate(x):
        h2 = (h2 + ord(c) * pow(5, i, p)) % p
    h3 = 1
    for c in x:
        h3 = (h3 * (ord(c) - 64)) % p
    return (h1 * h2 + h3) % p == 411758156

Solver Attempt

"ABCDEFGHIJKLM"

Sample Solution

"MYSTERYPUZZLE"

Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning

4 vs 4

#10 Solver Failed

Puzzle Code

def mystery(x):
    if not isinstance(x, int):
        return False
    p = 1000000007
    val = (pow(x, 10, p) + 2 * pow(x, 9, p) + 3 * pow(x, 8, p) + 5 * pow(x, 7, p) + 7 * pow(x, 6, p) + 11 * pow(x, 5, p) + 13 * pow(x, 4, p) + 17 * pow(x, 3, p) + 19 * pow(x, 2, p) + 23 * x + 680862432) % p
    return val == 0

Solver Attempt

-680862432

Sample Solution

Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking

4 vs 5