The Token Games

gemini-3-pro-preview_vs_claude-opus-4-5-20251101_20260124_045350.jsonl — 10 puzzles

gemini-3-pro-preview

claude-opus-4-5-20251101

#1 Solved

Puzzle Code

def mystery(x):
    # Input must be a string of length 8
    if not isinstance(x, str) or len(x) != 8:
        return False
    
    # Convert characters to ASCII values
    v = [ord(c) for c in x]
    
    # Constraint 1: Product of the first 4 characters
    # 67 * 111 * 100 * 101
    if v[0] * v[1] * v[2] * v[3] != 75113700:
        return False
        
    # Constraint 2: Product of the last 4 characters
    # 71 * 97 * 109 * 101
    if v[4] * v[5] * v[6] * v[7] != 75818983:
        return False
        
    # Constraint 3: Weighted sum based on index
    # Sum(char_value * index)
    if sum(val * i for i, val in enumerate(v)) != 2744:
        return False
        
    return True

Solver Attempt

"CodeGame"

Sample Solution

"CodeGame"

Proposer: gemini-3-pro-preview Solver: claude-opus-4-5-20251101

0 vs 0

#2 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or len(x) != 6:
        return False
    if not x.isalpha() or not x.islower():
        return False
    
    v = [ord(c) - 97 for c in x]
    M = 10**9 + 7
    
    h = 0
    for i in range(6):
        h = (33 * h + v[i]) % M
    
    r = 0
    for i in range(5, -1, -1):
        r = (33 * r + v[i]) % M
    
    return h == 611675332 and r == 170513028 and sum(v) == 100

Solver Attempt

"puzzle"

Sample Solution

"puzzle"

Proposer: claude-opus-4-5-20251101 Solver: gemini-3-pro-preview

0 vs 0

#3 Solved

Puzzle Code

def mystery(x):
    # Input must be a string of length 8
    if not isinstance(x, str) or len(x) != 8:
        return False
    
    v = [ord(c) for c in x]
    
    # Constraint 1: Sum of the first half
    # 80 + 117 + 122 + 122
    if sum(v[:4]) != 441:
        return False
        
    # Constraint 2: Sum of the second half
    # 108 + 101 + 100 + 33
    if sum(v[4:]) != 342:
        return False
        
    # Constraint 3: Linear weighted sum
    # Sum(val * (index + 1))
    if sum(val * (i + 1) for i, val in enumerate(v)) != 3278:
        return False
        
    # Constraint 4: Rolling adjacent product sum
    # Sum(v[i] * v[i+1])
    if sum(v[i] * v[i+1] for i in range(7)) != 76002:
        return False
        
    # Constraint 5: Symmetric "folded" products
    # v[0]*v[7], v[1]*v[6], etc.
    if v[0] * v[7] != 2640: return False
    if v[1] * v[6] != 11700: return False
    if v[2] * v[5] != 12322: return False
    if v[3] * v[4] != 13176: return False
    
    return True

Solver Attempt

"Puzzled!"

Sample Solution

"Puzzled!"

Proposer: gemini-3-pro-preview Solver: claude-opus-4-5-20251101

0 vs 0

#4 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x < 10**7 or x >= 10**8:
        return False
    
    d = [int(c) for c in str(x)]
    
    if min(d) == 0:
        return False
    
    if sum(d) != 36:
        return False
    
    alt = 0
    for i in range(8):
        alt += d[i] if i % 2 == 0 else -d[i]
    if alt != 0:
        return False
    
    p = 1
    for digit in d:
        p *= digit
    if p != 40320:
        return False
    
    if x % 997 != 447:
        return False
    
    if int(str(x)[::-1]) % 997 != 571:
        return False
    
    return True

Solver Attempt

13247586

Sample Solution

13247586

Proposer: claude-opus-4-5-20251101 Solver: gemini-3-pro-preview

0 vs 0

#5 Sample Solution Wrong

Puzzle Code

def mystery(x):
    # Input must be a string of length 8
    if not isinstance(x, str) or len(x) != 8:
        return False
    
    # Convert to ASCII values
    v = [ord(c) for c in x]
    
    # Ensure characters are within standard printable ASCII range
    if any(c < 32 or c > 126 for c in v):
        return False
        
    # Constraint 1: Product of characters at even indices (0, 2, 4, 6)
    p_even = 1
    for i in range(0, 8, 2):
        p_even *= v[i]
    if p_even != 72404325:
        return False
        
    # Constraint 2: Product of characters at odd indices (1, 3, 5, 7)
    p_odd = 1
    for i in range(1, 8, 2):
        p_odd *= v[i]
    if p_odd != 143096800:
        return False
        
    # Constraint 3: Sum of adjacent products
    # Sum(v[i] * v[i+1]) for i = 0 to 6
    if sum(v[i] * v[i+1] for i in range(7)) != 74066:
        return False
        
    # Constraint 4: Sum of adjacent XOR differences
    # Sum(v[i] ^ v[i+1]) for i = 0 to 6
    if sum(v[i] ^ v[i+1] for i in range(7)) != 239:
        return False
        
    # Constraint 5: Total sum of ASCII values
    if sum(v) != 814:
        return False
        
    return True

Sample Solution

"KeysOpen"

Proposer: gemini-3-pro-preview Solver: claude-opus-4-5-20251101

-1 vs 0

#6 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, int) or x <= 0:
        return False
    
    if x < 100 or x > 200:
        return False
    
    cube = x ** 3
    if sum(int(c) for c in str(cube)) != 18:
        return False
    
    if x % 73 != 47:
        return False
    
    n = x * x + x + 41
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    
    return True

Solver Attempt

120

Sample Solution

120

Proposer: claude-opus-4-5-20251101 Solver: gemini-3-pro-preview

-1 vs 0

#7 Solver Failed

Puzzle Code

def mystery(x):
    # Input must be a string of length 10
    if not isinstance(x, str) or len(x) != 10:
        return False
    
    v = [ord(c) for c in x]
    
    # Ensure characters are printable ASCII
    if any(c < 32 or c > 126 for c in v):
        return False
        
    # Constraint 1: Symmetric pair sums (folding the string)
    # v[0]+v[9], v[1]+v[8], v[2]+v[7], etc.
    pairs = [v[i] + v[9-i] for i in range(5)]
    if pairs != [116, 214, 230, 212, 192]:
        return False
        
    # Constraint 2: Product of the first half
    p1 = 1
    for i in range(5):
        p1 *= v[i]
    if p1 != 12522994848:
        return False
        
    # Constraint 3: Product of the second half
    p2 = 1
    for i in range(5, 10):
        p2 *= v[i]
    if p2 != 3270282444:
        return False
        
    # Constraint 4: Alternating sum
    # v[0] - v[1] + v[2] - v[3] ...
    if sum(v[i] * ((-1)**i) for i in range(10)) != 70:
        return False
        
    return True

Solver Attempt

"SruepPoqd!"

Sample Solution

"SuperNova!"

Proposer: gemini-3-pro-preview Solver: claude-opus-4-5-20251101

0 vs 0

#8 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or len(x) != 8:
        return False
    
    v = [ord(c) for c in x]
    
    if any(c < 33 or c > 126 for c in v):
        return False
    
    # Product of first 4 characters
    if v[0] * v[1] * v[2] * v[3] != 101119590:
        return False
    
    # Product of last 4 characters
    if v[4] * v[5] * v[6] * v[7] != 81364140:
        return False
    
    # Sum of all ASCII values
    if sum(v) != 802:
        return False
    
    # XOR of all characters
    xor_val = 0
    for c in v:
        xor_val ^= c
    if xor_val != 112:
        return False
    
    # Sum of adjacent products
    if sum(v[i] * v[i+1] for i in range(7)) != 76576:
        return False
    
    return True

Solver Attempt

"Quantum7"

Sample Solution

"Quantum7"

Proposer: claude-opus-4-5-20251101 Solver: gemini-3-pro-preview

0 vs 0

#9 Solved

Puzzle Code

def mystery(x):
    # Input must be a string of length 12
    if not isinstance(x, str) or len(x) != 12:
        return False
    
    v = [ord(c) for c in x]
    
    # Ensure characters are printable ASCII
    if any(c < 32 or c > 126 for c in v):
        return False
        
    # Constraint 1: Product of Block 1 (indices 0-3)
    # v[0] * v[1] * v[2] * v[3]
    if v[0] * v[1] * v[2] * v[3] != 74218192:
        return False
        
    # Constraint 2: Product of Block 2 (indices 4-7)
    # v[4] * v[5] * v[6] * v[7]
    if v[4] * v[5] * v[6] * v[7] != 87141285:
        return False
        
    # Constraint 3: Product of Block 3 (indices 8-11)
    # v[8] * v[9] * v[10] * v[11]
    if v[8] * v[9] * v[10] * v[11] != 36296370:
        return False
        
    # Constraint 4: Symmetric pair sums
    # v[0]+v[11], v[1]+v[10], v[2]+v[9], etc.
    pairs = [v[i] + v[11-i] for i in range(6)]
    if pairs != [101, 198, 215, 207, 184, 204]:
        return False
        
    # Constraint 5: Weighted sum based on index
    # Sum(val * (index + 1))
    if sum(val * (i + 1) for i, val in enumerate(v)) != 7037:
        return False
        
    # Constraint 6: Sum of squared adjacent differences
    # Sum((v[i] - v[i+1])^2)
    if sum((v[i] - v[i+1])**2 for i in range(11)) != 6897:
        return False
        
    return True

Solver Attempt

"DataScience!"

Sample Solution

"DataScience!"

Proposer: gemini-3-pro-preview Solver: claude-opus-4-5-20251101

0 vs 0

#10 Solved

Puzzle Code

def mystery(x):
    if not isinstance(x, str) or len(x) != 9:
        return False
    
    v = [ord(c) for c in x]
    
    if any(c < 33 or c > 126 for c in v):
        return False
    
    # Row products
    if v[0] * v[1] * v[2] != 507584:
        return False
    if v[3] * v[4] * v[5] != 320166:
        return False
    if v[6] * v[7] * v[8] != 190080:
        return False
    
    # Column products
    if v[0] * v[3] * v[6] != 181104:
        return False
    if v[1] * v[4] * v[7] != 760320:
        return False
    if v[2] * v[5] * v[8] != 224334:
        return False
    
    # Diagonal products
    if v[0] * v[4] * v[8] != 251559:
        return False
    if v[2] * v[4] * v[6] != 489456:
        return False
    
    # Sum of all ASCII values
    if sum(v) != 659:
        return False
    
    # XOR of all characters
    xor_val = 0
    for c in v:
        xor_val ^= c
    if xor_val != 19:
        return False
    
    return True

Solver Attempt

"M@g1cB0x!"

Sample Solution

"M@g1cB0x!"

Proposer: claude-opus-4-5-20251101 Solver: gemini-3-pro-preview

0 vs 0