About: Quiescence search

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

About: Quiescence search Goto Sponge NotDistinct Permalink

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

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FQuiescence_search&graph=http%3A%2F%2Fdbpedia.org&graph=http%3A%2F%2Fdbpedia.org

Quiescence search is an algorithm typically used to extend search at unstable nodes in minimax game trees in game-playing computer programs. It is an extension of the evaluation function to defer evaluation until the position is stable enough to be evaluated statically, that is, without considering the history of the position or future moves from the position. It mitigates the effect of the horizon problem faced by AI engines for various games like chess and Go.

Attributes	Values
rdf:type	software
rdfs:label	Quiescence search (en)
rdfs:comment	Quiescence search is an algorithm typically used to extend search at unstable nodes in minimax game trees in game-playing computer programs. It is an extension of the evaluation function to defer evaluation until the position is stable enough to be evaluated statically, that is, without considering the history of the position or future moves from the position. It mitigates the effect of the horizon problem faced by AI engines for various games like chess and Go. (en)
dcterms:subject	Computer chess Articles with example pseudocode Game artificial intelligence
Wikipage page ID	7724220 (xsd:integer)
Wikipage revision ID	1122821044 (xsd:integer)
Link from a Wikipage to another Wikipage	Reversi Games of skill Computer chess Game engine Go (board game) Horizon effect Articles with example pseudocode Game artificial intelligence Game tree Recursion Artificial intelligence Chess Minimax Computer programs Evaluation function Pseudocode Ply (chess)
Link from a Wikipage to an external page	https://www.sciencedirect.com/science/article/abs/pii/0004370290900728
sameAs	Quiescence search Quiescence search Quiescence search
dbp:wikiPageUsesTemplate	dbt:Chess_programming_series dbt:Cite_journal dbt:Main dbt:Short_description
has abstract	Quiescence search is an algorithm typically used to extend search at unstable nodes in minimax game trees in game-playing computer programs. It is an extension of the evaluation function to defer evaluation until the position is stable enough to be evaluated statically, that is, without considering the history of the position or future moves from the position. It mitigates the effect of the horizon problem faced by AI engines for various games like chess and Go. Human players usually have enough intuition to decide whether to abandon a bad-looking move, or search a promising move to a great depth. A quiescence search attempts to emulate this behavior by instructing a computer to search "volatile" positions to a greater depth than "quiet" ones to make sure there are no hidden traps and to get a better estimate of its value. Any sensible criterion may be used to distinguish "quiet" positions from "volatile" positions. One common criterion is that moves exist in the position that can dramatically change the valuation of the position, such as captures in chess or Go. As the main motive of quiescence search is to get a stable value out of a static evaluation function, it may also make sense to detect wide fluctuations in values returned by a simple heuristic evaluator over several ply, i.e. a history criterion. The quiescence search continues as long as the position remains volatile according to the criterion. In order to get the quiescence search to terminate, plies are usually restricted to moves that deal directly with the threat, such as moves that capture and recapture (often called a 'capture search') in chess. In highly "unstable" games like Go and reversi, a rather large proportion of computer time may be spent on quiescence searching. (en)
gold:hypernym	Algorithm
prov:wasDerivedFrom	wikipedia-en:Quiescence_search?oldid=1122821044&ns=0
page length (characters) of wiki page	4305 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Quiescence_search
is Link from a Wikipage to another Wikipage of	Belle (chess machine) Computer Arimaa Crafty Computer chess Horizon effect Quiescence Evaluation function Singular extension search
is Wikipage redirect of	Singular extension search
is Wikipage disambiguates of	Quiescence
is foaf:primaryTopic of	wikipedia-en:Quiescence_search

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.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software