chess:programming:search
This is an old revision of the document!
Table of Contents
Chess - Programming - Search
Quiescence Search
int Quiesce( int alpha, int beta ) { int stand_pat = Evaluate(); if( stand_pat >= beta ) return beta; if( alpha < stand_pat ) alpha = stand_pat; until( every_capture_has_been_examined ) { MakeCapture(); score = -Quiesce( -beta, -alpha ); TakeBackMove(); if( score >= beta ) return beta; if( score > alpha ) alpha = score; } return alpha; }
References
http://web.archive.org/web/20120421170110/http://chessprogramming.wikispaces.com/Alpha-Beta
http://web.archive.org/web/20120209041607/http://chessprogramming.wikispaces.com/Minimax
http://web.archive.org/web/20120209042116/http://chessprogramming.wikispaces.com/Negamax
http://web.archive.org/web/20120427185347/http://chessprogramming.wikispaces.com/Quiescence+Search
chess/programming/search.1633992472.txt.gz · Last modified: 2021/10/11 22:47 by peter