#299
"The prospect of solving chess in a brute force manner hinges on a breakthrough in scalability in quantum computing."
++ A quantum computer is the only way for strongly solving chess i.e. a 32-men table base.
Weakly solving chess takes 5 years on present cloud engines. Sveshnikov 'practically exhausted' B33 in 1988 on his own, without engines, without table bases. So to do 499 times more with cloud engines, table bases and grandmaster assistants is plausible.
"This is an area where the physics itself isn't yet fully understood."
++ The physics is understood. Quantum computers are even commercially available for rental.
https://www.dwavesys.com/solutions-and-products/cloud-platform/
"consider Fermat's Last Theorem"
++ Also the Four Color Theorem etc. Provability is a higher degree of truth. Also the Riemann Hypothesis and the Goldbach Conjecture are believed to be true though not yet proven.
"The way to know with absolute certainty is brute force solving, so your argument is circular...you cannot ever establish that a "chess AI" is 100% perfect until you solve the game. This whole thread was done better the first time around...this is just redundant rehashing.">>>
Of course it is but it's what they enjoy. Getting stuck in blind alleys and continually bouncing off the wall at the end only seems like progress to some.
However, a brute force full solution to chess is, at the moment, inconceivable. No way to track it, store it or evaluate it so it would have to be done via successive approximations. That's a necessary but clumsy method, since a lot of room has to be left to accomodate suprising lines.
My son works in AI. He's a physicist but his masters degree was in maths. He reckons that depicting chess mathematically is impossible. By that, he means "for a number of generations".