Changes

Jump to: navigation, search

Evaluation

2,151 bytes added, 09:34, 9 September 2021
2020 ...
a [https://en.wikipedia.org/wiki/Heuristic_(computer_science) heuristic function] to determine the [[Score|relative value]] of a [[Chess Position|position]], i.e. the chances of winning. If we could see to the end of the game in every line, the evaluation would only have values of -1 (loss), 0 (draw), and 1 (win), and the chess engine should search to depth 1 only to get the best move. In practice, however, we do not know the exact value of a position, so we must make an approximation with the main purpose is to compare positions, and the chess engine now must search deeply and find the highest score position within a given period.
Recently, there are two main ways to build an evaluation: traditional '''hand-crafted evaluation''' (HCE) and multi-layer [[Neural Networks|neural networks]]. This page focuses on the traditional way considering explicit features of a [[Chess Position|chess position]].
Beginning chess players learn to do this starting with the [[Point Value|value]] of the [[Pieces|pieces]] themselves. Computer evaluation functions also use the value of the [[Material|material balance]] as the most significant aspect and then add other considerations.
* [[Quantifying Evaluation Features]] by [[Mark Watkins]]
* [[Simplified Evaluation Function]]
* [[PeSTO's Evaluation Function]]
=See also=
==2020 ...==
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=74652 romantic-style play] by [[Stuart Cracraft]], [[CCC]], August 02, 2020
* [https://prodeo.actieforum.com/t120-engine-choosing-between-sets-of-piece-square-tables Engine choosing between sets of piece/square tables] by [[Pawel Koziol]], [[Computer Chess Forums|ProDeo Forum]], December 05, 2020 » [[Rodent]], [[Piece-Square Tables]]* [https://prodeo.actieforum.com/t123-controlled-randomness-of-evaluation-function Controlled randomness of evaluation function] by [[Pawel Koziol|nescitus]], [[Computer Chess Forums|ProDeo Forum]], December 06, 2020* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=76161 Manually tuned evaluation] by [[Maksim Korzh]], [[CCC]], December 27, 2020» [[Simplified Evaluation Function]]'''2021'''* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=76446 So what do we miss in the traditional evaluation?] by [[Ferdinand Mosca]], [[CCC]], January 29, 2021 » [[NNUE]]* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=76556 HCE and NNUE and vectorisation] by [[Vivien Clauzon]], [[CCC]], February 11, 2021 » [[NNUE]], [[Minic]]* [https://groups.google.com/g/lczero/c/TLCMkkdm1hw/m/erjTVGUqAQAJ Idea: use range (evalMin - evalMax) for position evaluation] by Mirza Hadzic, [[Computer Chess Forums|LCZero Forum]], April 6, 2021 : [https://groups.google.com/g/lczero/c/TLCMkkdm1hw/m/SgbGghzhBAAJ Re: Idea: use range (evalMin - evalMax) for position evaluation] by [[Álvaro Begué]], [[Computer Chess Forums|LCZero Forum]], May 28, 2021 <ref>[[Eric B. Baum]], [[Warren D. Smith]] ('''1999'''). ''[https://www.mitpressjournals.org/doi/abs/10.1162/089976699300016881?journalCode=neco Propagating Distributions Up Directed Acyclic Graphs]''. [https://en.wikipedia.org/wiki/Neural_Computation_%28journal%29 Neural Computation], Vol. 11, No. 1</ref>: [https://groups.google.com/g/lczero/c/TLCMkkdm1hw/m/F9JjnN8FBQAJ Re: Idea: use range (evalMin - evalMax) for position evaluation] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], May 29, 2021* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=77571 I declare that HCE is dead...] by [[Andrew Grant]], [[CCC]], June 29, 2021 » [[Ethereal]], [[NNUE]]* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=77952 Evaluation questions] by [[Ellie Moore]], [[CCC]], August 16, 2021
=External Links=
* [https://en.wikipedia.org/wiki/Orthogonality Orthogonality from Wikipedia]
* [https://en.wikipedia.org/wiki/Principal_component_analysis Principal component analysis from Wikipedia]
 
==Chess Evaluation==
* [https://en.wikipedia.org/wiki/Evaluation_function Evaluation function from Wikipedia]

Navigation menu