The Token Games

claude-opus-4-7_vs_grok-4-fast-reasoning.jsonl — 10 puzzles

claude-opus-4-7

grok-4-fast-reasoning

#1 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 100000 or x > 999999:
        return False
    s = str(x)
    if s != s[::-1]:
        return False
    if x % 7 != 0:
        return False
    if x % 13 != 0:
        return False
    digits = [int(c) for c in s]
    if digits[0] * digits[1] * digits[2] != 24:
        return False
    return True

Solver Attempt

262262

Sample Solution

262262

Proposer: claude-opus-4-7 Solver: grok-4-fast-reasoning

0 vs 0

#2 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 100000 or x > 999999:
        return False
    s = str(x)
    if len(s) != 6 or s != s[::-1]:
        return False
    digits = [int(c) for c in s]
    if digits[0] * digits[1] * digits[2] != 30:
        return False
    if digits[0] + digits[1] + digits[2] != 10:
        return False
    if digits[1] * digits[2] * digits[3] != 75:
        return False
    return True

Solver Attempt

235532

Sample Solution

235532

Proposer: grok-4-fast-reasoning Solver: claude-opus-4-7

0 vs 0

#3 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 8:
        return False
    if not x.isalpha() or not x.islower():
        return False
    vals = [ord(c) - ord('a') for c in x]
    if sum(vals) != 50:
        return False
    if (vals[0] * vals[1] + vals[2] * vals[3]) % 17 != 5:
        return False
    if (vals[4] - vals[5] + vals[6] - vals[7]) != 3:
        return False
    if vals[0] != vals[7]:
        return False
    if x[1:4] != x[4:7][::-1]:
        return False
    return True

Solver Attempt

"amlcclma"

Sample Solution

"flgddglf"

Proposer: claude-opus-4-7 Solver: grok-4-fast-reasoning

0 vs 0

#4 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 1000 or x > 9999:
        return False
    s = str(x)
    if len(s) != 4:
        return False
    digits = [int(c) for c in s]
    if sum(digits) != 15:
        return False
    if digits[0] * digits[1] * digits[2] * digits[3] != 120:
        return False
    if x % 17 != 0:
        return False
    return True

Solver Attempt

2652

Sample Solution

2652

Proposer: grok-4-fast-reasoning Solver: claude-opus-4-7

0 vs 0

#5 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 10:
        return False
    if not all(c in '0123456789' for c in x):
        return False
    d = [int(c) for c in x]
    if d[0] != d[9]:
        return False
    if d[0] + d[1] + d[2] != 7:
        return False
    if d[3] * d[4] != 12:
        return False
    if d[5] - d[6] != 3:
        return False
    if (d[7] + d[8] + d[9]) % 5 != 2:
        return False
    if d[1]**2 + d[2]**2 + d[7]**2 != 50:
        return False
    if d[3] + d[5] + d[6] + d[8] != 14:
        return False
    return True

Solver Attempt

"6012630796"

Sample Solution

"2053474502"

Proposer: claude-opus-4-7 Solver: grok-4-fast-reasoning

0 vs 0

#6 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 10000 or x > 99999:
        return False
    s = str(x)
    if len(s) != 5:
        return False
    digits = [int(c) for c in s]
    if digits[0] == 0:
        return False
    if sum(digits) != 20:
        return False
    prod = 1
    for d in digits:
        prod *= d
    if prod != 720:
        return False
    if digits[1] * digits[3] != 20:
        return False
    if x % 23 != 0:
        return False
    return True

Solver Attempt

25346

Sample Solution

25346

Proposer: grok-4-fast-reasoning Solver: claude-opus-4-7

0 vs 0

#7 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 100000 or x > 999999:
        return False
    s = str(x)
    d = [int(c) for c in s]
    if sum(d) != 25:
        return False
    if d[0]*d[5] != 18:
        return False
    if d[1]*d[4] != 12:
        return False
    if d[2]*d[3] != 20:
        return False
    if d[0] > d[1] > d[2]:
        return False
    if (d[0] + d[2] + d[4]) - (d[1] + d[3] + d[5]) != 1:
        return False
    if x % 17 != 12:
        return False
    return True

Solver Attempt

644533

Sample Solution

644533

Proposer: claude-opus-4-7 Solver: grok-4-fast-reasoning

0 vs 0

#8 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 100000 or x > 999999:
        return False
    s = str(x)
    if len(s) != 6:
        return False
    digits = [int(c) for c in s]
    if sum(digits) != 21:
        return False
    if digits[0] * digits[1] * digits[2] != 6:
        return False
    if digits[3] * digits[4] * digits[5] != 120:
        return False
    if digits[1] * digits[4] != 10:
        return False
    if digits[0] + digits[5] != 7:
        return False
    if digits[2] + digits[3] != 7:
        return False
    if digits[0] + digits[3] != 5:
        return False
    return True

Solver Attempt

123456

Sample Solution

123456

Proposer: grok-4-fast-reasoning Solver: claude-opus-4-7

0 vs 0

#9 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 7:
        return False
    if not x.isalpha() or not x.islower():
        return False
    v = [ord(c) - ord('a') for c in x]
    if sum(v) != 77:
        return False
    if v[0] + v[6] != 25:
        return False
    if v[1] * v[5] != 144:
        return False
    if v[2] - v[4] != 5:
        return False
    if v[3] != 13:
        return False
    if (v[0] * v[2] + v[4] * v[6]) % 23 != 7:
        return False
    if v[0] < v[1] < v[2]:
        return False
    return True

Solver Attempt

"tghncyg"

Sample Solution

"emknfmv"

Proposer: claude-opus-4-7 Solver: grok-4-fast-reasoning

0 vs 0

#10 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 10000 or x > 99999:
        return False
    s = str(x)
    if len(s) != 5:
        return False
    digits = [int(c) for c in s]
    if digits[0] == 0:
        return False
    if sum(digits) != 23:
        return False
    if digits[0] * digits[4] != 36:
        return False
    if digits[1] * digits[3] != 20:
        return False
    if sum(digits[:3]) != 14:
        return False
    if sum(digits[2:]) != 10:
        return False
    return True

Solver Attempt

94154

Sample Solution

94154

Proposer: grok-4-fast-reasoning Solver: claude-opus-4-7

0 vs 0