Unverified95% confidenceFactExact time

推箱子（Sokoban）在计算复杂性理论中被证明是PSPACE完全问题

1

Sources

95%

Confidence

Long-term

Relevance

6/23/2025

First Seen

Sources

AI玩游戏实力大比拼：O3 Pro展现惊人规划能力

bilibili认真的笨笨6/23/2025

Related Entities

推箱子product PSPACE完全concept

Related Claims

Unverified精确求解POMDP在计算上是PSPACE难问题74% similar UnverifiedPOMDP的精确求解是PSPACE-complete问题，计算复杂度随状态空间指数增长72% similar Unverified内点法在理论上具有多项式时间复杂度保证，而单纯形法最坏情况下呈指数级复杂度64% similar UnverifiedPOMDP由Astrom于1965年首次形式化描述，精确求解POMDP在计算上是PSPACE难问题61% similar Unverified边缘节点的硬件异构性使得统一的推理性能保证极为困难61% similar

Cite This Claim

Stable URI

https://kongchang.com/claim/1224

API

curl https://kongchang.com/api/v1/knowledge/claims/1224

MCP

get_claim(id=1224)