Chess- Has any of the endgame lines been solved?

[JEDI]

so checkers has been solved. a computer CANNOT lose in checkers. at worse, it will be a draw.

chess is much more complicated than checkers. but the endgame is somewhat like checkers in that there is a limited number of pieces, and only X number of moves b4 a mate/draw.

So has any of the endgame lines been solved?

 

[SKORPI0]

Not so sure in our lifetime, but here's some Endgames

Shannon number

Shannon also estimated the number of possible positions, "of the general order of 64! / 32!(8!)2(2!)6, or roughly 1043". This includes some illegal positions (e.g., pawns on the first rank, both kings in check) and excludes legal positions following captures and promotions. Taking these into account, Victor Allis calculated an upper bound of 5×1052 for the number of positions, and estimated the true number to be about 1050.[3]

Allis also estimated the game-tree complexity to be at least 10123, "based on an average branching factor of 35 and an average game length of 80". As a comparison, the number of atoms in the Universe, to which it is often compared, is estimated to be between 4x1079 and 1081

<a target=_blank class=ftalternatingbarlinklarge href="http://www.chessbase.com/newsdetail.asp?newsid=3997">500 billion billion moves later, computers solve checkers
</a>

 

[Crono]

"So, what does all this mean for chess? Can we extrapolate these results from one checkers playing programs to chess playing programs? Certainly, Chinook and Fritz use similar search algorithms. They each have a positional evaluation function. They each take advantage of table bases for evaluating endgames. The big difference is the number of positions possible in each game: 1020 for checkers and 1040 for chess. To get some idea of this, if a computer could solve checkers completely in one nanosecond (a single cycle of a 1 GHz computer), it would take this computer 3000 years to solve chess."

Looks like the difference between checkers and chess is mathematically huge. It would probably take an enormous leap in computing power (quantum?) to achieve the same feat for chess in the same span of 13 years or less.