sentences:  Late move reductions
  
  In computer chess, and in other games that computers play, late move reductions is a non-game specific enhancement to the alpha–beta algorithm and its variants which attempts to examine a game search tree more efficiently.It uses the assumption that good game-specific move ordering causes a program to search the most likely moves early.