← All Duels

grok-4.20-0309-reasoning_vs_deepseek-v3.2-thinking.jsonl — 10 puzzles

grok-4.20-0309-reasoning
0
vs
deepseek-v3.2-thinking
0
#1 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 6:
        return False
    t = [3**5 - 2**7 + (4**0 - 1), 2**7 - 27 + 0 * 13, 11**2 - 22 * 1, 5**3 - 11 - (2**0 - 1), 2**7 - 27, 11**2 - 5 + (1 - 1)]
    for i in range(len(t)):
        if ord(x[i]) != t[i]:
            return False
    return True
"secret"
"secret"
Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking
0 vs 0
#2 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 8:
        return False
    y = x[::-1]
    t = [229, 239, 244, 230, 209, 196, 206, 223]
    for i in range(8):
        if (ord(y[i]) + ord(y[(i + 1) % 8])) % 256 != t[i]:
            return False
    return True
"s[ih~vyl"
"o_elzzup"
Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning
0 vs 0
#3 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 9:
        return False
    t = [(2**7 - 27 + (4**0 - 1)) * (13**0) + 0 * (11**2), (11**2 - 11 + 0 * (5**3 - 4**5)) // (2**0), 5**3 - 20 + (7**2 - 49) * 2**10, (10**2 + 3 ) * (5**0) + (1 - 1**5)*100, (11**2 - 12) + (13 -13)* (2**8), 10**2 - 3 + 0 * (3**6 // 9 - 100), 5**3 - 9 + (4**3 - 64), (7**3 - 238) * 1** (4**2) - 0, (10**2 - 1) + (2**1 - 2)* (5**4)]
    for i in range(len(t)):
        if ord(x[i]) != t[i]:
            return False
    return True
"enigmatic"
"enigmatic"
Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking
0 vs 0
#4 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 5:
        return False
    t = [
        (3**2 - 1) * (2**0) + (1 - 1**5) * 100,
        (2**8) - (10**2) + (0 * (3**6)),
        ((5+7) ** (3-1)) * (1**9) + 0,
        (1<<8) - (4*11) * (1**0),
        ((5-1)*(8-2)) * (2**0)
    ]
    s = (2**9) + (2**2)*5
    for i in range(5):
        if (ord(x[i]) * ord(x[(i+1) % 5])) % 256 != t[i]:
            return False
    if sum(ord(c) for c in x) != s:
        return False
    return True
"hello"
"hello"
Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning
0 vs 0
#5 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 9:
        return False
    t = [
        (2**8 - (5**2 - 6)) + (11**2 - 121) * (2**10),
        (5**3 + (7**2 + 4)) + (2**1 - 2) * (5**4),
        (2**6 + (3**2 - 3)) * (11**0) + 0 * (13**2),
        (5**3 - 55) + (1**(10**2) - 1) * 100,
        (2**8 - (2**3)) + (13**2 - 169) * (5**0),
        (11**2 + (5**2 - 10)) * (2**0) + (7**2 - 49) * (3**5),
        (5**2 + 1) + (4**0 - 1) * (2**7),
        (13**2 + (5**3 - 85)) * (1**5) + 0 * (11**2),
        (7**2 - (5**2 - (4**2 - 1))) * (13**0) + (2**0 - 1) * 39
    ]
    s = (10**3 - 13) + (2**7 - 128) * (11**2 // 11**2)
    for i in range(9):
        if (ord(x[i]) * ord(x[(i + 1) % 9])) % 256 != t[i]:
            return False
    if sum(ord(c) for c in x) != s:
        return False
    return True
"conundrum"
"conundrum"
Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking
0 vs 0
#6 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 10:
        return False
    t = [
        (1<<8) - (1<<5) + (4**0),
        (2**8) - (2**5) - (2**1),
        (1<<8) - (3**3),
        (1<<8) - (1<<4) - ((1<<2) - 1),
        (1<<1) * ((1<<2) - 1) * (5**2),
        (2**7) + (2**2)*(3**2),
        (1<<7) + (1<<2)*11,
        (2**7) + 5 * (2**1) * 3,
        (3**2) * ( (1<<4) + 3 ),
        (1<<7) + (1<<5) + (2**1)*3
    ]
    for i in range(10):
        if (ord(x[i]) + ord(x[(i+3)%10])) % 256 != t[i]:
            return False
    s = 10**3 - 5*10 - 3
    if sum(ord(c) for c in x) != s:
        return False
    return True
"mystery123"
"mystery123"
Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning
0 vs 0
#7 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 7:
        return False
    t = [
        (3**5 - (4**2 + 4**1)) + (11**2 - 121) * (2**10),
        (3**5 - (11**1 - 1**0)) + (13**2 - 169) * (5**2),
        (2**8) - (7**2 - 7**1) + (4**0 - 1) * (3**5),
        (3**5 - (5**2 - 1**(2**0))) * (13**0) + 0 * (10**2),
        (2**8 - 3**3) + (7**2 - 49) * (11**2),
        (3**5 - 3**2) + (2**1 - 2**0 - 1) * (2**7),
        (5**3 + 3**4) + (2**0 - 1) * (13**2)
    ]
    for i in range(7):
        if (ord(x[i]) + ord(x[(i + 3) % 7])) % 256 != t[i]:
            return False
    s = (2**9) + (2**8) + (2**4) - (5**1) + (11**2 - 121) * (13**2 - 169)
    if sum(ord(c) for c in x) != s:
        return False
    return True
"quantum"
"quantum"
Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking
0 vs 0
#8 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 8:
        return False
    t1 = [
        (1<<8) - 7*11,
        3**5 - (1<<5) - 4*13,
        (1<<8) - 8*13,
        (1<<8) - 4*11,
        11*(1<<4) - 3,
        (1<<7) - 3**2,
        11*(1<<3),
        (1<<7) - 13*2
    ]
    t2 = [
        7**2 + 2**2,
        (1<<6) + 2,
        (1<<8) - 5*7,
        3*(1<<6),
        (1<<7) - 3*7,
        1<<6,
        (1<<8) - 5*9,
        5*9+1
    ]
    for i in range(8):
        if (ord(x[i]) + ord(x[(i+1)%8])) % 256 != t1[i]:
            return False
        if (ord(x[i]) * ord(x[(i+2)%8])) % 256 != t2[i]:
            return False
    if sum(ord(c) for c in x) != (10**2)*6 - 8:
        return False
    return True
"En1gm@7!"
"En1gm@7!"
Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning
0 vs 0
#9 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 8:
        return False
    t1 = [
        (1<<8) - (11**2 - (4**2 - 4)) + (2**0 - 1)*(5**3),
        (2**7 + (5**2 - 2)) + (4**0 - 1)*(11**2),
        (2**7 + (2**4)) + (4**0 - 1)*(3**5),
        (1<<7) + (5**2 - 5) + (11**2 - 121)*(2**10),
        (5**3 + (4**2 + 1)) + (4**0 - 1)*(3**5),
        (5**3 - (2**3)) + (7**2 - 49)*(11**2),
        (10**2 + (2**1)) + (13**2 - 169)*(2**8),
        (5**3 - (4**1 + 2)) + (11**2 - 121)*(13**2)
    ]
    t2 = [
        (7**2 - (2**4)) + (2**1) + (11**2 - 121)*(5**3),
        (5**3 - (2**3 - 1)) + (4**0 - 1)*(13**2),
        (11**2 + (2**4)) + (7**2 - 49)*(13**0),
        (5**3 - (4**2 + 1)) + (11**2 - 121)*(2**7),
        (2**3 + (2**1)) + (11**2 - 121)*(2**0),
        (5**3 + (2**3)) + (4**0 - 1)*(11**2),
        (2**8 - (7**2 - (3**2))) + (5**0 - 1)*(13**2),
        (1<<6) + (2**1) + (13**2 - 169)*(5**2)
    ]
    for i in range(8):
        if (ord(x[i]) + ord(x[(i + 1) % 8])) % 256 != t1[i]:
            return False
        if (ord(x[i]) * ord(x[(i + 3) % 8])) % 256 != t2[i]:
            return False
    s = (2**9 + (5**2 - 2)) + (11**2 - 121)*(13**2)
    if sum(ord(c) for c in x) != s:
        return False
    return True
"ENIGMA42"
"ENIGMA42"
Proposer: grok-4.20-0309-reasoning Solver: deepseek-v3.2-thinking
0 vs 0
#10 Solved
def mystery(x):
    if not isinstance(x, str) or len(x) != 11:
        return False
    t1 = [
        (1<<7) + (1<<5) + (1<<4) + (1<<2) + (1<<0) + (13**2 - 169)*(2**10),
        (1<<8) - 3*7 + (11**2 - 121)*(5**0),
        (2**8) - (2**4 + (2**3 - 1)) + (7**2 - 49)*(11**0),
        (1<<8) - 4*7 + (5**3 - 125)*(13**0),
        (1<<7) + (1<<5) + (1<<2) + (1<<0) + (3**5 - 243)*(2**0),
        (1<<8) - (3**3 * 4) + (10**2 - 100)*(7**0),
        (1<<7) + (1<<5) + (1<<4) + (1<<1) + (1<<0) + (13**2 - 169)*(1**5),
        (1<<8) - (7*(2**3) + 3) + (11**2 - 121)*(2**0),
        (1<<8) - (2**4 + 1) + (5**3 - 125)*(3**0),
        (1<<8) - 3*4 + (7**2 - 49)*(11**0),
        (1<<7) + (1<<5) + (1<<4) + (1<<3) + (1<<2) + (1<<0) + (10**2 - 100)*(13**0)
    ]
    t2 = [
        (1<<7) + (1<<5) + (1<<3) + (1<<1) + (1<<0) + (3**5 - 243)*(2**10),
        (1<<8) - (1<<5) + (11**2 - 121)*(5**0),
        (1<<8) - 4*11 + (7**2 - 49)*(13**0),
        (1<<7) - (1<<4) + (5**3 - 125)*(11**0),
        (1<<8) - (6**2) + (13**2 - 169)*(2**0),
        (1<<6) + (1<<4) + (10**2 - 100)*(7**0),
        (1<<6) - 1 + (11**2 - 121)*(3**0),
        (1<<5) + (5**3 - 125)*(1**9),
        (1<<8) - ((1<<6) - 2) + (7**2 - 49)*(11**0),
        (1<<8) - 2*(3**2) + (13**2 - 169)*(5**0),
        (1<<6) + (1<<4) + (1<<2) + (10**2 - 100)*(7**0)
    ]
    s = (10**3) + 7*((1<<4) + 1) + (11**2 - 121)*(2**8)
    for i in range(11):
        if (ord(x[i]) + ord(x[(i+1)%11])) % 256 != t1[i]:
            return False
        if (ord(x[i]) * ord(x[(i+2)%11])) % 256 != t2[i]:
            return False
    if sum(ord(c) for c in x) != s:
        return False
    return True
"Crypt1cPuzz"
"Crypt1cPuzz"
Proposer: deepseek-v3.2-thinking Solver: grok-4.20-0309-reasoning
0 vs 0