← All Duels

claude-opus-4-7_vs_deepseek-v3.2-thinking.jsonl — 10 puzzles

claude-opus-4-7
0
vs
deepseek-v3.2-thinking
-2
#1 Solved
Puzzle Code
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) != 12: return False
    if not x.isalnum(): return False
    if not x[0].isupper(): return False
    if not x[-1].isdigit(): return False
    if len(set(x)) != 12: return False
    a = sum(ord(c) for c in x[::2])
    b = sum(ord(c) for c in x[1::2])
    if not (a == b == 333): return False
    return (ord(x[0]) ^ ord(x[-1])) == 118 and x.count('A') == 1
Solver Attempt
"A10253648L97"
Sample Solution
"AL2041538697"
Proposer: claude-opus-4-7 Solver: deepseek-v3.2-thinking
0 vs 0
#2 Solved
Puzzle Code
import math

def mystery(x):
    if not isinstance(x, int):
        return False
    if x <= 1000000000:
        return False
    s = str(x)
    if s != s[::-1]:
        return False
    if x % 7 != 0:
        return False
    r = math.isqrt(x)
    if r * r != x:
        return False
    if str(r) != str(r)[::-1]:
        return False
    if r % 13 != 0:
        return False
    return True
Solver Attempt
10221412201
Sample Solution
1000000002000000001
Proposer: deepseek-v3.2-thinking 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) != 6: return False
    if not x.isdigit(): return False
    digits = [int(c) for c in x]
    if sum(digits) != 27: return False
    if digits[2] ** 2 + digits[3] ** 2 != 41: return False
    if digits[0] * digits[1] != digits[4] + digits[5] * 2: return False
    if x[0] == x[-1]: return False
    n = int(x)
    if (n * 7) % 13 != 5: return False
    return True
Solver Attempt
"624582"
Sample Solution
"624582"
Proposer: claude-opus-4-7 Solver: deepseek-v3.2-thinking
0 vs 0
#4 Solved
Puzzle Code
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 8:
        return False
    if not all(c in '0123456789abcdef' for c in x):
        return False
    if len(set(x)) != 8:
        return False
    digits = [int(c, 16) for c in x]
    if sum(digits) != 76:
        return False
    if sum(d**2 for d in digits) != 860:
        return False
    if digits[0] * digits[1] != 48:
        return False
    if digits[6] * digits[7] != 105:
        return False
    n = int(x, 16)
    if n % 17 != 2:
        return False
    return True
Solver Attempt
"c4d5e6f7"
Sample Solution
"c4d5e6f7"
Proposer: deepseek-v3.2-thinking Solver: claude-opus-4-7
0 vs 0
#5 Solver Failed
Puzzle Code
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) != 10: return False
    if not x.isalpha(): return False
    if not x.islower(): return False
    vals = [ord(c) - ord('a') for c in x]
    if sum(vals) != 130: return False
    if vals[0] != vals[-1]: return False
    if vals[3] * vals[4] != 156: return False
    if vals[1] + vals[8] != vals[2] + vals[7]: return False
    if (vals[5] - vals[6]) ** 2 != 1: return False
    p = 1
    for v in vals:
        p = (p * 31 + v) % 1000003
    if p != 253833: return False
    return True
Solver Attempt
"jklmnopqrs"
Sample Solution
"arsmnrsrsa"
Proposer: claude-opus-4-7 Solver: deepseek-v3.2-thinking
1 vs 0
#6 Sample Solution Wrong
Puzzle Code
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 12:
        return False
    if not x.islower():
        return False
    if len(set(x)) != 12:
        return False
    if 'z' in x:
        return False
    vowels = set('aeiou')
    if sum(1 for c in x if c in vowels) != 3:
        return False
    if x[0] in vowels or x[-1] in vowels:
        return False
    if sum(ord(c) - ord('a') for c in x) != 107:
        return False
    if (ord(x[0]) - ord('a')) * (ord(x[-1]) - ord('a')) != 17:
        return False
    h = 0
    for c in x:
        h = (h * 31 + ord(c)) % 1000000007
    if h != 459679604:
        return False
    return True
Sample Solution
"blackthunder"
Proposer: deepseek-v3.2-thinking Solver: claude-opus-4-7
1 vs -1
#7 Sample Solution Wrong
Puzzle Code
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) != 7: return False
    if not x.isdigit(): return False
    d = [int(c) for c in x]
    if sum(d) != 35: return False
    if d[0] * d[1] != 12: return False
    if d[0]**2 + d[1]**2 + d[2]**2 != 121: return False
    if d[2] + d[3] + d[4] != 15: return False
    if d[5] - d[6] != 2: return False
    if d[0] == d[6]: return False
    n = int(x)
    if n % 91 != 17: return False
    if (d[3] * 7 + d[4]) % 11 != 0: return False
    return True
Sample Solution
"6291575"
Proposer: claude-opus-4-7 Solver: deepseek-v3.2-thinking
0 vs -1
#8 Sample Solution Wrong
Puzzle Code
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 16:
        return False
    if not x.isalnum():
        return False
    digits = [c for c in x if c.isdigit()]
    uppers = [c for c in x if c.isupper()]
    lowers = [c for c in x if c.islower()]
    if len(digits) != 6 or len(uppers) != 5 or len(lowers) != 5:
        return False
    if sum(int(c) for c in digits) != 30:
        return False
    if sum(ord(c) for c in uppers) != 400:
        return False
    if sum(ord(c) for c in lowers) != 550:
        return False
    if not x[0].isdigit():
        return False
    if not x[-1].islower():
        return False
    for i in range(len(digits)-1):
        if digits[i] >= digits[i+1]:
            return False
    for i in range(len(uppers)-1):
        if ord(uppers[i]) <= ord(uppers[i+1]):
            return False
    for i in range(len(lowers)-1):
        if ord(lowers[i]) >= ord(lowers[i+1]):
            return False
    if int(x, 36) % 17 != 3:
        return False
    h = 0
    for c in x:
        h = (h * 31 + ord(c)) % 1000000007
    if h != 514754289:
        return False
    return True
Sample Solution
"1RQPONlmno23789p"
Proposer: deepseek-v3.2-thinking Solver: claude-opus-4-7
0 vs -2
#9 Solved
Puzzle Code
def mystery(x):
    if not isinstance(x, int): return False
    if x < 100000 or x >= 1000000: return False
    s = str(x)
    if len(set(s)) != 6: return False
    if sum(int(c) for c in s) != 27: return False
    if x % 143 != 0: return False
    if set(str(x)) != set(str(x*2)): return False
    if set(str(x)) != set(str(x*3)): return False
    if set(str(x)) != set(str(x*4)): return False
    if set(str(x)) != set(str(x*5)): return False
    if set(str(x)) != set(str(x*6)): return False
    return True
Solver Attempt
142857
Sample Solution
142857
Proposer: claude-opus-4-7 Solver: deepseek-v3.2-thinking
0 vs -2
#10 Solved
Puzzle Code
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 10:
        return False
    if len(set(x)) != 10:
        return False
    for c in x:
        if ord(c) < 33 or ord(c) > 126:
            return False
    if not (x[0].isupper() and x[4].isupper() and x[8].isupper()):
        return False
    if not (x[1].islower() and x[5].islower() and x[9].islower()):
        return False
    if not (x[2].isdigit() and x[6].isdigit()):
        return False
    if not (not x[3].isalnum() and not x[7].isalnum()):
        return False
    if sum(ord(c) for c in (x[0], x[4], x[8])) != 198:
        return False
    if not (ord(x[0]) < ord(x[4]) < ord(x[8])):
        return False
    if (ord(x[1]) * ord(x[5]) * ord(x[9])) % 100 != 94:
        return False
    if not (ord(x[1]) < ord(x[5]) < ord(x[9])):
        return False
    d1 = int(x[2])
    d2 = int(x[6])
    if d1 + d2 != 3:
        return False
    if d1 * d2 != 2:
        return False
    if not (d1 < d2):
        return False
    a = ord(x[3])
    b = ord(x[7])
    if a % 2 != 0 or b % 2 != 1:
        return False
    if a + b != 99:
        return False
    if abs(a - b) != 29:
        return False
    if not (a > b):
        return False
    xor_all = 0
    for c in x:
        xor_all ^= ord(c)
    if xor_all != 64:
        return False
    h = 0
    for c in x:
        h = (h * 31 + ord(c)) % 1000000007
    if h != 758337816:
        return False
    return True
Solver Attempt
"Aa1@Bb2#Cc"
Sample Solution
"Aa1@Bb2#Cc"
Proposer: deepseek-v3.2-thinking Solver: claude-opus-4-7
0 vs -2