Timeline for How do grandmasters prepare against computer endgames?
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://chess.stackexchange.com/ with https://chess.stackexchange.com/
|
|
Mar 29, 2013 at 17:53 | answer | added | Edward Goodson | timeline score: 2 | |
Mar 28, 2013 at 18:48 | comment | added | dfan | Note that while computers play perfectly when they are able to use tablebases (which enable perfect play when the total number of pieces and pawns on the board, including kings, is six or fewer), they are actually relatively weak (compared to other phases of the game) in the earlier endgame. It is not at all unusual for a GM to be presented with a computer evaluation of some endgame position and say in response, "the computer doesn't understand this position at all." I doubt that a GM would try to avoid an endgame against a computer. | |
Dec 25, 2012 at 14:19 | comment | added | Randy Minder | Grandmasters don't play computers anymore. The top rated grandmaster is roughly 2850. The top rated computer (Houdini) is rated at roughly 3200. The best a grandmaster can do against a computer is a draw. | |
Dec 25, 2012 at 3:19 | comment | added | dogs10099 | Computers dont play in important tournaments, so GM don't play them often. However when they do play them GMS usually lose | |
Aug 12, 2012 at 17:54 | history | tweeted | twitter.com/#!/StackChess/status/234709395882262529 | ||
Jul 30, 2012 at 22:02 | comment | added | Landei | They need a clear advantage in the middle-game. If they don't have this advantage, they try to avoid the end-game like hell as long as they feel that they can still win. | |
Jul 29, 2012 at 13:01 | comment | added | Tony Ennis | I'm unaware of computers playing with GMs in serious play so I'm not sure how often this really happens. I believe the only way to prepare is to avoid the situation. | |
Jul 29, 2012 at 2:04 | history | asked | PKG | CC BY-SA 3.0 |