The Token Games

claude-opus-4-5-20251101_vs_grok-4_20260124_125523.jsonl — 10 puzzles

claude-opus-4-5-20251101

grok-4

-4

#1 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    binary = bin(x)[2:]
    return (binary.count('1') == 10 and 
            len(binary) == 20 and 
            binary == binary[::-1] and
            '000' not in binary)

Solver Attempt

698709

Sample Solution

698709

Proposer: claude-opus-4-5-20251101 Solver: grok-4

0 vs 0

#2 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    binary = bin(x)[2:]
    return (len(binary) == 25 and 
            binary.count('1') == 12 and 
            binary == binary[::-1] and
            '0000' not in binary and
            '1111' not in binary)

Solver Attempt

22365525

Sample Solution

22365525

Proposer: grok-4 Solver: claude-opus-4-5-20251101

0 vs 0

#3 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    b = bin(x)[2:]
    if len(b) != 32:
        return False
    p = [int(b[i:i+8], 2) for i in range(0, 32, 8)]
    if (p[0]^p[1], p[1]^p[2], p[2]^p[3]) != (90, 165, 90):
        return False
    if bin(p[0]).count('1') != 4:
        return False
    q = p[3]
    return q > 1 and all(q % i for i in range(2, int(q**0.5) + 1))

Solver Attempt

2396287275

Sample Solution

2396287275

Proposer: claude-opus-4-5-20251101 Solver: grok-4

0 vs 0

#4 Sample Solution Wrong

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    b = bin(x)[2:]
    if len(b) != 64:
        return False
    p = [int(b[i:i+8], 2) for i in range(0, 64, 8)]
    if (p[0] ^ p[1], p[2] ^ p[3], p[4] ^ p[5], p[6] ^ p[7]) != (60, 51, 34, 51):
        return False
    for pp in p:
        if bin(pp).count('1') != 4:
            return False
    return True

Sample Solution

1095313033231975408

Proposer: grok-4 Solver: claude-opus-4-5-20251101

0 vs -1

#5 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    s = str(x)
    if len(s) != 12 or '0' in s:
        return False
    d = [int(c) for c in s]
    for i in range(0, 12, 3):
        n = int(s[i:i+3])
        if n % 37 != 0:
            return False
    return sum(d) == 54 and d[0] == d[11]

Solver Attempt

333666666333

Sample Solution

148555148481

Proposer: claude-opus-4-5-20251101 Solver: grok-4

0 vs -1

#6 Sample Solution Wrong

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    b = bin(x)[2:]
    if len(b) != 64:
        return False
    p = [int(b[i:i+8], 2) for i in range(0, 64, 8)]
    if (p[0] ^ p[1], p[2] ^ p[3], p[4] ^ p[5], p[6] ^ p[7]) != (136, 24, 255, 15):
        return False
    for pp in p:
        if bin(pp).count('1') != 4:
            return False
    return True

Sample Solution

17327616158284761442

Proposer: grok-4 Solver: claude-opus-4-5-20251101

0 vs -2

#7 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or len(x) != 12:
        return False
    try:
        n = int(x, 16)
    except:
        return False
    if n <= 0:
        return False
    b = bin(n)[2:].zfill(48)
    if b != b[::-1]:
        return False
    if b.count('1') != 24:
        return False
    if '00000' in b or '11111' in b:
        return False
    return True

Solver Attempt

"555555AAAAAA"

Sample Solution

"d9294bd2949b"

Proposer: claude-opus-4-5-20251101 Solver: grok-4

0 vs -2

#8 Sample Solution Wrong

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    b = bin(x)[2:]
    if len(b) != 64:
        return False
    p = [int(b[i:i+8], 2) for i in range(0, 64, 8)]
    if (p[0] ^ p[1], p[2] ^ p[3], p[4] ^ p[5], p[6] ^ p[7]) != (15, 240, 170, 85):
        return False
    for pp in p:
        if bin(pp).count('1') != 4:
            return False
    return True

Sample Solution

14108708065698451290

Proposer: grok-4 Solver: claude-opus-4-5-20251101

0 vs -3

#9 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    
    s = str(x)
    if len(s) != 9:
        return False
    
    if sorted(s) != list('123456789'):
        return False
    
    r = int(x ** 0.5)
    if r * r != x:
        r += 1
        if r * r != x:
            return False
    
    rs = str(r)
    if len(rs) != 5:
        return False
    if r % 6 != 0:
        return False
    if int(rs[1]) != 9:
        return False
    if int(rs[0]) + int(rs[4]) != 6:
        return False
    
    return True

Solver Attempt

842973156

Sample Solution

842973156

Proposer: claude-opus-4-5-20251101 Solver: grok-4

0 vs -3

#10 Sample Solution Wrong

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    b = bin(x)[2:]
    if len(b) != 64:
        return False
    p = [int(b[i:i+8], 2) for i in range(0, 64, 8)]
    if (p[0] ^ p[1], p[2] ^ p[3], p[4] ^ p[5], p[6] ^ p[7]) != (136, 27, 51, 90):
        return False
    for pp in p:
        if bin(pp).count('1') != 4:
            return False
    return True

Sample Solution

983204549855239619

Proposer: grok-4 Solver: claude-opus-4-5-20251101

0 vs -4