Answers.Body: <p>No.</p>
  
  <ul>
  <li>What do you mean by "perfect" chess moves after 10 moves? We don't know they are perfect until the game ends in checkmate! You'll need go mucher deeper than 10 moves. You can't even solve King's Gambit in just 10 moves.</li>
  <li>The Stockfish algorithm <strong>heavily</strong> skips stupid moves off the search tree. It will <strong>not search</strong> everything no matter what CPU power you give it. You're actually talking about a brute-force engine (search all the possible moves). No, Stockfish is much <strong>smarter</strong> than that.</li>
  <li>Nothing really happen. You could publish a new paper, but your results would not change the world. We don't need to know what happens after 10 moves, we want to know what happens after 100 moves.</li>
  </ul>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2017-03-19T16:38:50.690Z
Answers.Text: I meant after the first 10 moves, would it be able to analyze the entire outcome(s) of the game and thus make it impossible to win against it?
Answers.UserDisplayName: Habbo
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2017-03-19T20:28:42.917Z
Answers.Text: @Habbo: It is completely unclear to me what the role of  the "10 moves" is in your question. Also, as mentioned stockfish does not analayze all possible lines, but only those it considers interesting/good. The current computer power is very far from solving chess. Currently the best that is known is perfect play for endgames with at most 7 pieces (black and white pieces combined including kings). Doing the same for 8 pieces is significantly harder as storage requirements increase exponentially with every piece.
Answers.UserDisplayName: user1583209
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2017-03-19T13:15:30.740Z
Answers.LastActivityDate: 2017-03-19T13:20:42.570Z
Answers.LastEditDate: 2017-03-19T13:20:42.570Z
Answers.UserDisplayName: SmallChess
Body: <p>If Stockfish had infinite computing power, or perhaps connected to all Google servers, etc. would it be able to solve the perfect chess moves after 10 moves? Or be able to create the perfect game directly? What would happen?</p>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2017-03-19T12:38:33.513Z
Comments.Text: This sort of counterfactual is a call for speculation rather than a question which has a right or wrong answer.
Comments.UserDisplayName: Brian Towers
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2017-03-19T13:00:20.047Z
Comments.Text: It would run out of memory eventually.
Comments.UserDisplayName: RemcoGerlich
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2017-03-19T20:30:08.100Z
Comments.Text: How infinite is infinite?  A billion computers each pumping out a billion brute-force moves per second?  If you're lucky, and you're young, and you started the computations now, maybe you'd live to see the day when the 10th move (20 ply deep) is entirely calculated.
Comments.UserDisplayName: D M
Tags: <stockfish>
Title: What if Stockfish had infinite computing power?
ThreadText: # What if Stockfish had infinite computing power?
  
  (Asked by: username_0 on 2017-03-19)
  
  If Stockfish had infinite computing power, or perhaps connected to all Google servers, etc. would it be able to solve the perfect chess moves after 10 moves? Or be able to create the perfect game directly? What would happen?
  
  **Tags:** stockfish
  
  > **Comments:**
  > **username_1**: This sort of counterfactual is a call for speculation rather than a question which has a right or wrong answer.  
  > **username_2**: It would run out of memory eventually.  
  > **username_3**: How infinite is infinite?  A billion computers each pumping out a billion brute-force moves per second?  If you're lucky, and you're young, and you started the computations now, maybe you'd live to see the day when the 10th move (20 ply deep) is entirely calculated.  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_4 on 2017-03-19. Score: 2
  
  No.
  
  * What do you mean by "perfect" chess moves after 10 moves? We don't know they are perfect until the game ends in checkmate! You'll need go mucher deeper than 10 moves. You can't even solve King's Gambit in just 10 moves.
  * The Stockfish algorithm **heavily** skips stupid moves off the search tree. It will **not search** everything no matter what CPU power you give it. You're actually talking about a brute-force engine (search all the possible moves). No, Stockfish is much **smarter** than that.
  * Nothing really happen. You could publish a new paper, but your results would not change the world. We don't need to know what happens after 10 moves, we want to know what happens after 100 moves.
  
  > **Comments:**
  > **username_0**: I meant after the first 10 moves, would it be able to analyze the entire outcome(s) of the game and thus make it impossible to win against it?  
  > **username_5**: @username_0: It is completely unclear to me what the role of  the "10 moves" is in your question. Also, as mentioned stockfish does not analayze all possible lines, but only those it considers interesting/good. The current computer power is very far from solving chess. Currently the best that is known is perfect play for endgames with at most 7 pieces (black and white pieces combined including kings). Doing the same for 8 pieces is significantly harder as storage requirements increase exponentially with every piece.  
  
  ---
  
  