Would an AI be capable of constructing a non-brute, ultraweak proof of chess for this board state by 2030?
Premium
7
Ṁ4842031
50%
chance
1D
1W
1M
ALL
Would an AI be able to construct an ultra-weak proof for the given chess board state, that does not rely on brute-force analysis by 2030. The proof can contain multiple conditions but should not outline every move to conclude the solution.
Since the line for how many conditions is too much is subjective, I'll say that I'd be satisfied if the compressed size of the proof is < 7kb (excluding definitions+axioms)
https://en.wikipedia.org/wiki/Solved_game
https://en.wikipedia.org/wiki/Solving_chess
Bonus: 50k bounty to anyone who can manually construct a proof, its still unclear to me what would be a reasonable size for such a problem.
This question is managed and resolved by Manifold.
Get
1,000and
3.00
1,0003.00Related questions
Related questions
Will chess be solved by 2040?
21% chance
Will AI be able to generate correct images of a chess game in 2024?
25% chance
Will chess be solved by 2100?
28% chance
Will any AI be able to explain formal language proofs to >=50% of IMO problems by the start of 2025?
48% chance
Will an AI by OpenAI beat a super grandmaster playing chess by 2028?
60% chance
Will an LLM (a GPT-like text AI) defeat the World Champion at Chess before 2035?
51% chance
Will a blank-slate AI prove the infinitude of primes by 2025-11-03?
33% chance
Will an AI solve any important mathematical conjecture before January 1st, 2030?
76% chance
In 2029, will any AI be able to take an arbitrary proof in the mathematical literature and translate it into a form suitable for symbolic verification? (Gary Marcus benchmark #5)
71% chance
Will AI resolve P vs NP by 2050?
27% chance