Answers.Body: <p>Best performing algorithms are YBWC and DTS. Lazy SMP is probably giving best performance/complexity ratio. You can read more about parallel search algorithms <a href="http://chessprogramming.wikispaces.com/Parallel+Search" rel="nofollow">here</a> (make sure to check referencies and links. 
  As for reference realization, I haven't seen any, so I just used simpler engines with parallel search,  and, mostly, algorithms descriptions. </p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-10-19T19:07:31.067Z
Answers.LastActivityDate: 2015-10-19T19:07:31.067Z
Answers.UserDisplayName: EvgeniyZh
Answers.Body: <p>You can read all about chess programming <a href="http://chessprogramming.wikispaces.com" rel="nofollow">here</a>.</p>
  
  <p>In general, chess engines start with some form of minimax algorithm with alpha-beta pruning, then add in refinements.</p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-10-18T20:23:55.073Z
Answers.LastActivityDate: 2015-10-18T20:23:55.073Z
Answers.UserDisplayName: Pete Becker
Answers.Body: <p>For most engines, this is proprietary information. However, Stockfish is quite good and is open source; its search algorithm is found <a href="https://github.com/official-stockfish/Stockfish/blob/master/src/search.cpp" rel="nofollow">here</a></p>
  
Answers.ContentLicense: CC BY-SA 3.0
Answers.CreationDate: 2015-10-18T20:00:32.903Z
Answers.LastActivityDate: 2015-10-18T20:00:32.903Z
Answers.UserDisplayName: Retiarius
Body: <p>what are the top parallel search algorithms used by top engines ,and which one is the best ?
  And is there a reference implementation of them in any programming language ? I know most of  the top engines are open source but they tend to be extremely complex and unsuitable for learning .</p>
  
Comments.ContentLicense: CC BY-SA 3.0
Comments.CreationDate: 2015-10-16T09:03:20.480Z
Comments.Text: "This question is a bit board,…" that's the most in-character typo I have read in a while. ;-)
Comments.UserDisplayName: BlindKungFuMaster
Tags: <engines><software><chess-algorithms>
Title: Search Algorithms used by top engines?
ThreadText: # Search Algorithms used by top engines?
  
  (Asked by: username_0 on 2015-10-16)
  
  what are the top parallel search algorithms used by top engines ,and which one is the best ?
  And is there a reference implementation of them in any programming language ? I know most of the top engines are open source but they tend to be extremely complex and unsuitable for learning .
  
  **Tags:** engines, software, chess-algorithms
  
  > **Comments:**
  > **username_1**: "This question is a bit board,…" that's the most in-character typo I have read in a while. ;-)  
  
  ---
  
  ## 3 answers
  
  ### Answer by username_2 on 2015-10-19. Score: 1
  
  Best performing algorithms are YBWC and DTS. Lazy SMP is probably giving best performance/complexity ratio. You can read more about parallel search algorithms [here](http://chessprogramming.wikispaces.com/Parallel+Search) (make sure to check referencies and links.
  As for reference realization, I haven't seen any, so I just used simpler engines with parallel search, and, mostly, algorithms descriptions.
  
  
  ---
  
  ### Answer by username_3 on 2015-10-18. Score: 0
  
  You can read all about chess programming [here](http://chessprogramming.wikispaces.com).
  
  In general, chess engines start with some form of minimax algorithm with alpha-beta pruning, then add in refinements.
  
  
  ---
  
  ### Answer by username_4 on 2015-10-18. Score: 0
  
  For most engines, this is proprietary information. However, Stockfish is quite good and is open source; its search algorithm is found [here](https://github.com/official-stockfish/Stockfish/blob/master/src/search.cpp)
  
  
  ---
  
  