Late move reductions
id:
late-move-reductions-193-9397411
title:
Late move reductions
text:
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. If a cut-off is going to happen in a search, the first few moves are the ones most likely to cause them. In games like chess, most programs search winning captu
brand slug:
wiki
category slug:
encyclopedia
description:
Computer chess algorithm enhancement
original url:
https://en.wikipedia.org/wiki/Late_move_reductions
date created:
date modified:
2023-01-14T01:33:37Z
main entity:
{"identifier":"Q6495249","url":"https://www.wikidata.org/entity/Q6495249"}
image:
fields total:
13
integrity:
14