The Token Games

claude-sonnet-4-6_vs_grok-4-fast-reasoning.jsonl — 10 puzzles

claude-sonnet-4-6

grok-4-fast-reasoning

-1

#1 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    try:
        n = int(x)
    except:
        return False
    if n <= 0 or len(x) != 4 or x[0] == '0':
        return False

    k = 0
    while (k + 1) ** 3 <= n:
        k += 1
    if k ** 3 != n:
        return False

    s = sum(int(c) for c in x)
    a, b = 1, 2
    while b < s:
        a, b = b, a + b
    if b != s:
        return False

    return x == x[::-1]

Solver Attempt

"1331"

Sample Solution

"1331"

Proposer: claude-sonnet-4-6 Solver: grok-4-fast-reasoning

0 vs 0

#2 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or not all(c.isdigit() for c in x):
        return False
    try:
        n = int(x)
    except ValueError:
        return False
    if len(x) != 6 or x[0] == '0':
        return False
    k = 0
    while (k + 1) ** 3 <= n:
        k += 1
    if k ** 3 != n:
        return False
    s = 0
    for c in x:
        s += int(c)
    if s < 2:
        return False
    p = 2
    while p * p <= s:
        if s % p == 0:
            return False
        p += 1
    evens = 0
    for c in x:
        if int(c) % 2 == 0:
            evens += 1
    if evens != 3:
        return False
    zeros = 0
    for c in x:
        if c == '0':
            zeros += 1
    if zeros != 2:
        return False
    return True

Solver Attempt

"300763"

Sample Solution

"300763"

Proposer: grok-4-fast-reasoning Solver: claude-sonnet-4-6

0 vs 0

#3 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    try:
        n = int(x)
    except:
        return False
    if len(x) != 5 or x[0] == '0':
        return False

    k = 0
    while k * k < n:
        k += 1
    if k * k != n:
        return False

    if x != x[::-1]:
        return False

    s = sum(int(c) for c in x)
    if n % s != 0:
        return False
    q = n // s
    j = 0
    while j * j < q:
        j += 1
    if j * j != q:
        return False

    return True

Solver Attempt

"12321"

Sample Solution

"12321"

Proposer: claude-sonnet-4-6 Solver: grok-4-fast-reasoning

0 vs 0

#4 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if not all(c.isdigit() for c in x):
        return False
    try:
        n = int(x)
    except ValueError:
        return False
    if len(x) != 5 or x[0] == '0':
        return False
    k = 0
    while (k + 1) ** 3 <= n:
        k += 1
    if k ** 3 != n:
        return False
    s = sum(int(c) for c in x)
    if s != k:
        return False
    evens = 0
    for c in x:
        if int(c) % 2 == 0:
            evens += 1
    if evens != 1:
        return False
    return True

Solver Attempt

"17576"

Sample Solution

'17576'

Proposer: grok-4-fast-reasoning Solver: claude-sonnet-4-6

0 vs 0

#5 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if not all(c.isdigit() for c in x):
        return False
    if len(x) != 7 or x[0] == '0':
        return False
    n = int(x)

    k = 1
    while k ** 4 < n:
        k += 1
    if k ** 4 != n:
        return False

    seen = 0
    for c in x:
        seen |= (1 << int(c))
    cnt = 0
    tmp = seen
    while tmp:
        cnt += tmp & 1
        tmp >>= 1
    if cnt != 3:
        return False

    s = 0
    for c in x:
        s += int(c)
    j = 0
    while j * j < s:
        j += 1
    if j * j != s:
        return False

    return True

Solver Attempt

"1336336"

Sample Solution

"1336336"

Proposer: claude-sonnet-4-6 Solver: grok-4-fast-reasoning

0 vs 0

#6 Sample Solution Wrong

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or not all(c.isdigit() for c in x):
        return False
    if len(x) != 6 or x[0] == '0':
        return False
    n = int(x)
    k = 0
    while (k + 1) ** 3 <= n:
        k += 1
    if k ** 3 != n:
        return False
    s = sum(int(c) for c in x)
    j = 0
    while j * j < s:
        j += 1
    if j * j != s:
        return False
    if n % s != 0:
        return False
    evens = 0
    for c in x:
        if int(c) % 2 == 0:
            evens += 1
    if evens != 4:
        return False
    if '0' in x:
        return False
    return True

Sample Solution

884736

Proposer: grok-4-fast-reasoning Solver: claude-sonnet-4-6

0 vs -1

#7 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or not all(c.isdigit() for c in x):
        return False
    if len(x) != 8 or x[0] == '0':
        return False
    n = int(x)

    k = 1
    while k ** 4 < n:
        k += 1
    if k ** 4 != n:
        return False

    s = sum(int(c) for c in x)
    j = 1
    while j ** 3 < s:
        j += 1
    if j ** 3 != s:
        return False

    if n % s != 0:
        return False

    seen = 0
    for c in x:
        seen |= (1 << int(c))
    cnt = 0
    tmp = seen
    while tmp:
        cnt += tmp & 1
        tmp >>= 1
    if cnt != 4:
        return False

    return True

Solver Attempt

"22667121"

Sample Solution

"22667121"

Proposer: claude-sonnet-4-6 Solver: grok-4-fast-reasoning

0 vs -1

#8 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or not all(c.isdigit() for c in x):
        return False
    if len(x) != 6 or x[0] == '0':
        return False
    try:
        n = int(x)
    except ValueError:
        return False
    k = 0
    while (k + 1) ** 3 <= n:
        k += 1
    if k ** 3 != n:
        return False
    ss = 0
    for c in x:
        d = int(c)
        ss += d * d
    j = 0
    while (j + 1) ** 2 <= ss:
        j += 1
    if j ** 2 != ss:
        return False
    zeros = 0
    prod = 1
    for c in x:
        d = int(c)
        if d == 0:
            zeros += 1
        else:
            prod *= d
    if zeros != 1:
        return False
    m = 0
    while (m + 1) ** 2 <= prod:
        m += 1
    if m ** 2 != prod:
        return False
    return True

Solver Attempt

"493039"

Sample Solution

"493039"

Proposer: grok-4-fast-reasoning Solver: claude-sonnet-4-6

0 vs -1

#9 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or not all(c.isdigit() for c in x):
        return False
    if len(x) != 7 or x[0] == '0':
        return False
    n = int(x)
    k = 1
    while k ** 4 < n:
        k += 1
    if k ** 4 != n:
        return False
    s = sum(int(c) for c in x)
    j = 1
    while j ** 3 < s:
        j += 1
    if j ** 3 != s:
        return False
    seen = 0
    for c in x:
        seen |= (1 << int(c))
    cnt = 0
    tmp = seen
    while tmp:
        cnt += tmp & 1
        tmp >>= 1
    if cnt != 7:
        return False
    return True

Solver Attempt

"5308416"

Sample Solution

"5308416"

Proposer: claude-sonnet-4-6 Solver: grok-4-fast-reasoning

0 vs -1

#10 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or not all(c.isdigit() for c in x):
        return False
    if len(x) != 6 or x[0] == '0':
        return False
    try:
        n = int(x)
    except ValueError:
        return False
    k = 0
    while (k + 1) ** 3 <= n:
        k += 1
    if k ** 3 != n:
        return False
    ss = 0
    for c in x:
        d = int(c)
        ss += d * d
    j = 0
    while (j + 1) ** 2 <= ss:
        j += 1
    if j ** 2 != ss:
        return False
    zeros = 0
    for c in x:
        if c == '0':
            zeros += 1
    if zeros != 1:
        return False
    prod = 1
    for c in x:
        d = int(c)
        if d != 0:
            prod *= d
    m = 0
    while (m + 1) ** 2 <= prod:
        m += 1
    if m ** 2 != prod:
        return False
    seen = 0
    for c in x:
        d = int(c)
        seen |= (1 << d)
    cnt = 0
    tmp = seen
    while tmp:
        cnt += tmp & 1
        tmp >>= 1
    if cnt != 4:
        return False
    return True

Solver Attempt

"493039"

Sample Solution

"493039"

Proposer: grok-4-fast-reasoning Solver: claude-sonnet-4-6

0 vs -1