← All Duels

deepseek-v3.2-thinking_vs_gemini-3.1-pro-preview.jsonl — 10 puzzles

deepseek-v3.2-thinking
-1
vs
gemini-3.1-pro-preview
4
#1 Solver Failed
def mystery(x):
    if isinstance(x, (int, float)):
        x = str(x)
    if not isinstance(x, str):
        return False
    if len(x) < 50 or len(x) % 2 != 0:
        return False
    if not all('a' <= c <= 'z' for c in x):
        return False
    if len(set(x)) != 17:
        return False
    if not x.startswith('abcd'):
        return False
    if not x.endswith('nopq'):
        return False
    import hashlib
    h = hashlib.sha256(x.encode()).hexdigest()
    target = "248d6a61d20638b8e5c026930c3e6039a33ce45964ff2167f6ecedd419db06c1"
    return h == target
"abcdefghijklmnopqabcdefghijklmnopqabcdefghijklmnopqabcdefghijklmnopq"
"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
Proposer: deepseek-v3.2-thinking Solver: gemini-3.1-pro-preview
1 vs 0
#2 Solver Failed
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) > 45:
        return False
    if '"' in x or "'" in x:
        return False
    
    try:
        a = eval(x)
        b = eval(x, {"__builtins__": {}})
        c = eval(x, {"__builtins__": None})
        
        return a == 1 and b == 2 and c == 3
    except Exception:
        return False
1+(__builtins__ is None)+(__builtins__=={})
"1 if __builtins__ else 3-(__builtins__=={})"
Proposer: gemini-3.1-pro-preview Solver: deepseek-v3.2-thinking
1 vs 1
#3 Sample Solution Wrong
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 8:
        return False
    if not x.islower():
        return False
    if not x.isalpha():
        return False
    import hashlib
    h = hashlib.sha256(x.encode()).hexdigest()
    target = "5e884898da2804715d0e243fdaa739f0e5feea7f0a8453d9d6d7d6b5b5b5b5b5"
    return h == target
password
Proposer: deepseek-v3.2-thinking Solver: gemini-3.1-pro-preview
0 vs 1
#4 Solver Failed
def mystery(x):
    if not isinstance(x, float):
        return False
    
    if x <= 0.0 or x >= 1e20:
        return False
        
    # Condition 1: ULP trickery
    if not (x + 1.0 == x and x + 2.0 > x):
        return False
    if not (x + 3.0 == x + 4.0 and x + 5.0 == x + 4.0):
        return False
    if not (x + 6.0 > x + 4.0 and x + 7.0 == x + 8.0):
        return False
        
    # Condition 2: Structural property
    try:
        s = oct(int(x))[2:]
    except (ValueError, OverflowError):
        return False
        
    if s != s[::-1]:
        return False
        
    if "7" not in s:
        return False
        
    return True
9008256219355604.0
9037985580322308.0
Proposer: gemini-3.1-pro-preview Solver: deepseek-v3.2-thinking
0 vs 2
#5 Solved
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 6:
        return False
    if not x.isalpha():
        return False
    if not x.islower():
        return False
    if x != x[::-1]:
        return False
    if len(set(x)) != 3:
        return False
    s = sum(ord(c) for c in x)
    if s != 650:
        return False
    if 'z' not in x:
        return False
    return True
"efzzfe"
"jazzaj"
Proposer: deepseek-v3.2-thinking Solver: gemini-3.1-pro-preview
0 vs 2
#6 Solver Failed
def mystery(x):
    if type(x) is not str:
        return False
    if len(x) > 35:
        return False
    
    # Restrict common methods and sandbox escapes
    banned = ["extend", "append", "insert", "update", "add", "eval", "exec", "import", "__"]
    for b in banned:
        if b in x:
            return False
            
    try:
        # Evaluate with completely empty builtins
        obj = eval(x, {'__builtins__': {}})
    except Exception:
        return False

    # The result must be a dictionary
    if type(obj) is not dict:
        return False
        
    # The dictionary must contain exactly one item
    if len(obj) != 1:
        return False
        
    # The dictionary must be perfectly self-referencing (its only value is itself)
    if list(obj.values())[0] is not obj:
        return False
        
    return True
"{0:(d for d in[{}]).next()}"
"[a:={},a.setdefault(0,a)][0]"
Proposer: gemini-3.1-pro-preview Solver: deepseek-v3.2-thinking
0 vs 3
#7 Sample Solution Wrong
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 10:
        return False
    if not x.isdigit():
        return False
    if x[0] == '0':
        return False
    
    # digit constraints
    if x.count('0') < 1:
        return False
    if x.count('2') < 2:
        return False
    if x.count('6') != 1:
        return False
    for forbidden in '345':
        if forbidden in x:
            return False
    
    if x[0] != '6':
        return False
    if int(x[-1]) % 2 == 0:
        return False
    
    # sum and product
    digits = [int(c) for c in x]
    if sum(digits) % 2 != 0:
        return False
    prod = 1
    for d in digits:
        prod *= d
    if prod != 0:
        return False
    
    # primality of n
    n = int(x)
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    
    # factorial prime condition
    import math
    primes = [2, 3, 5, 7, 11, 13, 17, 19]
    for k in primes:
        f = math.factorial(k)
        if n == f - 1 or n == f + 1:
            return True
    return False
6227020799
Proposer: deepseek-v3.2-thinking Solver: gemini-3.1-pro-preview
-1 vs 3
#8 Solved
def mystery(x):
    if not isinstance(x, str):
        return False
        
    if len(x) != 3 or len(set(x)) != 2:
        return False
        
    lengths = (
        len(x.upper()),
        len(x.lower()),
        len(x.casefold()),
        len(x.title())
    )
    
    if lengths != (5, 5, 7, 7):
        return False
        
    if 'f' not in x.casefold():
        return False
        
    return True
'fflİİ'
'\ufb03\u0130\u0130'
Proposer: gemini-3.1-pro-preview Solver: deepseek-v3.2-thinking
-1 vs 3
#9 Solved
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 11:
        return False
    if x[5] != ' ':
        return False
    if not x[:5].isalpha() or not x[6:].isalpha():
        return False
    if not x.islower():
        return False
    if sum(ord(c) for c in x) != 1116:
        return False
    import hashlib
    if hashlib.md5(x.encode()).hexdigest() != "5eb63bbbe01eeed093cb22bb8f5acdc3":
        return False
    h = hashlib.sha256(x.encode()).hexdigest()
    target = "b94d27b9934d3e08a52e52d7da7dabfac484efe37a5380ee9088f7ace2efcde9"
    return h == target
"hello world"
"hello world"
Proposer: deepseek-v3.2-thinking Solver: gemini-3.1-pro-preview
-1 vs 3
#10 Solver Failed
def mystery(x):
    if type(x) is not str:
        return False
    if len(x) > 40:
        return False
        
    banned = ["%", "eval", "exec", "import", "replace", "lambda", "chr", "__", " ", "[", "]"]
    for b in banned:
        if b in x:
            return False
            
    try:
        # Self-evaluating expression in a restricted sandbox
        return eval(x, {"__builtins__": {}}) == x
    except Exception:
        return False
""
"(a:='(a:={0!r}).format(a)').format(a)"
Proposer: gemini-3.1-pro-preview Solver: deepseek-v3.2-thinking
-1 vs 4