chess:programming:move_ordering

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
chess:programming:move_ordering [2022/01/06 17:04] peterchess:programming:move_ordering [2022/01/07 10:33] (current) peter
Line 51: Line 51:
 ---- ----
  
-[[Chess:Programming:Move Ordering|Move Ordering]]+[[Chess:Programming:Move Ordering:Most Valuable Victim/Least Valuable Attacker (MVV/LVA)|Most Valuable Victim/Least Valuable Attacker (MVV/LVA)]] 
 + 
 +[[Chess:Programming:Move Ordering:Static Exchange Evaluation (SEE)|Static Exchange Evaluation (SEE)]] 
  
 ---- ----
Line 69: Line 72:
     * Try various combinations (Quiescence score with some scale for lower plies, and node counts deeper depths).     * Try various combinations (Quiescence score with some scale for lower plies, and node counts deeper depths).
  
 +----
 +
 +  * Cut all moves with a negative SEE-score in the quiescence search.
 +    * These moves are extremely unlikely to prove useful for anything, at least that the quiescence search can detect.
 +
 +----
 +
 +===== References =====
 +
 +https://www.ics.uci.edu/~eppstein/180a/970424.html
  
chess/programming/move_ordering.1641488677.txt.gz · Last modified: 2022/01/06 17:04 by peter

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki