Quiescence search
id:
quiescence-search-260-5495588
title:
Quiescence search
text:
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
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm used in game-playing computer programs
original url:
https://en.wikipedia.org/wiki/Quiescence_search
date created:
date modified:
2022-11-19T23:50:06Z
main entity:
{"identifier":"Q7271842","url":"https://www.wikidata.org/entity/Q7271842"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/52/Chess_Programming.svg","width":64,"height":64}
fields total:
13
integrity:
15