About: Late move reductions

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Late move reductions Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FLate_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. 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 captures and "killer moves" first. Late move reductions will reduce the search depth for moves searched later at a given node. This allows the program to search deeper along the critical lines, and play better.

Attributes	Values
rdfs:label	Late move reductions (en)
rdfs:comment	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 captures and "killer moves" first. Late move reductions will reduce the search depth for moves searched later at a given node. This allows the program to search deeper along the critical lines, and play better. (en)
dcterms:subject	Computer chess Search algorithms
Wikipage page ID	9751921 (xsd:integer)
Wikipage revision ID	1085236284 (xsd:integer)
Link from a Wikipage to another Wikipage	Computer chess Search algorithms Computer chess Game tree Alpha–beta pruning Killer heuristic Chess
Link from a Wikipage to an external page	https://web.archive.org/web/20070820072632/http:/www.glaurungchess.com/lmr.html
sameAs	Late move reductions Late move reductions
dbp:wikiPageUsesTemplate	dbt:Game-stub dbt:Algorithm-stub dbt:No_footnotes
has abstract	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 captures and "killer moves" first. Late move reductions will reduce the search depth for moves searched later at a given node. This allows the program to search deeper along the critical lines, and play better. Most chess programs will search the first several moves at a node to full depth. Often, they do not reduce moves considered to be very tactical, such as captures or promotions. If the score of the move at a reduced depth is smaller than the alpha, the move is assumed to be bad. However, if the score is larger than alpha, the reduced search tells us nothing so we will have to do a full search (fail-low). This search reduction can lead to a different search space than the pure alpha-beta method which can give different results. Care must be taken to select the reduction criteria or the search will miss some deep threats. (en)
prov:wasDerivedFrom	wikipedia-en:Late_move_reductions?oldid=1085236284&ns=0
page length (characters) of wiki page	1705 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Late_move_reductions
is Link from a Wikipage to another Wikipage of	Stockfish (chess) Late Move Reductions Late Move Reduction Late move reduction
is Wikipage redirect of	Late Move Reductions Late Move Reduction Late move reduction
is foaf:primaryTopic of	wikipedia-en:Late_move_reductions

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Sep 2 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 38 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software