Late Move Reductions (abbreviated as LMR) is a non-game specific enhancement to the alpha-beta algorithm and its other variants which attempts to examine a game search tree more efficiently by "pruning" bad nodes. It relies on the assumption that good game-specific move ordering causes a program to search the most likely (good) moves early.
Late Move Reductions (abbreviated as LMR) is a non-game specific enhancement to the alpha-beta algorithm and its other variants which attempts to examine a game search tree more efficiently by "pruning" bad nodes. It relies on the assumption that good game-specific move ordering causes a program to search the most likely (good) moves early.
Source: Wikipedia "Late move reductions" · CC BY-SA 4.0
Share this article: X · Bluesky