@5494
"That is why the solution of checkers took years of computing."
++ No. Schaeffer spent most of the 19 years to write his own checkers-playing program Chinook and construct his own 10-men endgame tablebase. The real solving was from 2001 to 2007.
Schaeffer used less powerful computers than are available now.
Schaeffer only analysed 19 of the 300 tournament openings, needed to prove Checkers a draw.
Checkers is a smaller game than Chess or Losing Chess.
Checkers and Losing Chess have more irreversible moves than Chess.
Corrollary: Chess has more stupid moves.
In Chess you can hop around aimlessly, not so in Checkers or Losing Chess.
Corrollary: To solve Chess it is necessary to eliminate the stupid moves.
The good assistants are indispensable. That is why GM Sveshnikov named them first:
'Give me five years, good assistants and the latest computers
- I will bring all openings to technical endgames and "close" chess.'
@5519
"a solution awaits the development of much better engines or a breakthrough in methodology"
++ We already have engines that calculate a billion positions per second.
We already have a methodology.
Start from ICCF drawn games, explore 3 alternative lines at each white move.
Stop calculations when the good assistants determine an obvious draw or loss.
The 10^17 relevant positions can be done in 5 years.
If you deny the good assistants,
then it may well become 5 million years of irrelevant calculations.