Chess has simple transitions, math doesn't: why CoT beats AlphaProof-style search
akbirthko · x · 2026-10-16
Comparing search regimes, akbirthko notes chess has a simple transition function where you can run alpha-beta pruning. Math is the opposite: highly semantic transitions in a far larger, more complex state space — which is why CoT does better than AlphaProof-style search, and these systems are now solving grand conjectures.
Related event: 200 Chess Games Test Suggests In-Context Learning Falls Short(2 posts)→
More from Research
- SERO augments long-horizon agentic RL with executable oracle continuations — Shanghai-AI-Laboratory · 2026-10-16
- Tsinghua and Amap propose OmniVerifier-C1, a graded verifier beating binary judges — Bowei Liu · 2026-10-16
- Alibaba open-sources MAI-Gym, an all-in-one GUI agent eval and RL training platform — Tongyi-MAI · 2026-10-16
- Peking University's SimForcing distills simulation motion priors into robot world models — PekingUniversity · 2026-10-16
- CoWorld Reasoner uses an evolving video world model as a visual reasoning engine — ModalityDance · 2026-10-16
- Sparse rank-1 maps are often interpretable: a finding said to jump your neural net understanding 5 years ahead — gleech · 2026-10-16