← All Duels

grok-4_vs_deepseek-reasoner_20260124_024732.jsonl — 10 puzzles

grok-4
0
vs
deepseek-reasoner
-1
#1 Solved
Puzzle Code
import math

def mystery(x):
    try:
        s = str(x)
    except:
        return False
    expected = [
        int(math.sqrt(12544)),
        math.factorial(4) * 5 - 3,
        math.factorial(5) + 2,
        int(math.sqrt(14884)),
        3 * math.factorial(5) // 3 - 12,
        int(math.sqrt(10201))
    ]
    if len(s) != len(expected):
        return False
    return all(ord(c) == e for c, e in zip(s, expected))
Solver Attempt
"puzzle"
Sample Solution
"puzzle"
Proposer: grok-4 Solver: deepseek-reasoner
0 vs 0
#2 Sample Solution Wrong
Puzzle Code
def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 0 or x >= 2**32:
        return False
    y = x
    y = y ^ (y >> 11)
    y = y ^ ((y << 7) & 0x9D2C5680)
    y = y ^ ((y << 15) & 0xEFC60000)
    y = y ^ (y >> 18)
    return y == 0x12345678
Sample Solution
307232500
Proposer: deepseek-reasoner Solver: grok-4
0 vs -1
#3 Solved
Puzzle Code
import math

def mystery(x):
    try:
        s = str(x)
    except:
        return False
    expected = [
        int(math.sqrt(int('2E69', 16))),
        int(math.sqrt(int('3931', 16))),
        int(math.sqrt(int('33A9', 16))),
        int(math.sqrt(int('3490', 16))),
        int(math.sqrt(int('27D9', 16))),
        int(math.sqrt(int('32C4', 16))),
        int(math.sqrt(int('3931', 16)))
    ]
    if len(s) != len(expected):
        return False
    return all(ord(c) == e for c, e in zip(s, expected))
Solver Attempt
"mystery"
Sample Solution
"mystery"
Proposer: grok-4 Solver: deepseek-reasoner
0 vs -1
#4 Solved
Puzzle Code
import math

def mystery(x):
    try:
        s = str(x)
    except:
        return False
    primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71]
    expected = [int(math.sqrt(p)) + 65 for p in primes]
    if len(s) != len(expected):
        return False
    return all(ord(c) == e for c, e in zip(s, expected))
Solver Attempt
"BBCCDDEEEFFGGGGHHHII"
Sample Solution
"BBCCDDEEEFFGGGGHHHII"
Proposer: deepseek-reasoner Solver: grok-4
0 vs -1
#5 Solved
Puzzle Code
import math

def mystery(x):
    try:
        s = str(x)
    except:
        return False
    expected = [
        math.factorial(5) - math.factorial(3),
        math.factorial(5) - int(math.sqrt(int('E1', 16))),
        math.factorial(5) - int(math.sqrt(int('190', 16))),
        math.factorial(5) - int(math.sqrt(int('190', 16))),
        math.factorial(5) - int(math.sqrt(int('90', 16))),
        math.factorial(5) - int(math.sqrt(int('169', 16)))
    ]
    if len(s) != len(expected):
        return False
    return all(ord(c) == e for c, e in zip(s, expected))
Solver Attempt
"riddle"
Sample Solution
"riddle"
Proposer: grok-4 Solver: deepseek-reasoner
0 vs -1
#6 Solved
Puzzle Code
def mystery(x):
    if not isinstance(x, int):
        return False
    if x < 0 or x >= 2**32:
        return False
    y = x
    y = (y ^ (y >> 1)) & 0xFFFFFFFF
    y = (y ^ (y << 2)) & 0xFFFFFFFF
    y = (y ^ (y >> 3)) & 0xFFFFFFFF
    y = (y ^ (y << 4)) & 0xFFFFFFFF
    return y == 0xF5978B77
Solver Attempt
3735928559
Sample Solution
0xDEADBEEF
Proposer: deepseek-reasoner Solver: grok-4
0 vs -1
#7 Solved
Puzzle Code
import math

def mystery(x):
    try:
        s = str(x)
    except:
        return False
    expected = [
        int(math.sqrt(int('2649',16))),
        int(math.sqrt(math.factorial(6) * 17 + 3**4)),
        int(math.sqrt(int('2F44',16))),
        math.factorial(5) - 3,
        int(math.sqrt(int('2F44',16))),
        math.factorial(5) - 20,
        int(math.sqrt(int('32C4',16))),
        math.factorial(5) - 3,
        int(math.sqrt(int('2E69',16)))
    ]
    if len(s) != len(expected):
        return False
    return all(ord(c) == e for c, e in zip(s, expected))
Solver Attempt
"conundrum"
Sample Solution
"conundrum"
Proposer: grok-4 Solver: deepseek-reasoner
0 vs -1
#8 Solved
Puzzle Code
def mystery(x):
    if not isinstance(x, str) or len(x) != 6:
        return False
    v = [ord(c) for c in x]
    # rotate left 3 bits
    pv = [ ((c << 3) & 0xff) | (c >> 5) for c in v ]
    # affine transformation
    w0 = (3*pv[0] + pv[1] + 11) % 256
    w1 = (pv[0] + 3*pv[1] + pv[2] + 13) % 256
    w2 = (pv[1] + 3*pv[2] + pv[3] + 17) % 256
    w3 = (pv[2] + 3*pv[3] + pv[4] + 19) % 256
    w4 = (pv[3] + 3*pv[4] + pv[5] + 23) % 256
    w5 = (pv[4] + 3*pv[5] + 29) % 256
    return w0 == 92 and w1 == 147 and w2 == 8 and w3 == 250 and w4 == 62 and w5 == 241
Solver Attempt
"Python"
Sample Solution
"Python"
Proposer: deepseek-reasoner Solver: grok-4
0 vs -1
#9 Solved
Puzzle Code
import math

def mystery(x):
    try:
        s = str(x)
    except:
        return False
    expected = [
        int(math.sqrt(11664)),
        math.factorial(5) - 23,
        int(math.sqrt(int('2584', 16))),
        math.factorial(4) * 5 + 1,
        math.factorial(4) * 4 + 18,
        int(math.sqrt(int('2B11', 16))),
        math.factorial(5) - 10,
        int(math.sqrt(int('3490', 16))),
        math.factorial(5) - 16
    ]
    if len(s) != len(expected):
        return False
    return all(ord(c) == e for c, e in zip(s, expected))
Solver Attempt
"labyrinth"
Sample Solution
"labyrinth"
Proposer: grok-4 Solver: deepseek-reasoner
0 vs -1
#10 Solved
Puzzle Code
def mystery(x):
    if not isinstance(x, str):
        return False
    if len(x) != 8:
        return False
    try:
        n = int(x, 16)
    except:
        return False
    if n >= 2**32:
        return False
    k1 = 0xDEAD
    k2 = 0xBEEF
    def F(r, k):
        return ((r ^ k) * 0x9E37) & 0xFFFF
    L = (n >> 16) & 0xFFFF
    R = n & 0xFFFF
    # round 1
    L1 = R
    R1 = L ^ F(R, k1)
    # round 2
    L2 = R1
    R2 = L1 ^ F(R1, k2)
    cipher = (L2 << 16) | R2
    return cipher == 0xCAFEBABE
Solver Attempt
"E752D719"
Sample Solution
"e752d719"
Proposer: deepseek-reasoner Solver: grok-4
0 vs -1