Answers.Body: <p>There is a paper, which examines this relationship for Houdini 1.5.</p>
  <p><a href="http://web.ist.utl.pt/diogo.ferreira/papers/ferreira13impact.pdf" rel="nofollow noreferrer">http://web.ist.utl.pt/diogo.ferreira/papers/ferreira13impact.pdf</a></p>
  <p>On page 77 you get the relevant table:</p>
  <pre><code>depth (ply): elo:
  
  20    2894
  
  19    2828
  
  18    2761
  
  17    2695
  
  16    2629
  
  15    2563
  
  …
  
  8     2099
  
  7     2033
  
  6     1966
  </code></pre>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2015-03-30T13:24:08.370Z
Answers.LastActivityDate: 2022-12-03T01:02:33.323Z
Answers.LastEditDate: 2022-12-03T01:02:33.323Z
Answers.UserDisplayName: BlindKungFuMaster
Answers.Body: <p>This is an area that academic can write papers on it. The relationships is complicated and might not be quantified.</p>
  <p>Essentially, it's a non-linear relationship where the improvement is most obvious in shallow depth. The benefit diminishes as the engine go deeper and deeper in the search.</p>
  <p>Reference: <a href="https://www.chessprogramming.org/Depth" rel="nofollow noreferrer">https://www.chessprogramming.org/Depth</a></p>
  <p>Look for the &quot;Diminishing Returns&quot; section and you'll know more.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2014-10-10T14:26:22.200Z
Answers.Text: Thanks for that reference. It provides some useful relative advantages between a n-ply and an n+1-ply engine. I was looking for an absolute Elo but I accept now that that may not be possible.
Answers.UserDisplayName: Dom
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2014-10-10T14:52:57.510Z
Answers.Text: Absolute Elo is not possible because it varies from one engine to another. There is simply no formula.
Answers.UserDisplayName: SmallChess
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2014-10-10T11:20:33.620Z
Answers.LastActivityDate: 2022-11-30T08:47:44.077Z
Answers.LastEditDate: 2022-11-30T08:47:44.077Z
Answers.UserDisplayName: SmallChess
Body: <p>Has anyone calculated the average Elo rating of a chess computer as a function of the number of half moves or plys ahead it can look. I realise that the Elo is also a function of the choice of move then taken which may differ from engine to engine.</p>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2014-10-09T13:52:42.517Z
Comments.Text: This is likely (if not guaranteed) to be very different for each major chess engine.
Comments.UserDisplayName: Henry Keiter
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2014-10-09T15:36:25.740Z
Comments.Text: Yes I mention that in the question. I am really just looking for an average estimate.
Comments.UserDisplayName: Dom
Tags: <engines><rating><ply>
Title: What is the Elo rating of a chess computer that can only look 1, 2, 3, ... moves ahead
ThreadText: # What is the Elo rating of a chess computer that can only look 1, 2, 3, ... moves ahead
  
  (Asked by: username_0 on 2014-10-09)
  
  Has anyone calculated the average Elo rating of a chess computer as a function of the number of half moves or plys ahead it can look. I realise that the Elo is also a function of the choice of move then taken which may differ from engine to engine.
  
  **Tags:** engines, rating, ply
  
  > **Comments:**
  > **username_1**: This is likely (if not guaranteed) to be very different for each major chess engine.  
  > **username_0**: Yes I mention that in the question. I am really just looking for an average estimate.  
  
  ---
  
  ## 2 answers
  
  ### Answer by username_2 on 2015-03-30. Score: 13
  
  There is a paper, which examines this relationship for Houdini 1.5.
  http://web.ist.utl.pt/diogo.ferreira/papers/ferreira13impact.pdf
  On page 77 you get the relevant table:
  depth (ply): elo:
  
  20    2894
  
  19    2828
  
  18    2761
  
  17    2695
  
  16    2629
  
  15    2563
  
  …
  
  8     2099
  
  7     2033
  
  6     1966
  
  
  ---
  
  ### Answer by username_3 on 2014-10-10. Score: 4
  
  This is an area that academic can write papers on it. The relationships is complicated and might not be quantified.
  
  Essentially, it's a non-linear relationship where the improvement is most obvious in shallow depth. The benefit diminishes as the engine go deeper and deeper in the search.
  
  Reference: <https://www.chessprogramming.org/Depth>
  
  Look for the "Diminishing Returns" section and you'll know more.
  
  > **Comments:**
  > **username_0**: Thanks for that reference. It provides some useful relative advantages between a n-ply and an n+1-ply engine. I was looking for an absolute Elo but I accept now that that may not be possible.  
  > **username_3**: Absolute Elo is not possible because it varies from one engine to another. There is simply no formula.  
  
  ---
  
  