题解 | 24点游戏算法

import sys

nums = list(map(int, input().split()))
def dfs(arr):
    if len(arr) == 1:
        return abs(arr[0] - 24) < 1e-6
    for i in range(len(arr)):
        for j in range(i+1, len(arr)):
            tmp = arr[:i]+arr[i+1:j]+arr[j+1:]
            a, b = arr[i], arr[j]
            if dfs(tmp+[a+b]) or dfs(tmp+[a-b]) or dfs(tmp+[b-a]) or dfs(tmp+[a*b]) or (b and dfs(tmp+[a/b])) or (a and dfs(tmp+[b/a])):
                return True
    return False

if dfs(nums):
    print("true")
else:
    print("false")