Answers.Body: <p>Yes, at some ratio. But that ratio changes every day, in favor of the computer. Grandmasters are getting very slightly better over the years, while computers double in speed every few years. Maybe a GM could win with 100:1 time odds today, but they would need 1000:1 soon, and 10000:1 soon thereafter.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2014-03-04T20:21:02.790Z
Answers.LastActivityDate: 2014-03-04T20:21:02.790Z
Answers.UserDisplayName: Sparr
Answers.Body: <p>Your question is stated in such a way, that the answer <strong>Yes</strong> is almost certain. And I will explain why.</p>
  
  <p>First of all, from mathematical (game theory) point of view, chess is an <a href="http://en.wikipedia.org/wiki/Extensive-form_game" rel="nofollow">extensive-form</a> game, which means that it has a Nash equilibrium. Taken these hard words away, this means that from a <a href="http://en.wikipedia.org/wiki/Zermelo%27s_theorem_%28game_theory%29" rel="nofollow">theoretical point of view</a>, with a perfect game if a game is not a draw, than one of the players have a sure win (think about it as a forced sequence of X moves from starting position to win). So here is where certainty in my first sentence comes from. If computers will be all-powerful, no matter how small the gap will be, they will be able to draw the match (thus grandmasters would not be able to win with any gap).</p>
  
  <p>This was theoretical, but with a current situation, one can always find time-odds to be able to win. For example even I would be able to win the best machine with the following timing: me 240 minutes - machine 10 seconds (try it by yourself). Note, that Sparr correctly stated that ratio will be increased every day, till may it will come to my theoretical conclusion stated in paragraph 1.</p>
  
  <p>Note, that Rauans' answer does not take into account one important thing - computer is not sitting and doing nothing while you are thinking! The engine evaluates all possible positions during that time as well. So you can not really sit and wait for a lot of time, thinking that you will overwhelm the machine with your strange move.</p>
  
  <p>Another important addition is to see the progress of machines and the progress of humans. Take <a href="http://ratings.fide.com/id.phtml?event=1503014" rel="nofollow">Carlsen Magnus</a> (the strongest human) and check his progress: from Jan 2011 to Mar 2014 he reached from <strong>2814</strong> to <strong>2881</strong>. So <strong>67 points in more than 2 years</strong>.</p>
  
  <p>Take <a href="http://www.cruxis.com/chess/houdini.htm" rel="nofollow">Houdini</a> from its <a href="http://en.wikipedia.org/wiki/Houdini_%28chess%29" rel="nofollow">1.5a</a> release in Jan 11 to current 4 release it gained from <a href="http://www.computerchess.org.uk/ccrl/4040/rating_list_all.html" rel="nofollow"><strong>3200</strong> to <strong>3313</strong></a> points. So during the same time <strong>113 points</strong> (and you know that the higher you stand, the harder to get additional points). Also it was not running on supercomputer (but rather on an average machine :  Athlon 64 X2 4600+ (2.4 GHz)). Also note that chess logic is easy to parallel and check current speed of some of the most powerful distributed hashing network running on specific dedicated hardware: <a href="https://blockchain.info/charts/hash-rate" rel="nofollow">30 Peta hashes per second</a> (30 million Gh/s)</p>
  
  <p>I also advice not to listen to Fischer's comments, because Elo define a probability of winning and based on the history, it shows pretty nicely who is stronger then who on a high level. So this is not really such a stupid number. </p>
  
  <p>Computers are better than us not only in middle game, they have all opening repertuar (some openings goes far than <a href="http://www.365chess.com/eco/C89_Ruy_Lopez_Marshall_main_line_Spassky_variation" rel="nofollow">17 moves in depths</a>) and can include also vast amount of precalculated theoretical novelties, which non of the humans can remember, also they have all <a href="http://en.wikipedia.org/wiki/Endgame_tablebase" rel="nofollow">up to 7 pieces endgames</a> (and even for a good GM it is not as easy to win queen+king vs rook+king.</p>
  
  <p>No computer can be better than capablanca|fisher|kasparov? A game in <a href="http://en.wikipedia.org/wiki/Deep_Blue_versus_Garry_Kasparov" rel="nofollow">1996 showed otherwise</a>, and this is ancient age in terms of computers (note that currently even PC on mobile phone <a href="http://en.wikipedia.org/wiki/Hiarcs" rel="nofollow">HTC in the example is better/on the same level as Carlsen</a>)</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2014-03-10T20:49:22.437Z
Answers.LastActivityDate: 2014-03-10T20:49:22.437Z
Answers.UserDisplayName: Salvador Dali
Answers.Body: <p>Absolutely not, a human has no chance whatsoever to win against supercomputers these days, even at 10 to 1 ratio on time. Chess engines on supercomputers are so sophisticated these days that they can calculate up to 200 million moves per second, versus a human's ability to calculate 2 moves per second at most. Besides, the computer -- just like a human -- doesn’t wait for the opponent to make his move to start thinking; it is constantly weighing all the options even before the opponent makes its move. So I think the time ratio is irrelevant in this case.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-04-10T08:54:20.343Z
Answers.Text: +1 for mentioning the fact that the computer also thinks on the human grandmaster's time.
Answers.UserDisplayName: Sir Cornflakes
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2014-09-28T12:53:57.873Z
Answers.LastActivityDate: 2014-09-28T13:21:38.957Z
Answers.LastEditDate: 2014-09-28T13:21:38.957Z
Answers.UserDisplayName: Satar
Answers.Body: <p><strong>Nope</strong></p>
  
  <p>Time odds are irrelevant on the computational side.  Computation of chess positions is easily parallelized, meaning additional computational resources can be brought to bear independently of time constraints.  The linear component of the processing will be trivially small compared to the time controls.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2014-06-14T20:33:30.450Z
Answers.LastActivityDate: 2014-06-14T20:33:30.450Z
Answers.UserDisplayName: Nate
Answers.Body: <p>I'd like to address a slightly different question: would a grandmaster be <strong><em>favored</em></strong> to win over a computer given time odds?  I say this because even a weak player has some statistically significant probability of beating a world champion eventually, even if it took the rest of time.  The answer to my modified question, I believe the <strong>answer is no</strong>.</p>
  
  <p>Programs and people evaluate their opponents moves in different fashion.  People can be surprised by their opponents moves, and need time to rethink the consequences.  However, a computer, if left to ponder a position during its opponent's move, has already considered all meaningful replies up to its search horizon.  In the limit, you essentially cut its ponder time in half, if it immediately makes its move, and only thinks on its opponents time.  Now the difference in time to calculate one ply (one half move) deeper means about a 40 fold increase in processing time (the search tree grows exponentially by the branching factor, which is ~40 new moves).  The additional lost time wouldn't even be able to search a single move deeper!  You essentially gain <strong>1 ply</strong> because the computer must search all your possible replies rather than the one you eventually make.</p>
  
  <p>So how much is that one ply of additional search worth to the computer?  In the 1980s, when search depth was small, experiments showed a program searching at a depth of 6 was 159 elo points better than one searching at a depth of 5.  <a href="http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TM-608.pdf" rel="nofollow">Later research in self play experiments</a> went on to show that as seach depth increased, there was a diminishing return in elo gain... a single ply increase from a depth of 11 to 12 resulted in an elo gain of 84 points.  Note this research is about 16 years old.  Note the ratings gap between <a href="http://www.computerchess.org.uk/ccrl/4040/" rel="nofollow">Stockfish</a> and <a href="http://www.2700chess.com/" rel="nofollow">Magnus Carlsen</a> is already around 450 points.  Almost counter intuitively, it would seem reducing the time control could give humans the best advantage (unfortunately, assuming a human's rating doesn't also drastically decrease with less time).</p>
  
  <p>I could see two possible factors that would make me change my mind.</p>
  
  <ol>
  <li>If diminishing returns were only a property of computers, and not humans (or the rate of change was significantly different).  Suppose you matched a computer against a postal player.  Perhaps the strategic decisions a human is capable, given enough time, outweigh the computer's tactical abilities.  Then, with enough time, a human could potentially be favored.</li>
  <li>If the time odds exponentially changed per move. Give the human 1 second on the first move, one minute on the next, one hour on the following... etc etc, we could effectively force a computer to be at a perpetually greater disadvantage than 50% time odds.  If the human capacity for discovering improvements truely could scale to those limits, then a computer would eventually be overwhelmed by the time advantage.</li>
  </ol>
  
  <p>However, my final analysis puts my two caviots as unlikely scenarios, and I believe that with any time odds, <strong>a computer would likely be the favorite</strong>.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-04-10T07:27:18.453Z
Answers.LastActivityDate: 2015-04-10T07:27:18.453Z
Answers.UserDisplayName: tbischel
Answers.Body: <p>With sufficient hardware and parallel processing, it would be possible to process the positions from all of the human's possible replies, in his time, then use the results immediately for his chosen move.  So through programming and hardware, it would be possible to overcome virtually any time odds.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-04-10T05:13:05.180Z
Answers.LastActivityDate: 2015-04-10T05:13:05.180Z
Answers.UserDisplayName: Andrew Deighton
Answers.Body: <p>Sorry to state the obvious but you do realise human engineers designed the computers and human programmers and chess experts wrote the programs.when a computer writes and designs a chess program that it cannot itself defeat then the machine awakes!</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-04-10T03:22:55.633Z
Answers.Text: This doesn't seem to be an answer to the original question. Is it meant as a response to one of the answers?
Answers.UserDisplayName: ETD
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-04-10T15:44:26.170Z
Answers.Text: This doesn't answer anything at all.
Answers.UserDisplayName: SmallChess
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-04-10T02:30:18.683Z
Answers.LastActivityDate: 2015-04-10T02:30:18.683Z
Answers.UserDisplayName: mark burley
Body: <p>For eg., if a grandmaster is given 10:1 time odds, will he be able to beat a computer? For eg, if the GM is given 120 minutes for the entire game and the computer is given 12 minutes? If not 10:1 times odds, then please mention what time odds would be required for a GM to beat a computer.</p>
  
Tags: <engines><grandmaster><human-versus-machine><handicapping><time-control>
Title: Can Grandmasters beat computers when given time-odds?
ThreadText: # Can Grandmasters beat computers when given time-odds?
  
  (Asked by: username_0 on 2014-03-04)
  
  For eg., if a grandmaster is given 10:1 time odds, will he be able to beat a computer? For eg, if the GM is given 120 minutes for the entire game and the computer is given 12 minutes? If not 10:1 times odds, then please mention what time odds would be required for a GM to beat a computer.
  
  **Tags:** engines, grandmaster, human-versus-machine, handicapping, time-control
  
  
  ---
  
  ## 7 answers
  
  ### Answer by username_1 on 2014-03-04. Score: 3
  
  Yes, at some ratio. But that ratio changes every day, in favor of the computer. Grandmasters are getting very slightly better over the years, while computers double in speed every few years. Maybe a GM could win with 100:1 time odds today, but they would need 1000:1 soon, and 10000:1 soon thereafter.
  
  
  ---
  
  ### Answer by username_2 on 2014-03-10. Score: 3
  
  Your question is stated in such a way, that the answer **Yes** is almost certain. And I will explain why.
  
  First of all, from mathematical (game theory) point of view, chess is an [extensive-form](http://en.wikipedia.org/wiki/Extensive-form_game) game, which means that it has a Nash equilibrium. Taken these hard words away, this means that from a [theoretical point of view](http://en.wikipedia.org/wiki/Zermelo%27s_theorem_%28game_theory%29), with a perfect game if a game is not a draw, than one of the players have a sure win (think about it as a forced sequence of X moves from starting position to win). So here is where certainty in my first sentence comes from. If computers will be all-powerful, no matter how small the gap will be, they will be able to draw the match (thus grandmasters would not be able to win with any gap).
  
  This was theoretical, but with a current situation, one can always find time-odds to be able to win. For example even I would be able to win the best machine with the following timing: me 240 minutes - machine 10 seconds (try it by yourself). Note, that username_1 correctly stated that ratio will be increased every day, till may it will come to my theoretical conclusion stated in paragraph 1.
  
  Note, that Rauans' answer does not take into account one important thing - computer is not sitting and doing nothing while you are thinking! The engine evaluates all possible positions during that time as well. So you can not really sit and wait for a lot of time, thinking that you will overwhelm the machine with your strange move.
  
  Another important addition is to see the progress of machines and the progress of humans. Take [Carlsen Magnus](http://ratings.fide.com/id.phtml?event=1503014) (the strongest human) and check his progress: from Jan 2011 to Mar 2014 he reached from **2814** to **2881**. So **67 points in more than 2 years**.
  
  Take [Houdini](http://www.cruxis.com/chess/houdini.htm) from its [1.5a](http://en.wikipedia.org/wiki/Houdini_%28chess%29) release in Jan 11 to current 4 release it gained from [**3200** to **3313**](http://www.computerchess.org.uk/ccrl/4040/rating_list_all.html) points. So during the same time **113 points** (and you know that the higher you stand, the harder to get additional points). Also it was not running on supercomputer (but rather on an average machine : Athlon 64 X2 4600+ (2.4 GHz)). Also note that chess logic is easy to parallel and check current speed of some of the most powerful distributed hashing network running on specific dedicated hardware: [30 Peta hashes per second](https://blockchain.info/charts/hash-rate) (30 million Gh/s)
  
  I also advice not to listen to Fischer's comments, because Elo define a probability of winning and based on the history, it shows pretty nicely who is stronger then who on a high level. So this is not really such a stupid number.
  
  Computers are better than us not only in middle game, they have all opening repertuar (some openings goes far than [17 moves in depths](http://www.365chess.com/eco/C89_Ruy_Lopez_Marshall_main_line_Spassky_variation)) and can include also vast amount of precalculated theoretical novelties, which non of the humans can remember, also they have all [up to 7 pieces endgames](http://en.wikipedia.org/wiki/Endgame_tablebase) (and even for a good GM it is not as easy to win queen+king vs rook+king.
  
  No computer can be better than capablanca|fisher|kasparov? A game in [1996 showed otherwise](http://en.wikipedia.org/wiki/Deep_Blue_versus_Garry_Kasparov), and this is ancient age in terms of computers (note that currently even PC on mobile phone [HTC in the example is better/on the same level as Carlsen](http://en.wikipedia.org/wiki/Hiarcs))
  
  
  ---
  
  ### Answer by username_3 on 2014-09-28. Score: 2
  
  Absolutely not, a human has no chance whatsoever to win against supercomputers these days, even at 10 to 1 ratio on time. Chess engines on supercomputers are so sophisticated these days that they can calculate up to 200 million moves per second, versus a human's ability to calculate 2 moves per second at most. Besides, the computer -- just like a human -- doesn’t wait for the opponent to make his move to start thinking; it is constantly weighing all the options even before the opponent makes its move. So I think the time ratio is irrelevant in this case.
  
  > **Comments:**
  > **username_4**: +1 for mentioning the fact that the computer also thinks on the human grandmaster's time.  
  
  ---
  
  ### Answer by username_5 on 2014-06-14. Score: 2
  
  **Nope**
  
  Time odds are irrelevant on the computational side. Computation of chess positions is easily parallelized, meaning additional computational resources can be brought to bear independently of time constraints. The linear component of the processing will be trivially small compared to the time controls.
  
  
  ---
  
  ### Answer by username_6 on 2015-04-10. Score: 2
  
  I'd like to address a slightly different question: would a grandmaster be ***favored*** to win over a computer given time odds? I say this because even a weak player has some statistically significant probability of beating a world champion eventually, even if it took the rest of time. The answer to my modified question, I believe the **answer is no**.
  
  Programs and people evaluate their opponents moves in different fashion. People can be surprised by their opponents moves, and need time to rethink the consequences. However, a computer, if left to ponder a position during its opponent's move, has already considered all meaningful replies up to its search horizon. In the limit, you essentially cut its ponder time in half, if it immediately makes its move, and only thinks on its opponents time. Now the difference in time to calculate one ply (one half move) deeper means about a 40 fold increase in processing time (the search tree grows exponentially by the branching factor, which is ~40 new moves). The additional lost time wouldn't even be able to search a single move deeper! You essentially gain **1 ply** because the computer must search all your possible replies rather than the one you eventually make.
  
  So how much is that one ply of additional search worth to the computer? In the 1980s, when search depth was small, experiments showed a program searching at a depth of 6 was 159 elo points better than one searching at a depth of 5. [Later research in self play experiments](http://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TM-608.pdf) went on to show that as seach depth increased, there was a diminishing return in elo gain... a single ply increase from a depth of 11 to 12 resulted in an elo gain of 84 points. Note this research is about 16 years old. Note the ratings gap between [Stockfish](http://www.computerchess.org.uk/ccrl/4040/) and [Magnus Carlsen](http://www.2700chess.com/) is already around 450 points. Almost counter intuitively, it would seem reducing the time control could give humans the best advantage (unfortunately, assuming a human's rating doesn't also drastically decrease with less time).
  
  I could see two possible factors that would make me change my mind.
  
  1. If diminishing returns were only a property of computers, and not humans (or the rate of change was significantly different). Suppose you matched a computer against a postal player. Perhaps the strategic decisions a human is capable, given enough time, outweigh the computer's tactical abilities. Then, with enough time, a human could potentially be favored.
  2. If the time odds exponentially changed per move. Give the human 1 second on the first move, one minute on the next, one hour on the following... etc etc, we could effectively force a computer to be at a perpetually greater disadvantage than 50% time odds. If the human capacity for discovering improvements truely could scale to those limits, then a computer would eventually be overwhelmed by the time advantage.
  
  However, my final analysis puts my two caviots as unlikely scenarios, and I believe that with any time odds, **a computer would likely be the favorite**.
  
  
  ---
  
  ### Answer by username_7 on 2015-04-10. Score: 0
  
  With sufficient hardware and parallel processing, it would be possible to process the positions from all of the human's possible replies, in his time, then use the results immediately for his chosen move. So through programming and hardware, it would be possible to overcome virtually any time odds.
  
  
  ---
  
  ### Answer by username_8 on 2015-04-10. Score: -3
  
  Sorry to state the obvious but you do realise human engineers designed the computers and human programmers and chess experts wrote the programs.when a computer writes and designs a chess program that it cannot itself defeat then the machine awakes!
  
  > **Comments:**
  > **username_9**: This doesn't seem to be an answer to the original question. Is it meant as a response to one of the answers?  
  > **username_10**: This doesn't answer anything at all.  
  
  ---
  
  