Answers.Body: <p>I think this is doable. However, it will depend on the number of pieces in the required position.
  You see that many openings can be reached in multiple ways
  <code>(X,Y,Z,...) -&gt; P</code>; where <code>X</code>, <code>Y</code> and <code>Z</code> are the sets of moves that get you from the initial position to the required position <code>P</code>.</p>
  
  <p>This problem is NP-hard, because you can never know for sure which road was selected!</p>
  
  <p>The best way for you is to study the positions of known games (which is most of the time is the case). Then search for <a href="http://www.chessgames.com/" rel="nofollow noreferrer">[1]</a> the game and play it back from the beginning.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2017-09-25T18:29:25.703Z
Answers.LastActivityDate: 2017-09-25T18:29:25.703Z
Answers.UserDisplayName: Hayyan
Body: <p>Is there a chess program where you can create a position and the program creates a game, expecting the best possible moves to get there, or the most common?</p>
  
  <p>A problem I would see is some positions might require a terrible move to get there, or have really extensive games to get to that point.</p>
  
  <p>I feel like this could create creative attacks</p>
  
  <hr>
  
  <p>-Most common= most frequent move, such as how e4 is commonly responded with e5 even though stockfish rates c5 (Sicilian defense) as a higher value choice via the Aplha-Beta Pruning Algorithm.</p>
  
  <p>-"Best" move= pretty much what stockfish/Komodo/ Houdini 
  Would choose as their algorithm chooses the highest value, safe move, as their programs can go deeper than our abilities</p>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2017-09-27T00:55:58.930Z
Comments.Text: You need to define what you mean by "best possible moves" and by "the most common" (and how to combine these two options).
Comments.UserDisplayName: user1583209
Tags: <engines><software><programming>
Title: Backwards Chess Program
ThreadText: # Backwards Chess Program
  
  (Asked by: username_0 on 2017-09-25)
  
  Is there a chess program where you can create a position and the program creates a game, expecting the best possible moves to get there, or the most common?
  
  A problem I would see is some positions might require a terrible move to get there, or have really extensive games to get to that point.
  
  I feel like this could create creative attacks
  
  ---
  
  -Most common= most frequent move, such as how e4 is commonly responded with e5 even though stockfish rates c5 (Sicilian defense) as a higher value choice via the Aplha-Beta Pruning Algorithm.
  
  -"Best" move= pretty much what stockfish/Komodo/ Houdini
  Would choose as their algorithm chooses the highest value, safe move, as their programs can go deeper than our abilities
  
  **Tags:** engines, software, programming
  
  > **Comments:**
  > **username_1**: You need to define what you mean by "best possible moves" and by "the most common" (and how to combine these two options).  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_2 on 2017-09-25. Score: 4 | Accepted answer
  
  I think this is doable. However, it will depend on the number of pieces in the required position.
  You see that many openings can be reached in multiple ways
  `(X,Y,Z,...) -> P`; where `X`, `Y` and `Z` are the sets of moves that get you from the initial position to the required position `P`.
  
  This problem is NP-hard, because you can never know for sure which road was selected!
  
  The best way for you is to study the positions of known games (which is most of the time is the case). Then search for [[1]](http://www.chessgames.com/) the game and play it back from the beginning.
  
  
  ---
  
  