← All Duels

gemini-3.1-pro-preview_vs_claude-opus-4-7.jsonl — 10 puzzles

gemini-3.1-pro-preview
-1
vs
claude-opus-4-7
0
#1 Solved
def mystery(x):
    if not isinstance(x, str):
        return False
    
    parts = x.split('_')
    if len(parts) != 3:
        return False
        
    if not all(p.isdigit() for p in parts):
        return False
        
    a, b, c = map(int, parts)
    
    if str(a)[::-1] != str(b):
        return False
        
    if a == b:
        return False
        
    if a * b - c != 1086810744:
        return False
        
    if a**2 + b**2 + c**2 != 10054564947:
        return False
        
    return True
"10989_98901_12345"
"10989_98901_12345"
Proposer: gemini-3.1-pro-preview Solver: claude-opus-4-7
0 vs 0
#2 Solved
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) != 6: return False
    if not x.isdigit(): return False
    n = int(x)
    if n % 7 != 6: return False
    if (n * n) % 1000000 != 309441: return False
    digits = [int(c) for c in x]
    if sum(digits) != 27: return False
    if digits[0] * digits[5] != 7: return False
    p = 1
    for d in digits:
        p = (p * (d + 1)) % 100003
    if p != 11520: return False
    return True
"739521"
"739521"
Proposer: claude-opus-4-7 Solver: gemini-3.1-pro-preview
0 vs 0
#3 Sample Solution Wrong
def mystery(x):
    if type(x) is not str: return False
    if len(x) != 8: return False
    if not x.islower(): return False
    if len(set(x)) != 8: return False
    
    def score(guess):
        res = []
        for i in range(8):
            if guess[i] == x[i]: 
                res.append('G')
            elif guess[i] in x: 
                res.append('Y')
            else: 
                res.append('B')
        return "".join(res)
        
    if score("keyboard") != "BYBBYBYB": return False
    if score("macaroni") != "YBYBYYBB": return False
    if score("triangle") != "YYBBBBYY": return False
    if score("monsters") != "YGBBYYYB": return False
    if score("solitude") != "BGBBYYBY": return False
    if score("peculiar") != "YYYYBBBG": return False
    
    return True
"computer"
Proposer: gemini-3.1-pro-preview Solver: claude-opus-4-7
-1 vs 0
#4 Solved
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
    
    s = sum(ord(c) for c in x)
    if s != 1090: return False  
    
    p = 1
    for c in x:
        p = (p * ord(c)) % 1000003
    if p != 895522: return False
    
    vowels = sum(1 for c in x if c in 'aeiou')
    if vowels != 4: return False
    
    if x[0] != 'm': return False
    if x[-1] != 'g': return False
    if x[3] != x[7]: return False
    
    return True
"motivating"
"motivating"
Proposer: claude-opus-4-7 Solver: gemini-3.1-pro-preview
-1 vs 0
#5 Solved
def mystery(code_str):
    if not isinstance(code_str, str): return False
    
    if len(code_str) > 100: return False
    if 'eval' in code_str or 'exec' in code_str or 'import' in code_str: return False
    if 'puzzle' not in code_str: return False
    
    try:
        f = eval(code_str)
        if type(f).__name__ != 'function': return False
        return f() == code_str
    except:
        return False
"lambda p='puzzle',s='lambda p=%r,s=%r: s%%(p,s)': s%(p,s)"
"(lambda: (lambda puzzle: puzzle % puzzle)('(lambda: (lambda puzzle: puzzle %% puzzle)(%r))'))"
Proposer: gemini-3.1-pro-preview Solver: claude-opus-4-7
-1 vs 0
#6 Solved
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) != 8: return False
    if not x.isalpha(): return False
    if not x.islower(): return False
    if x[0] != 'p': return False
    if x[-1] != 'g': return False
    if 'z' in x: return False
    
    s1 = sum(ord(c) for c in x)
    s2 = sum(ord(c)**2 for c in x)
    s3 = sum(ord(c)**3 for c in x)
    if s1 != 836: return False
    if s2 != 87552: return False
    if s3 != 9188966: return False
    
    h = 0
    for c in x:
        h = (h * 31 + ord(c)) % 1000000007
    if h != 247365026: return False
    
    return True
"pleading"
"pleading"
Proposer: claude-opus-4-7 Solver: gemini-3.1-pro-preview
-1 vs 0
#7 Solver Failed
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) > 45: return False
    
    # No digits, no quotes, no backslashes, no dots allowed!
    if any(c in x for c in '0123456789"\'\\.'): 
        return False
        
    try:
        # The string must evaluate to exactly 2024
        return eval(x) == 2024
    except:
        return False
`(a:=len(str(abs)))*(a-True)*-~-~-~True`
"len(x)*(len(x)+True+True) "
Proposer: gemini-3.1-pro-preview Solver: claude-opus-4-7
0 vs 0
#8 Solved
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) != 6: return False
    if not x.isdigit(): return False
    
    n = int(x)
    
    if x[0] != '1': return False
    if x[1] != x[2]: return False
    
    if sum(int(c) for c in x) != 20: return False
    
    p = 1
    for c in x:
        p *= int(c)
    if p != 504: return False
    
    if n % 7 != 0: return False
    if (n * n) % 1000000 != 922564: return False
    
    return True
"133742"
"133742"
Proposer: claude-opus-4-7 Solver: gemini-3.1-pro-preview
0 vs 0
#9 Sample Solution Wrong
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) > 35: return False
    if not set(x).issubset(set('IDFOBSR')): return False
    
    t = [0] * 10
    p = 0
    out = []
    pc = 0
    loops = 0
    
    while pc < len(x) and loops < 10000:
        loops += 1
        c = x[pc]
        
        if c == 'I': t[p] = (t[p] + 1) % 256
        elif c == 'D': t[p] = (t[p] - 1) % 256
        elif c == 'F': p = (p + 1) % 10
        elif c == 'B': p = (p - 1) % 10
        elif c == 'O': out.append(chr(t[p] ^ 42))
        elif c == 'S':
            if t[p] == 0:
                d = 1
                while d > 0:
                    pc += 1
                    if pc >= len(x): return False
                    if x[pc] == 'S': d += 1
                    elif x[pc] == 'R': d -= 1
        elif c == 'R':
            if t[p] != 0:
                d = 1
                while d > 0:
                    pc -= 1
                    if pc < 0: return False
                    if x[pc] == 'R': d += 1
                    elif x[pc] == 'S': d -= 1
        pc += 1
        
    return "".join(out) == "OK"
"IIIIIIIIIISFIIIIIIIIIIBDRFIOODDDDO"
Proposer: gemini-3.1-pro-preview Solver: claude-opus-4-7
-1 vs 0
#10 Solved
def mystery(x):
    if not isinstance(x, str): return False
    if len(x) != 16: return False
    if not all(c in 'NSEW' for c in x): return False
    
    pos = (0, 0)
    visited = []
    for c in x:
        visited.append(pos)
        if c == 'N': pos = (pos[0], pos[1]+1)
        elif c == 'S': pos = (pos[0], pos[1]-1)
        elif c == 'E': pos = (pos[0]+1, pos[1])
        elif c == 'W': pos = (pos[0]-1, pos[1])
    visited.append(pos)
    
    if len(set(visited)) != 16: return False
    if pos != (0, 0): return False
    
    points = set(visited)
    required = {(2, 0), (2, 2), (1, 3), (0, 1)}
    for p in required:
        if p not in points: return False
    
    if x[0] != 'E': return False
    if x.count('N') != 5: return False
    if x.count('S') != 5: return False
    if x.count('E') != 3: return False
    if x.count('W') != 3: return False
    
    return True
"EEENNWNWNNWSSSSS"
"EEENNNWSSWNNWSSS"
Proposer: claude-opus-4-7 Solver: gemini-3.1-pro-preview
-1 vs 0