25,161
edits
Changes
Created page with "'''Home * Evaluation''' border|right|thumb|link=https://www.pinterest.de/pin/58476495131654514/| [[Arts#Kandinsky|Wassily Kandinsky..."
'''[[Main Page|Home]] * Evaluation'''
[[FILE:Schach-Theorie.jpg|border|right|thumb|link=https://www.pinterest.de/pin/58476495131654514/| [[Arts#Kandinsky|Wassily Kandinsky]], Schach-Theorie, 1937 <ref>[https://www.pinterest.de/pin/58476495131654514/ Vassily Kandinsky - Schach-Theorie | Art I love | Pinterest]</ref> ]]
'''Evaluation''',<br/>
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). In practice, however, we do not know the exact value of a position, so we must make an approximation. 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.
=Where to Start=
The first thing to consider when writing an evaluation function is how to score a move in [[Minimax]] or the more common [[Negamax|NegaMax]] framework. While Minimax usually associates the white side with the max-player and black with the min-player and always evaluates from the white point of view, NegaMax requires a symmetric evaluation in relation to the [[Side to move|side to move]]. We can see that one must not score the move per se – but the result of the move (i.e. a positional evaluation of the board as a result of the move). Such a symmetric evaluation function was first formulated by [[Claude Shannon]] in 1949 <ref>[[Claude Shannon]] ('''1949'''). ''[http://www.pi.infn.it/%7Ecarosi/chess/shannon.txt Programming a Computer for Playing Chess]''. [http://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf pdf]</ref> :
<pre>
f(p) = 200(K-K')
+ 9(Q-Q')
+ 5(R-R')
+ 3(B-B' + N-N')
+ 1(P-P')
- 0.5(D-D' + S-S' + I-I')
+ 0.1(M-M') + ...
KQRBNP = number of kings, queens, rooks, bishops, knights and pawns
D,S,I = doubled, blocked and isolated pawns
M = Mobility (the number of legal moves)
</pre>
Here, we can see that the [[Score|score]] is returned as a result of subtracting the current side's score from the equivalent evaluation of the opponent's board scores (indicated by the prime letters K' Q' and R'.. ).
==Side to move relative==
In order for [[Negamax|NegaMax]] to work, it is important to return the score relative to the side being evaluated. For example, consider a simple evaluation, which considers only [[Material|material]] and [[Mobility|mobility]]:
<pre>
materialScore = kingWt * (wK-bK)
+ queenWt * (wQ-bQ)
+ rookWt * (wR-bR)
+ knightWt* (wN-bN)
+ bishopWt* (wB-bB)
+ pawnWt * (wP-bP)
mobilityScore = mobilityWt * (wMobility-bMobility)
</pre>
''return the score relative to the [[Side to move|side to move]] (who2Move = +1 for white, -1 for black):''
<pre>
Eval = (materialScore + mobilityScore) * who2Move
</pre>
<span id="Linear"></span>
==Linear vs. Nonlinear==
Most evaluations terms are a [https://en.wikipedia.org/wiki/Linear_combination linear combination] of independent features and associated weights in the form of
[[FILE:EvalLinearFormula1.jpg|none|border|text-bottom]]
A function ''f'' is [https://en.wikipedia.org/wiki/Linear linear] if the function is [https://en.wikipedia.org/wiki/Additive_function additive]:
[[FILE:EvalLinearFormula2.jpg|none|border|text-bottom]]
and second if the function is [https://en.wikipedia.org/wiki/Homogeneous_function homogeneous] of degree 1:
: [[FILE:EvalLinearFormula3.jpg|none|border|text-bottom]]
It depends on the definition and [https://en.wikipedia.org/wiki/Linear_independence independence] of features and the acceptance of the [https://en.wikipedia.org/wiki/Axiom_of_choice axiom of choice] ([[Ernst Zermelo]] 1904), whether additive real number functions are linear or not <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=288501&t=29552 Re: Linear vs. Nonlinear Evalulation] by [[Tord Romstad]], [[CCC]], August 27, 2009</ref> . Features are either related to single pieces ([[Material|material]]), their location ([[Piece-Square Tables|piece-square tables]]), or more sophisticated, considering interactions of multiple pawns and pieces, based on certain [[Evaluation Patterns|patterns]] or [[Chunking|chunks]]. Often several phases to first process simple features and after building appropriate data structures, in consecutive phases more complex features based on patterns and chunks are used.
Based on that, to distinguish [https://en.wikipedia.org/wiki/First-order first-order], [https://en.wikipedia.org/wiki/Second-order second-order], etc. terms, makes more sense than using the arbitrary terms linear vs. nonlinear evaluation <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=288564&t=29552 Re: Linear vs. Nonlinear Evalulation] by [[Robert Hyatt]], [[CCC]], August 27, 2009</ref> . With respect to [[Automated Tuning|tuning]], one has to take care that features are independent, which is not always that simple. Hidden dependencies may otherwise make the evaluation function hard to maintain with undesirable nonlinear effects.
==General Aspects==
* [[Evaluation Philosophy]]
* [[Pawn Advantage, Win Percentage, and ELO]]
* [[Score#ValueRange|Value Range]]
=Basic Evaluation Features=
* [[Material]]
* [[Piece-Square Tables]]
* [[Pawn Structure]]
* [[Evaluation of Pieces]]
* [[Mobility]]
* [[Center Control]]
* [[Connectivity]]
* [[Trapped Pieces]]
* [[King Safety]]
* [[Space]]
* [[Tempo]]
=Considering Game Phase=
* [[Game Phases]]
: [[Opening]]
: [[Middlegame]]
: [[Endgame]]
* [[Evaluation Discontinuity]]
* [[Tapered Eval]] (a score is interpolated between opening and endgame based on game stage/pieces)
=Miscellaneous=
* [[Analog Evaluation]]
* [[Asymmetric Evaluation]]
* [[Automated Tuning]]
* [[Evaluation Function]]
* [[Evaluation Function Draft]]
* [[Evaluation Hash Table]]
* [[Evaluation Overlap]] by [[Mark Watkins]]
* [[Evaluation Patterns]]
* [[Lazy Evaluation]]
* [[Quantifying Evaluation features]] by [[Mark Watkins]]
* [[Simplified evaluation function]]
=See also=
* [[CPW-Engine_eval]] - an example of a medium strength evaluation function
* [[Papa#Entropy|Entropy in Papa]]
* [[Kaissa#Evaluation|Evaluation in Kaissa (PC)]]
* [[Rookie#Evaluation|Evaluation in Rookie 2.0]]
* [[Knowledge]]
: [[Knowledge#SearchVersusEvaluation|Search versus Evaluation]]
* [[Learning]]
* [[Oracle]]
* [[Point Value]]
* [[Search with Random Leaf Values]]
* [[Stockfish#EvaluationGuide|Stockfish Evaluation Guide]]
=Publications=
==1949==
* [[Claude Shannon]] ('''1949'''). ''[http://www.pi.infn.it/%7Ecarosi/chess/shannon.txt Programming a Computer for Playing Chess]''. [http://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf pdf] from [[The Computer History Museum]]
==1950 ...==
* [[Eliot Slater]] ('''1950'''). ''Statistics for the Chess Computer and the Factor of Mobility,'' Proceedings of the Symposium on Information Theory, London. Reprinted 1988 in [[Computer Chess Compendium]], pp. 113-117. Including the transcript of a discussion with [[Alan Turing]] and [[Jack Good]]
* [[Alan Turing]] ('''1953'''). '''''Chess'''''. part of the collection ''Digital Computers Applied to Games'', in [https://en.wikipedia.org/wiki/B._V._Bowden,_Baron_Bowden Bertram Vivian Bowden] (editor), [http://www.computinghistory.org.uk/cgi-bin/sitewise.pl?act=det&p=10719 Faster Than Thought], a symposium on digital computing machines, reprinted 1988 in [[Computer Chess Compendium]], reprinted 2004 in ''The Essential Turing'', [http://books.google.com/books?id=RSkxnKlv1D4C&lpg=PP882&ots=VOWmiIm_lD&dq=Turochamp%2C%20chess&pg=PP881#v=onepage&q&f=true google books]
==1960 ...==
* [https://en.wikipedia.org/wiki/Israel_Albert_Horowitz Israel Albert Horowitz], [https://en.wikipedia.org/wiki/Mott-Smith_Trophy Geoffrey Mott-Smith] ('''1960,1970,2012'''). ''[http://www.chess-game-strategies.com/point-count-chess.html Point Count Chess]''. [https://en.wikipedia.org/wiki/Samuel_Reshevsky Samuel Reshevsky] (Introduction), [[Sam Sloan]] (2012 Introduction), [http://www.amazon.com/Point-Count-Chess-Accurate-Winning/dp/4871874699/ref=sr_1_2?s=books&ie=UTF8&qid=1366734801&sr=1-2 Amazon] <ref>[https://www.stmintz.com/ccc/index.php?id=25046 Re: Books that help for evaluation] by [[Robert Hyatt]], [[CCC]], August 18, 1998</ref>
* [[Jack Good]] ('''1968'''). ''A Five-Year Plan for Automatic Chess.'' Machine Intelligence II pp. 110-115
==1970 ...==
* [[Ron Atkin]] ('''1972'''). ''Multi-Dimensional Structure in the Game of Chess''. In [http://www.interaction-design.org/references/periodicals/international_journal_of_man-machine_studies_volume_4.html International Journal of Man-Machine Studies, Vol. 4]
* [[Ron Atkin]], [[Ian H. Witten]] ('''1975'''). ''[http://www.bibsonomy.org/bibtex/2b91106ea980eb48aa505f6b54c130707/dblp A Multi-Dimensional Approach to Positional Chess]''. [http://www.interaction-design.org/references/periodicals/international_journal_of_man-machine_studies_volume_7.html International Journal of Man-Machine Studies, Vol. 7, No. 6]
* [[Gerard Zieliński]] ('''1976'''). ''[http://www.emeraldinsight.com/doi/abs/10.1108/eb005425 Simple Evaluation Function]''. [http://www.emeraldinsight.com/loi/k Kybernetes], Vol. 5, No. 3
* [[Ron Atkin]] ('''1977'''). ''Positional Play in Chess by Computer''. [[Advances in Computer Chess 1]]
* [[David Slate]], [[Larry Atkin]] ('''1977'''). ''CHESS 4.5 - The Northwestern University Chess Program.'' [[Chess Skill in Man and Machine]] (ed. [[Peter W. Frey]]), pp. 82-118. Springer-Verlag, New York, N.Y. 2nd ed. 1983. ISBN 0-387-90815-3. Reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[Hans Berliner]] ('''1979'''). ''[http://www.bkgm.com/articles/Berliner/EvaluationFunctionsLargeDomains/ On the Construction of Evaluation Functions for Large Domains]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/ijcai/index.html IJCAI 1979] Tokyo, Vol. 1, pp. 53-55.
==1980 ...==
* [[Helmut Horacek]] ('''1984'''). ''Some Conceptual Defects of Evaluation Functions''. [http://dl.acm.org/citation.cfm?id=537320 ECAI-84], [https://en.wikipedia.org/wiki/Pisa Pisa], [https://en.wikipedia.org/wiki/Elsevier Elsevier]
* [[Peter W. Frey]] ('''1985'''). ''An Empirical Technique for Developing Evaluation Functions''. [[ICGA Journal#8_1|ICCA Journal, Vol. 8, No. 1]]
* [[Tony Marsland]] ('''1985'''). ''Evaluation-Function Factors''. [[ICGA Journal#8_2|ICCA Journal, Vol. 8, No. 2]], [http://webdocs.cs.ualberta.ca/~tony/OldPapers/evaluation.pdf pdf]
* [[Jens Christensen]], [[Richard Korf]] ('''1986'''). ''A Unified Theory of Heuristic Evaluation functions and Its Applications to Learning.'' Proceedings of the [http://www.aaai.org/Conferences/AAAI/aaai86.php AAAI-86], pp. 148-152, [http://www.aaai.org/Papers/AAAI/1986/AAAI86-023.pdf pdf]
* [[Dap Hartmann]] ('''1987'''). ''How to Extract Relevant Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Dap Hartmann]] ('''1987'''). ''How to Extract Relevant Knowledge from Grandmaster Games. Part 2: the Notion of Mobility, and the Work of [[Adriaan de Groot|De Groot]] and [[Eliot Slater|Slater]]''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]
* [[Bruce Abramson]], [[Richard Korf]] ('''1987'''). ''A Model of Two-Player Evaluation Functions.'' [http://www.aaai.org/Conferences/AAAI/aaai87.php AAAI-87]. [http://www.aaai.org/Papers/AAAI/1987/AAAI87-016.pdf pdf]
* [[Kai-Fu Lee]], [[Sanjoy Mahajan]] ('''1988'''). ''[http://www.sciencedirect.com/science/article/pii/0004370288900768 A Pattern Classification Approach to Evaluation Function Learning]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 36, No. 1
* [[Dap Hartmann]] ('''1989'''). ''Notions of Evaluation Functions Tested against Grandmaster Games''. [[Advances in Computer Chess 5]]
* [[Maarten van der Meulen]] ('''1989'''). ''Weight Assessment in Evaluation Functions''. [[Advances in Computer Chess 5]]
* [[Bruce Abramson]] ('''1989'''). ''On Learning and Testing Evaluation Functions.'' Proceedings of the Sixth Israeli Conference on Artificial Intelligence, 1989, 7-16.
* [[Danny Kopec]], [[Ed Northam]], [[David Podber]], [[Yehya Fouda]] ('''1989'''). ''The Role of Connectivity in Chess''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]], [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_24_C.pdf pdf]
==1990 ...==
* [[Bruce Abramson]] ('''1990'''). ''On Learning and Testing Evaluation Functions.'' Journal of Experimental and Theoretical Artificial Intelligence 2: 241-251.
* [[Ron Kalnim]] ('''1990'''). ''A Positional Assembly Model''. [[ICGA Journal#13_3|ICCA Journal, Vol. 13, No. 3]]
* [[Paul E. Utgoff]], [http://dblp.uni-trier.de/pers/hd/c/Clouse:Jeffery_A= Jeffery A. Clouse] ('''1991'''). ''[http://scholarworks.umass.edu/cs_faculty_pubs/193/ Two Kinds of Training Information for Evaluation Function Learning]''. [https://en.wikipedia.org/wiki/University_of_Massachusetts_Amherst University of Massachusetts, Amherst], Proceedings of the AAAI 1991
* [[Ingo Althöfer]] ('''1991'''). ''An Additive Evaluation Function in Chess.'' [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]]
* [[Ingo Althöfer]] ('''1993'''). ''On Telescoping Linear Evaluation Functions.'' [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]] <ref>[https://www.stmintz.com/ccc/index.php?id=475521 Re: Zappa Report] by [[Ingo Althöfer]], [[CCC]], December 30, 2005</ref>
* [[Alois Heinz]], [[Christoph Hense]] ('''1993'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.872 Bootstrap learning of α-β-evaluation functions]''. [http://dblp.uni-trier.de/db/conf/icci/icci1993.html#HeinzH93 ICCI 1993], [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.56.872&rep=rep1&type=pdf pdf]
* [[Alois Heinz]] ('''1994'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.3994 Efficient Neural Net α-β-Evaluators]''. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.55.3994&rep=rep1&type=pdf pdf] <ref>[https://www.stmintz.com/ccc/index.php?id=11893 Re: Evaluation by neural network ?] by [[Jay Scott]], [[CCC]], November 10, 1997</ref>
* [[Peter Mysliwietz]] ('''1994'''). ''Konstruktion und Optimierung von Bewertungsfunktionen beim Schach.'' Ph.D. Thesis (German)
* [[Don Beal]], [[Martin C. Smith]] ('''1994'''). ''Random Evaluations in Chess''. [[ICGA Journal#17_1|ICCA Journal, Vol. 17, No. 1]]
* [[Yaakov HaCohen-Kerner]] ('''1994'''). ''[http://www.springerlink.com/content/f5n27h25q4l920q8/ Case-Based Evaluation in Computer Chess]''. [http://www.informatik.uni-trier.de/~ley/db/conf/ewcbr/ewcbr1994.html#Kerner94 EWCBR 1994]
* [[Michael Buro]] ('''1995'''). ''[http://www.jair.org/papers/paper179.html Statistical Feature Combination for the Evaluation of Game Positions]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 3
* [[Peter Mysliwietz]] ('''1997'''). ''A Metric for Evaluation Functions''. [[Advances in Computer Chess 8]]
* [[Michael Buro]] ('''1998'''). ''[http://link.springer.com/chapter/10.1007/3-540-48957-6_8 From Simple Features to Sophisticated Evaluation Functions]''. [[CG 1998]], [https://skatgame.net/mburo/ps/glem.pdf pdf]
==2000 ...==
* [[Dan Heisman]] ('''2003'''). ''Evaluation Criteria'', [http://www.chesscafe.com/text/heisman27.pdf pdf] from [https://en.wikipedia.org/wiki/ChessCafe.com ChessCafe.com]
* [[Jeff Rollason]] ('''2005'''). ''[http://www.aifactory.co.uk/newsletter/2005_03_hill-climbing.htm Evaluation by Hill-climbing: Getting the right move by solving micro-problems]''. [[AI Factory]], Autumn 2005 » [[Automated Tuning]]
* [[Shogo Takeuchi]], [[Tomoyuki Kaneko]], [[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2007'''). ''Visualization and Adjustment of Evaluation Functions Based on Evaluation Values and Win Probability''. [http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai2007.html AAAI 2007]
* [[Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2008'''). ''Genetic Algorithms for Mentor-Assisted Evaluation Function Optimization'', ACM Genetic and Evolutionary Computation Conference ([http://www.sigevo.org/gecco-2008/ GECCO '08]), pp. 1469-1475, Atlanta, GA, July 2008.
* [[Omid David]], [[Jaap van den Herik]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2009'''). ''Simulating Human Grandmasters: Evolution and Coevolution of Evaluation Functions''. [[ACM]] Genetic and Evolutionary Computation Conference ([http://www.sigevo.org/gecco-2009/ GECCO '09]), pp. 1483 - 1489, Montreal, Canada, July 2009.
* [[Omid David]] ('''2009'''). ''Genetic Algorithms Based Learning for Evolving Intelligent Organisms''. Ph.D. Thesis.
==2010 ...==
* [[Lyudmil Tsvetkov]] ('''2010'''). ''Little Chess Evaluation Compendium''. [http://www.winboardengines.de/doc/LittleChessEvaluationCompendium-2010-04-07.pdf 2010 pdf]
* [[Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2011'''). ''Expert-Driven Genetic Algorithms for Simulating Evaluation Functions''. Genetic Programming and Evolvable Machines, Vol. 12, No. 1, pp. 5--22, March 2011. » [[Genetic Programming]]
* [[Jeff Rollason]] ('''2011'''). ''[http://www.aifactory.co.uk/newsletter/2011_02_mcts_static.htm Mixing MCTS with Conventional Static Evaluation]''. [[AI Factory]], Winter 2011 » [[Monte-Carlo Tree Search]]
* [[Jeff Rollason]] ('''2012'''). ''[http://www.aifactory.co.uk/newsletter/2012_01_evaluation_options.htm Evaluation options - Overview of methods]''. [[AI Factory]], Summer 2012
* [[Lyudmil Tsvetkov]] ('''2012'''). ''An Addendum to a Little Chess Evaluation Compendium''. [http://www.winboardengines.de/doc/addendumlcec_2012.pdf Addendum June 2012 pdf], [[file:Addendum2LCEC_2012.pdf|Addendum 2 September 2012 pdf]], [[file:Addendum3LCEC_2012.pdf|Addendum 3 September 2012 pdf]], [http://www.winboardengines.de/doc/addendum4lcec_2012.pdf Addendum 4 November 2012 pdf], [[file:Addendum5LCEC_2012.pdf|Addendum 5 November 27, 2012 pdf]], [[file:Addendum6LCEC_2012.pdf|Addendum 6 December 03, 2012 pdf]]
* [[Lyudmil Tsvetkov]] ('''2012'''). ''Little Chess Evaluation Compendium''. [http://www.winboardengines.de/doc/LittleChessEvaluationCompendium.pdf July 2012 pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=44265 An Update of the Addendum to the LittleCompendium] by [[Lyudmil Tsvetkov]], [[CCC]], July 02, 2012</ref>, [[file:LittleChessEvaluationCompendium.pdf|December 03, 2012 pdf]]
* [[Derek Farren]], [[Daniel Templeton]], [[Meiji Wang]] ('''2013'''). ''Analysis of Networks in Chess''. Team 23, [[Stanford University]], [http://snap.stanford.edu/class/cs224w-2013/projects2013/cs224w-023-final.pdf pdf]
==2015 ...==
* [[Nera Nesic]], [[Stephan Schiffel]] ('''2016'''). ''Heuristic Function Evaluation Framework''. [[CG 2016]]
* [[Lyudmil Tsvetkov]] ('''2017'''). ''[http://www.secretofchess.com/ The Secret of Chess]''. [https://www.amazon.com/Secret-Chess-Lyudmil-Tsvetkov-ebook/dp/B074M85CVV amazon] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=64776 The Secret of Chess] by [[Lyudmil Tsvetkov]], [[CCC]], August 01, 2017</ref>
* [[Lyudmil Tsvetkov]] ('''2017'''). ''Pawns''. [https://www.amazon.com/Pawns-Lyudmil-Tsvetkov-ebook/dp/B074S2MYQV amazon]
=Blog & Forum Posts=
==1993 ...==
* [https://groups.google.com/d/msg/rec.games.chess/J9Pkg9lOpig/tBN5dVRATwsJ Cray Blitz Evaluation] by [[Robert Hyatt]], [[Computer Chess Forums|rgc]], March 05, 1993 » [[Cray Blitz]]
* [https://groups.google.com/d/msg/rec.games.chess/6vwtkcF6sRU/4M3oOiDNYwgJ Mobility Measure: Proposed Algorithm] by Dietrich Kappe, [[Computer Chess Forums|rgc]], September 23, 1993 » [[Mobility]]
* [https://groups.google.com/d/msg/rec.games.chess/M4CKCmqDNkI/TjVJEQY0GC0J bitboard position evaluations] by [[Robert Hyatt]], [[Computer Chess Forums|rgc]], November 17, 1994 » [[Bitboards]]
==1995 ...==
* [https://groups.google.com/d/msg/rec.games.chess/efBhsZU3J1g/fC7rxV5yuycJ Value of the pieces] by Joost de Heer, [[Computer Chess Forums|rgc]], February 01, 1995
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/4f54813edf18fdcc Evaluation function diminishing returns] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], February 1, 1997
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/40fe48d492e582bd Evaluation function question] by [[David Fotland|Dave Fotland]], [[Computer Chess Forums|rgcc]], February 07, 1997
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/99eec6923b0481db computer chess "oracle" ideas...] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], April 01, 1997 » [[Oracle]]
* [https://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/77f10f072e907302 Evolutionary Evaluation] by [[Dan Homan]], [[Computer Chess Forums|rgcc]], September 09, 1997 » [[Automated Tuning]]
* [https://www.stmintz.com/ccc/index.php?id=25012 Books that help for evaluation] by [[Guido Schimmels]], [[CCC]], August 18, 1998
* [https://www.stmintz.com/ccc/index.php?id=80569 Static evaluation after the "Positional/Real Sacrifice"] by [[Andrew Williams]], [[CCC]], December 03, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=289154 Adding knowledge to the evaluation, what am I doing wrong?] by [[Albert Bertilsson]], [[CCC]], March 13, 2003
* [https://www.stmintz.com/ccc/index.php?id=293815 testing of evaluation function] by Steven Chu, [[CCC]], April 17, 2003 » [[Engine Testing]]
* [https://www.stmintz.com/ccc/index.php?id=328924 Question about evaluation and branch factor] by [[Marcus Prewarski]], [[CCC]], November 20, 2003 » [[Branching Factor]]
* [https://www.stmintz.com/ccc/index.php?id=350516 STATIC EVAL TEST (provisional)] by [[Jaime Benito de Valle Ruiz]], [[CCC]], February 21, 2004 » [[Test-Positions]]
==2005 ...==
* [https://www.stmintz.com/ccc/index.php?id=475521 Re: Zappa Report] by [[Ingo Althöfer]], [[CCC]], December 30, 2005
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4155#p21292 Do you evaluate internal nodes?] by [[Tord Romstad]], [[Computer Chess Forums|Winboard Forum]], January 16, 2006 » [[Interior Node]]
* [http://www.talkchess.com/forum/viewtopic.php?t=13969 question about symmertic evaluation] by [[Uri Blass]], [[CCC]], May 23, 2007
* [http://www.hiarcs.net/forums/viewtopic.php?t=402 Search or Evaluation?] by [[Ed Schroder|Ed Schröder]], [[Computer Chess Forums|Hiarcs Forum]], October 05, 2007 » [[Knowledge#SearchVersusEvaluation|Search versus Evaluation]], [[Search]]
: [http://www.hiarcs.net/forums/viewtopic.php?p=2944 Re: Search or Evaluation?] by [[Mark Uniacke]], [[Computer Chess Forums|Hiarcs Forum]], October 14, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=22817 Evaluation functions. Why integer?] by oysteijo, [[CCC]], August 06, 2008 » [[Float]], [[Score]]
* [http://www.talkchess.com/forum/viewtopic.php?t=25795 Evaluating every node?] by [[Gregory Strong]], [[CCC]], January 03, 2009
* [http://www.talkchess.com/forum/viewtopic.php?t=27299 Eval Dilemma] by [[Edsel Apostol]], [[CCC]], April 03, 2009
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=288424 Linear vs. Nonlinear Evalulation] by [[Gerd Isenberg]], [[CCC]], August 26, 2009
* [http://www.talkchess.com/forum/viewtopic.php?p=291259 Threat information from evaluation to inform q-search] by [[Gary Linscott|Gary]], [[CCC]], September 15, 2009 » [[Quiescence Search]]
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=32396 Correcting Evaluation with the hash table] by [[Mark Lefler]], [[CCC]], February 05, 2010
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=362888&t=35455 Re: Questions for the Stockfish team] by [[Milos Stanisavljevic]], [[CCC]], July 20, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=36104 Most important eval elements] by [[Tom King]], [[CCC]], September 17, 2010
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=374967&t=36421 Re: 100 long games Rybka 4 vs Houdini 1.03a] by [[Tord Romstad]], [[CCC]], November 02, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=37191 dynamically modified evaluation function] by [[Don Dailey]], [[CCC]], December 20, 2010
'''2011'''
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=22785 Suppose Rybka used Fruits evaluations] by [[Søren Riis|SR]], [[Computer Chess Forums|Rybka Forum]], August 29, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=41621 writing an evaluation function] by Pierre Bokma, [[CCC]], December 27, 2011
'''2012'''
* [http://www.talkchess.com/forum/viewtopic.php?t=42806 The evaluation value and value returned by minimax search] by [[Chao Ma]], [[CCC]], March 09, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=43385 Multi dimensional score] by [[Nicu Ionita]], [[CCC]], April 20, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=43386 Bi dimensional static evaluation] by [[Nicu Ionita]], [[CCC]], April 20, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=43387 Theorem proving positional evaluation] by [[Nicu Ionita]], [[CCC]], April 20, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=43545 log(w/b) instead of w-b?] by [[Gerd Isenberg]], [[CCC]], May 02, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=44014 The value of an evaluation function] by [[Ed Schroder|Ed Schröder]], [[CCC]], June 11, 2012
'''2013'''
* [http://www.talkchess.com/forum/viewtopic.php?t=46879 eval scale in Houdini] by [[Rein Halbersma]], [[CCC]], January 14, 2013 » [[Houdini]]
* [http://www.talkchess.com/forum/viewtopic.php?t=46993 An idea of how to make your engine play more rational chess] by [[Pio Korinth]], [[CCC]], January 25, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=48252 A Materialless Evaluation?] by [[Thomas Kolarik]], [[CCC]], June 12, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=48644 A different way of summing evaluation features] by [[Pio Korinth]], [[CCC]], July 14, 2013 <ref>[https://en.wikipedia.org/wiki/Euclidean_distance Euclidean distance from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Principal_component_analysis Principal component analysis from Wikipedia]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=49190 Improve the search or the evaluation?] by [[Jens Bæk Nielsen]], [[CCC]], August 31, 2013 » [[Knowledge#SearchVersusEvaluation|Search versus Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49421 Multiple EVAL] by [[Ed Schroder]], [[CCC]], September 22, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=50472 floating point SSE eval] by [[Marco Belli]], [[CCC]], December 13, 2013 » [[Float]], [[Score]]
'''2014'''
* [http://www.talkchess.com/forum/viewtopic.php?t=51012 5 underestimated evaluation rules] by [[Lyudmil Tsvetkov]], [[CCC]], January 23, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=51811 Thoughs on eval terms] by [[Fermin Serrano]], [[CCC]], March 31, 2014
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=55355 Value of a Feature or Heuristic] by [[Jonathan Rosenthal]], [[CCC]], February 15, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=55897 Couple more ideas] by [[Lyudmil Tsvetkov]], [[CCC]], April 05, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=55955 Most common/top evaluation features?] by [[Alexandru Mosoi]], [[CCC]], April 10, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=56690 eval pieces] by [[Daniel Anulliero]], [[CCC]], June 15, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=57022 * vs +] by [[Stefano Gemma]], [[CCC]], July 19, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=57087 (E)valuation (F)or (S)tarters] by [[Ed Schroder|Ed Schröder]], [[CCC]], July 26, 2015
'''2016'''
* [http://www.talkchess.com/forum/viewtopic.php?t=59091 Non-linear eval terms] by [[J. Wesley Cleveland]], [[CCC]], January 29, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=59570 A bizarre evaluation] by [[Larry Kaufman]], [[CCC]], March 20, 2016
* [http://int8.io/chess-position-evaluation-with-convolutional-neural-networks-in-julia/ Chess position evaluation with convolutional neural network in Julia] by [[Kamil Czarnogorski]], [http://int8.io/ Machine learning with Julia and python], April 02, 2016 » [[Deep Learning]], [[Neural Networks]]
* [http://www.talkchess.com/forum/viewtopic.php?t=61064 Calculating space] by [[Shawn Chidester]], [[CCC]], August 07, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=61236 Evaluation values help] by [[Laurie Tunnicliffe]], [[CCC]], August 26, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=61861 A database for learning evaluation functions] by [[Álvaro Begué]], [[CCC]], October 28, 2016 » [[Automated Tuning]], [[Learning]], [[Texel's Tuning Method]]
* [http://www.talkchess.com/forum/viewtopic.php?t=61875 Evaluation doubt] by [[Fabio Gobbato]], [[CCC]], October 29, 2016
'''2017'''
* [http://www.talkchess.com/forum/viewtopic.php?t=63181 Bayesian Evaluation Functions] by [[Jonathan Rosenthal]], [[CCC]], February 15, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=63408 improved evaluation function] by [[Alexandru Mosoi]], [[CCC]], March 11, 2017 » [[Texel's Tuning Method]], [[Zurichess]]
* [http://www.talkchess.com/forum/viewtopic.php?t=63803 random evaluation perturbation factor] by [[Stuart Cracraft]], [[CCC]], April 24, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=63863 horrid positional play in a solid tactical searcher] by [[Stuart Cracraft]], [[CCC]], April 29, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=64041 Another attempt at comparing Evals ELO-wise] by [[Kai Laskos]], [[CCC]], May 22, 2017 » [[Playing Strength]]
* [http://www.talkchess.com/forum/viewtopic.php?t=64230 static eval in every node?] by [[Erin Dame]], [[CCC]], June 09, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=65403 comparing between search or evaluation] by [[Uri Blass]], [[CCC]], October 09, 2017» [[Search]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65715 Neural networks for chess position evaluation- request] by [[Kamil Czarnogorski]], [[CCC]], November 13, 2017 » [[Deep Learning]], [[Neural Networks]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65829 AlphaGo's evaluation function] by Jens Kipper, [[CCC]], November 26, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=65946 Logarithmic Patterns In Evaluations] by [[Dennis Sceviour]], [[CCC]], December 09, 2017
'''2018'''
* [http://www.talkchess.com/forum/viewtopic.php?t=66413 replace the evaluation by playing against yourself] by [[Uri Blass]], [[CCC]], January 25, 2018 » [[Fortress]]
=External Links=
==Mathematical Foundations==
* [https://en.wikipedia.org/wiki/Heuristic_(computer_science) Heuristic from Wikipedia]
* [https://en.wikipedia.org/wiki/Linear_combination Linear combination from Wikipedia]
* [https://en.wikipedia.org/wiki/Linear_independence Linear independence from Wikipedia]
* [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]
* [https://hxim.github.io/Stockfish-Evaluation-Guide/ Stockfish Evaluation Guide] » [[Stockfish#EvaluationGuide|Stockfish Evaluation Guide]]
* [http://www.top-5000.nl/authors/rebel/chess840.htm#HW Evaluation in REBEL] by [[Ed Schroder|Ed Schröder]] » [[Rebel]]
* [http://www.top-5000.nl/eval.htm The value of an evaluation function] by [[Ed Schroder|Ed Schröder]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=44014 The value of an evaluation function] by [[Ed Schroder|Ed Schröder]], [[CCC]], June 11, 2012</ref>
* [http://rebel13.nl/efs/index.html Rebel - The EFS project] from [http://rebel13.nl/index.html Rebel Pure Nostalgica] by [[Ed Schroder|Ed Schröder]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57087 (E)valuation (F)or (S)tarters] by [[Ed Schroder|Ed Schröder]], [[CCC]], July 26, 2015</ref>
* [http://home.hccnet.nl/h.g.muller/eval.html Evaluation: Basics] of [[Micro-Max]] by [[Harm Geert Muller]]
* [http://www.gamedev.net/page/resources/_/technical/artificial-intelligence/chess-programming-part-vi-evaluation-functions-r1208 Chess Programming Part VI: Evaluation Functions] by [[François-Dominic Laramée]], [https://en.wikipedia.org/wiki/GameDev.net gamedev.net], October 2000
* [http://www.chessbin.com/post/Chess-Board-Evaluation.aspx Chess Board Evaluation] by [[Adam Berent]]
* [http://www.chessvariants.com/d.betza/pieceval/index.html About the Values of Chess Pieces] by [[Ralph Betza]]
=References=
<references />
'''[[Main Page|Up one level]]'''
[[Category:Wassily Kandinsky]]
[[FILE:Schach-Theorie.jpg|border|right|thumb|link=https://www.pinterest.de/pin/58476495131654514/| [[Arts#Kandinsky|Wassily Kandinsky]], Schach-Theorie, 1937 <ref>[https://www.pinterest.de/pin/58476495131654514/ Vassily Kandinsky - Schach-Theorie | Art I love | Pinterest]</ref> ]]
'''Evaluation''',<br/>
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). In practice, however, we do not know the exact value of a position, so we must make an approximation. 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.
=Where to Start=
The first thing to consider when writing an evaluation function is how to score a move in [[Minimax]] or the more common [[Negamax|NegaMax]] framework. While Minimax usually associates the white side with the max-player and black with the min-player and always evaluates from the white point of view, NegaMax requires a symmetric evaluation in relation to the [[Side to move|side to move]]. We can see that one must not score the move per se – but the result of the move (i.e. a positional evaluation of the board as a result of the move). Such a symmetric evaluation function was first formulated by [[Claude Shannon]] in 1949 <ref>[[Claude Shannon]] ('''1949'''). ''[http://www.pi.infn.it/%7Ecarosi/chess/shannon.txt Programming a Computer for Playing Chess]''. [http://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf pdf]</ref> :
<pre>
f(p) = 200(K-K')
+ 9(Q-Q')
+ 5(R-R')
+ 3(B-B' + N-N')
+ 1(P-P')
- 0.5(D-D' + S-S' + I-I')
+ 0.1(M-M') + ...
KQRBNP = number of kings, queens, rooks, bishops, knights and pawns
D,S,I = doubled, blocked and isolated pawns
M = Mobility (the number of legal moves)
</pre>
Here, we can see that the [[Score|score]] is returned as a result of subtracting the current side's score from the equivalent evaluation of the opponent's board scores (indicated by the prime letters K' Q' and R'.. ).
==Side to move relative==
In order for [[Negamax|NegaMax]] to work, it is important to return the score relative to the side being evaluated. For example, consider a simple evaluation, which considers only [[Material|material]] and [[Mobility|mobility]]:
<pre>
materialScore = kingWt * (wK-bK)
+ queenWt * (wQ-bQ)
+ rookWt * (wR-bR)
+ knightWt* (wN-bN)
+ bishopWt* (wB-bB)
+ pawnWt * (wP-bP)
mobilityScore = mobilityWt * (wMobility-bMobility)
</pre>
''return the score relative to the [[Side to move|side to move]] (who2Move = +1 for white, -1 for black):''
<pre>
Eval = (materialScore + mobilityScore) * who2Move
</pre>
<span id="Linear"></span>
==Linear vs. Nonlinear==
Most evaluations terms are a [https://en.wikipedia.org/wiki/Linear_combination linear combination] of independent features and associated weights in the form of
[[FILE:EvalLinearFormula1.jpg|none|border|text-bottom]]
A function ''f'' is [https://en.wikipedia.org/wiki/Linear linear] if the function is [https://en.wikipedia.org/wiki/Additive_function additive]:
[[FILE:EvalLinearFormula2.jpg|none|border|text-bottom]]
and second if the function is [https://en.wikipedia.org/wiki/Homogeneous_function homogeneous] of degree 1:
: [[FILE:EvalLinearFormula3.jpg|none|border|text-bottom]]
It depends on the definition and [https://en.wikipedia.org/wiki/Linear_independence independence] of features and the acceptance of the [https://en.wikipedia.org/wiki/Axiom_of_choice axiom of choice] ([[Ernst Zermelo]] 1904), whether additive real number functions are linear or not <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=288501&t=29552 Re: Linear vs. Nonlinear Evalulation] by [[Tord Romstad]], [[CCC]], August 27, 2009</ref> . Features are either related to single pieces ([[Material|material]]), their location ([[Piece-Square Tables|piece-square tables]]), or more sophisticated, considering interactions of multiple pawns and pieces, based on certain [[Evaluation Patterns|patterns]] or [[Chunking|chunks]]. Often several phases to first process simple features and after building appropriate data structures, in consecutive phases more complex features based on patterns and chunks are used.
Based on that, to distinguish [https://en.wikipedia.org/wiki/First-order first-order], [https://en.wikipedia.org/wiki/Second-order second-order], etc. terms, makes more sense than using the arbitrary terms linear vs. nonlinear evaluation <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=288564&t=29552 Re: Linear vs. Nonlinear Evalulation] by [[Robert Hyatt]], [[CCC]], August 27, 2009</ref> . With respect to [[Automated Tuning|tuning]], one has to take care that features are independent, which is not always that simple. Hidden dependencies may otherwise make the evaluation function hard to maintain with undesirable nonlinear effects.
==General Aspects==
* [[Evaluation Philosophy]]
* [[Pawn Advantage, Win Percentage, and ELO]]
* [[Score#ValueRange|Value Range]]
=Basic Evaluation Features=
* [[Material]]
* [[Piece-Square Tables]]
* [[Pawn Structure]]
* [[Evaluation of Pieces]]
* [[Mobility]]
* [[Center Control]]
* [[Connectivity]]
* [[Trapped Pieces]]
* [[King Safety]]
* [[Space]]
* [[Tempo]]
=Considering Game Phase=
* [[Game Phases]]
: [[Opening]]
: [[Middlegame]]
: [[Endgame]]
* [[Evaluation Discontinuity]]
* [[Tapered Eval]] (a score is interpolated between opening and endgame based on game stage/pieces)
=Miscellaneous=
* [[Analog Evaluation]]
* [[Asymmetric Evaluation]]
* [[Automated Tuning]]
* [[Evaluation Function]]
* [[Evaluation Function Draft]]
* [[Evaluation Hash Table]]
* [[Evaluation Overlap]] by [[Mark Watkins]]
* [[Evaluation Patterns]]
* [[Lazy Evaluation]]
* [[Quantifying Evaluation features]] by [[Mark Watkins]]
* [[Simplified evaluation function]]
=See also=
* [[CPW-Engine_eval]] - an example of a medium strength evaluation function
* [[Papa#Entropy|Entropy in Papa]]
* [[Kaissa#Evaluation|Evaluation in Kaissa (PC)]]
* [[Rookie#Evaluation|Evaluation in Rookie 2.0]]
* [[Knowledge]]
: [[Knowledge#SearchVersusEvaluation|Search versus Evaluation]]
* [[Learning]]
* [[Oracle]]
* [[Point Value]]
* [[Search with Random Leaf Values]]
* [[Stockfish#EvaluationGuide|Stockfish Evaluation Guide]]
=Publications=
==1949==
* [[Claude Shannon]] ('''1949'''). ''[http://www.pi.infn.it/%7Ecarosi/chess/shannon.txt Programming a Computer for Playing Chess]''. [http://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf pdf] from [[The Computer History Museum]]
==1950 ...==
* [[Eliot Slater]] ('''1950'''). ''Statistics for the Chess Computer and the Factor of Mobility,'' Proceedings of the Symposium on Information Theory, London. Reprinted 1988 in [[Computer Chess Compendium]], pp. 113-117. Including the transcript of a discussion with [[Alan Turing]] and [[Jack Good]]
* [[Alan Turing]] ('''1953'''). '''''Chess'''''. part of the collection ''Digital Computers Applied to Games'', in [https://en.wikipedia.org/wiki/B._V._Bowden,_Baron_Bowden Bertram Vivian Bowden] (editor), [http://www.computinghistory.org.uk/cgi-bin/sitewise.pl?act=det&p=10719 Faster Than Thought], a symposium on digital computing machines, reprinted 1988 in [[Computer Chess Compendium]], reprinted 2004 in ''The Essential Turing'', [http://books.google.com/books?id=RSkxnKlv1D4C&lpg=PP882&ots=VOWmiIm_lD&dq=Turochamp%2C%20chess&pg=PP881#v=onepage&q&f=true google books]
==1960 ...==
* [https://en.wikipedia.org/wiki/Israel_Albert_Horowitz Israel Albert Horowitz], [https://en.wikipedia.org/wiki/Mott-Smith_Trophy Geoffrey Mott-Smith] ('''1960,1970,2012'''). ''[http://www.chess-game-strategies.com/point-count-chess.html Point Count Chess]''. [https://en.wikipedia.org/wiki/Samuel_Reshevsky Samuel Reshevsky] (Introduction), [[Sam Sloan]] (2012 Introduction), [http://www.amazon.com/Point-Count-Chess-Accurate-Winning/dp/4871874699/ref=sr_1_2?s=books&ie=UTF8&qid=1366734801&sr=1-2 Amazon] <ref>[https://www.stmintz.com/ccc/index.php?id=25046 Re: Books that help for evaluation] by [[Robert Hyatt]], [[CCC]], August 18, 1998</ref>
* [[Jack Good]] ('''1968'''). ''A Five-Year Plan for Automatic Chess.'' Machine Intelligence II pp. 110-115
==1970 ...==
* [[Ron Atkin]] ('''1972'''). ''Multi-Dimensional Structure in the Game of Chess''. In [http://www.interaction-design.org/references/periodicals/international_journal_of_man-machine_studies_volume_4.html International Journal of Man-Machine Studies, Vol. 4]
* [[Ron Atkin]], [[Ian H. Witten]] ('''1975'''). ''[http://www.bibsonomy.org/bibtex/2b91106ea980eb48aa505f6b54c130707/dblp A Multi-Dimensional Approach to Positional Chess]''. [http://www.interaction-design.org/references/periodicals/international_journal_of_man-machine_studies_volume_7.html International Journal of Man-Machine Studies, Vol. 7, No. 6]
* [[Gerard Zieliński]] ('''1976'''). ''[http://www.emeraldinsight.com/doi/abs/10.1108/eb005425 Simple Evaluation Function]''. [http://www.emeraldinsight.com/loi/k Kybernetes], Vol. 5, No. 3
* [[Ron Atkin]] ('''1977'''). ''Positional Play in Chess by Computer''. [[Advances in Computer Chess 1]]
* [[David Slate]], [[Larry Atkin]] ('''1977'''). ''CHESS 4.5 - The Northwestern University Chess Program.'' [[Chess Skill in Man and Machine]] (ed. [[Peter W. Frey]]), pp. 82-118. Springer-Verlag, New York, N.Y. 2nd ed. 1983. ISBN 0-387-90815-3. Reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[Hans Berliner]] ('''1979'''). ''[http://www.bkgm.com/articles/Berliner/EvaluationFunctionsLargeDomains/ On the Construction of Evaluation Functions for Large Domains]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/ijcai/index.html IJCAI 1979] Tokyo, Vol. 1, pp. 53-55.
==1980 ...==
* [[Helmut Horacek]] ('''1984'''). ''Some Conceptual Defects of Evaluation Functions''. [http://dl.acm.org/citation.cfm?id=537320 ECAI-84], [https://en.wikipedia.org/wiki/Pisa Pisa], [https://en.wikipedia.org/wiki/Elsevier Elsevier]
* [[Peter W. Frey]] ('''1985'''). ''An Empirical Technique for Developing Evaluation Functions''. [[ICGA Journal#8_1|ICCA Journal, Vol. 8, No. 1]]
* [[Tony Marsland]] ('''1985'''). ''Evaluation-Function Factors''. [[ICGA Journal#8_2|ICCA Journal, Vol. 8, No. 2]], [http://webdocs.cs.ualberta.ca/~tony/OldPapers/evaluation.pdf pdf]
* [[Jens Christensen]], [[Richard Korf]] ('''1986'''). ''A Unified Theory of Heuristic Evaluation functions and Its Applications to Learning.'' Proceedings of the [http://www.aaai.org/Conferences/AAAI/aaai86.php AAAI-86], pp. 148-152, [http://www.aaai.org/Papers/AAAI/1986/AAAI86-023.pdf pdf]
* [[Dap Hartmann]] ('''1987'''). ''How to Extract Relevant Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Dap Hartmann]] ('''1987'''). ''How to Extract Relevant Knowledge from Grandmaster Games. Part 2: the Notion of Mobility, and the Work of [[Adriaan de Groot|De Groot]] and [[Eliot Slater|Slater]]''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]
* [[Bruce Abramson]], [[Richard Korf]] ('''1987'''). ''A Model of Two-Player Evaluation Functions.'' [http://www.aaai.org/Conferences/AAAI/aaai87.php AAAI-87]. [http://www.aaai.org/Papers/AAAI/1987/AAAI87-016.pdf pdf]
* [[Kai-Fu Lee]], [[Sanjoy Mahajan]] ('''1988'''). ''[http://www.sciencedirect.com/science/article/pii/0004370288900768 A Pattern Classification Approach to Evaluation Function Learning]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 36, No. 1
* [[Dap Hartmann]] ('''1989'''). ''Notions of Evaluation Functions Tested against Grandmaster Games''. [[Advances in Computer Chess 5]]
* [[Maarten van der Meulen]] ('''1989'''). ''Weight Assessment in Evaluation Functions''. [[Advances in Computer Chess 5]]
* [[Bruce Abramson]] ('''1989'''). ''On Learning and Testing Evaluation Functions.'' Proceedings of the Sixth Israeli Conference on Artificial Intelligence, 1989, 7-16.
* [[Danny Kopec]], [[Ed Northam]], [[David Podber]], [[Yehya Fouda]] ('''1989'''). ''The Role of Connectivity in Chess''. [[WCCC 1989#Workshop|Workshop on New Directions in Game-Tree Search]], [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_24_C.pdf pdf]
==1990 ...==
* [[Bruce Abramson]] ('''1990'''). ''On Learning and Testing Evaluation Functions.'' Journal of Experimental and Theoretical Artificial Intelligence 2: 241-251.
* [[Ron Kalnim]] ('''1990'''). ''A Positional Assembly Model''. [[ICGA Journal#13_3|ICCA Journal, Vol. 13, No. 3]]
* [[Paul E. Utgoff]], [http://dblp.uni-trier.de/pers/hd/c/Clouse:Jeffery_A= Jeffery A. Clouse] ('''1991'''). ''[http://scholarworks.umass.edu/cs_faculty_pubs/193/ Two Kinds of Training Information for Evaluation Function Learning]''. [https://en.wikipedia.org/wiki/University_of_Massachusetts_Amherst University of Massachusetts, Amherst], Proceedings of the AAAI 1991
* [[Ingo Althöfer]] ('''1991'''). ''An Additive Evaluation Function in Chess.'' [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]]
* [[Ingo Althöfer]] ('''1993'''). ''On Telescoping Linear Evaluation Functions.'' [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]] <ref>[https://www.stmintz.com/ccc/index.php?id=475521 Re: Zappa Report] by [[Ingo Althöfer]], [[CCC]], December 30, 2005</ref>
* [[Alois Heinz]], [[Christoph Hense]] ('''1993'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.872 Bootstrap learning of α-β-evaluation functions]''. [http://dblp.uni-trier.de/db/conf/icci/icci1993.html#HeinzH93 ICCI 1993], [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.56.872&rep=rep1&type=pdf pdf]
* [[Alois Heinz]] ('''1994'''). ''[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.3994 Efficient Neural Net α-β-Evaluators]''. [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.55.3994&rep=rep1&type=pdf pdf] <ref>[https://www.stmintz.com/ccc/index.php?id=11893 Re: Evaluation by neural network ?] by [[Jay Scott]], [[CCC]], November 10, 1997</ref>
* [[Peter Mysliwietz]] ('''1994'''). ''Konstruktion und Optimierung von Bewertungsfunktionen beim Schach.'' Ph.D. Thesis (German)
* [[Don Beal]], [[Martin C. Smith]] ('''1994'''). ''Random Evaluations in Chess''. [[ICGA Journal#17_1|ICCA Journal, Vol. 17, No. 1]]
* [[Yaakov HaCohen-Kerner]] ('''1994'''). ''[http://www.springerlink.com/content/f5n27h25q4l920q8/ Case-Based Evaluation in Computer Chess]''. [http://www.informatik.uni-trier.de/~ley/db/conf/ewcbr/ewcbr1994.html#Kerner94 EWCBR 1994]
* [[Michael Buro]] ('''1995'''). ''[http://www.jair.org/papers/paper179.html Statistical Feature Combination for the Evaluation of Game Positions]''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 3
* [[Peter Mysliwietz]] ('''1997'''). ''A Metric for Evaluation Functions''. [[Advances in Computer Chess 8]]
* [[Michael Buro]] ('''1998'''). ''[http://link.springer.com/chapter/10.1007/3-540-48957-6_8 From Simple Features to Sophisticated Evaluation Functions]''. [[CG 1998]], [https://skatgame.net/mburo/ps/glem.pdf pdf]
==2000 ...==
* [[Dan Heisman]] ('''2003'''). ''Evaluation Criteria'', [http://www.chesscafe.com/text/heisman27.pdf pdf] from [https://en.wikipedia.org/wiki/ChessCafe.com ChessCafe.com]
* [[Jeff Rollason]] ('''2005'''). ''[http://www.aifactory.co.uk/newsletter/2005_03_hill-climbing.htm Evaluation by Hill-climbing: Getting the right move by solving micro-problems]''. [[AI Factory]], Autumn 2005 » [[Automated Tuning]]
* [[Shogo Takeuchi]], [[Tomoyuki Kaneko]], [[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2007'''). ''Visualization and Adjustment of Evaluation Functions Based on Evaluation Values and Win Probability''. [http://www.informatik.uni-trier.de/~ley/db/conf/aaai/aaai2007.html AAAI 2007]
* [[Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2008'''). ''Genetic Algorithms for Mentor-Assisted Evaluation Function Optimization'', ACM Genetic and Evolutionary Computation Conference ([http://www.sigevo.org/gecco-2008/ GECCO '08]), pp. 1469-1475, Atlanta, GA, July 2008.
* [[Omid David]], [[Jaap van den Herik]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2009'''). ''Simulating Human Grandmasters: Evolution and Coevolution of Evaluation Functions''. [[ACM]] Genetic and Evolutionary Computation Conference ([http://www.sigevo.org/gecco-2009/ GECCO '09]), pp. 1483 - 1489, Montreal, Canada, July 2009.
* [[Omid David]] ('''2009'''). ''Genetic Algorithms Based Learning for Evolving Intelligent Organisms''. Ph.D. Thesis.
==2010 ...==
* [[Lyudmil Tsvetkov]] ('''2010'''). ''Little Chess Evaluation Compendium''. [http://www.winboardengines.de/doc/LittleChessEvaluationCompendium-2010-04-07.pdf 2010 pdf]
* [[Omid David]], [[Moshe Koppel]], [[Nathan S. Netanyahu]] ('''2011'''). ''Expert-Driven Genetic Algorithms for Simulating Evaluation Functions''. Genetic Programming and Evolvable Machines, Vol. 12, No. 1, pp. 5--22, March 2011. » [[Genetic Programming]]
* [[Jeff Rollason]] ('''2011'''). ''[http://www.aifactory.co.uk/newsletter/2011_02_mcts_static.htm Mixing MCTS with Conventional Static Evaluation]''. [[AI Factory]], Winter 2011 » [[Monte-Carlo Tree Search]]
* [[Jeff Rollason]] ('''2012'''). ''[http://www.aifactory.co.uk/newsletter/2012_01_evaluation_options.htm Evaluation options - Overview of methods]''. [[AI Factory]], Summer 2012
* [[Lyudmil Tsvetkov]] ('''2012'''). ''An Addendum to a Little Chess Evaluation Compendium''. [http://www.winboardengines.de/doc/addendumlcec_2012.pdf Addendum June 2012 pdf], [[file:Addendum2LCEC_2012.pdf|Addendum 2 September 2012 pdf]], [[file:Addendum3LCEC_2012.pdf|Addendum 3 September 2012 pdf]], [http://www.winboardengines.de/doc/addendum4lcec_2012.pdf Addendum 4 November 2012 pdf], [[file:Addendum5LCEC_2012.pdf|Addendum 5 November 27, 2012 pdf]], [[file:Addendum6LCEC_2012.pdf|Addendum 6 December 03, 2012 pdf]]
* [[Lyudmil Tsvetkov]] ('''2012'''). ''Little Chess Evaluation Compendium''. [http://www.winboardengines.de/doc/LittleChessEvaluationCompendium.pdf July 2012 pdf] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=44265 An Update of the Addendum to the LittleCompendium] by [[Lyudmil Tsvetkov]], [[CCC]], July 02, 2012</ref>, [[file:LittleChessEvaluationCompendium.pdf|December 03, 2012 pdf]]
* [[Derek Farren]], [[Daniel Templeton]], [[Meiji Wang]] ('''2013'''). ''Analysis of Networks in Chess''. Team 23, [[Stanford University]], [http://snap.stanford.edu/class/cs224w-2013/projects2013/cs224w-023-final.pdf pdf]
==2015 ...==
* [[Nera Nesic]], [[Stephan Schiffel]] ('''2016'''). ''Heuristic Function Evaluation Framework''. [[CG 2016]]
* [[Lyudmil Tsvetkov]] ('''2017'''). ''[http://www.secretofchess.com/ The Secret of Chess]''. [https://www.amazon.com/Secret-Chess-Lyudmil-Tsvetkov-ebook/dp/B074M85CVV amazon] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=64776 The Secret of Chess] by [[Lyudmil Tsvetkov]], [[CCC]], August 01, 2017</ref>
* [[Lyudmil Tsvetkov]] ('''2017'''). ''Pawns''. [https://www.amazon.com/Pawns-Lyudmil-Tsvetkov-ebook/dp/B074S2MYQV amazon]
=Blog & Forum Posts=
==1993 ...==
* [https://groups.google.com/d/msg/rec.games.chess/J9Pkg9lOpig/tBN5dVRATwsJ Cray Blitz Evaluation] by [[Robert Hyatt]], [[Computer Chess Forums|rgc]], March 05, 1993 » [[Cray Blitz]]
* [https://groups.google.com/d/msg/rec.games.chess/6vwtkcF6sRU/4M3oOiDNYwgJ Mobility Measure: Proposed Algorithm] by Dietrich Kappe, [[Computer Chess Forums|rgc]], September 23, 1993 » [[Mobility]]
* [https://groups.google.com/d/msg/rec.games.chess/M4CKCmqDNkI/TjVJEQY0GC0J bitboard position evaluations] by [[Robert Hyatt]], [[Computer Chess Forums|rgc]], November 17, 1994 » [[Bitboards]]
==1995 ...==
* [https://groups.google.com/d/msg/rec.games.chess/efBhsZU3J1g/fC7rxV5yuycJ Value of the pieces] by Joost de Heer, [[Computer Chess Forums|rgc]], February 01, 1995
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/4f54813edf18fdcc Evaluation function diminishing returns] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], February 1, 1997
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/40fe48d492e582bd Evaluation function question] by [[David Fotland|Dave Fotland]], [[Computer Chess Forums|rgcc]], February 07, 1997
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/99eec6923b0481db computer chess "oracle" ideas...] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], April 01, 1997 » [[Oracle]]
* [https://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/77f10f072e907302 Evolutionary Evaluation] by [[Dan Homan]], [[Computer Chess Forums|rgcc]], September 09, 1997 » [[Automated Tuning]]
* [https://www.stmintz.com/ccc/index.php?id=25012 Books that help for evaluation] by [[Guido Schimmels]], [[CCC]], August 18, 1998
* [https://www.stmintz.com/ccc/index.php?id=80569 Static evaluation after the "Positional/Real Sacrifice"] by [[Andrew Williams]], [[CCC]], December 03, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=289154 Adding knowledge to the evaluation, what am I doing wrong?] by [[Albert Bertilsson]], [[CCC]], March 13, 2003
* [https://www.stmintz.com/ccc/index.php?id=293815 testing of evaluation function] by Steven Chu, [[CCC]], April 17, 2003 » [[Engine Testing]]
* [https://www.stmintz.com/ccc/index.php?id=328924 Question about evaluation and branch factor] by [[Marcus Prewarski]], [[CCC]], November 20, 2003 » [[Branching Factor]]
* [https://www.stmintz.com/ccc/index.php?id=350516 STATIC EVAL TEST (provisional)] by [[Jaime Benito de Valle Ruiz]], [[CCC]], February 21, 2004 » [[Test-Positions]]
==2005 ...==
* [https://www.stmintz.com/ccc/index.php?id=475521 Re: Zappa Report] by [[Ingo Althöfer]], [[CCC]], December 30, 2005
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4155#p21292 Do you evaluate internal nodes?] by [[Tord Romstad]], [[Computer Chess Forums|Winboard Forum]], January 16, 2006 » [[Interior Node]]
* [http://www.talkchess.com/forum/viewtopic.php?t=13969 question about symmertic evaluation] by [[Uri Blass]], [[CCC]], May 23, 2007
* [http://www.hiarcs.net/forums/viewtopic.php?t=402 Search or Evaluation?] by [[Ed Schroder|Ed Schröder]], [[Computer Chess Forums|Hiarcs Forum]], October 05, 2007 » [[Knowledge#SearchVersusEvaluation|Search versus Evaluation]], [[Search]]
: [http://www.hiarcs.net/forums/viewtopic.php?p=2944 Re: Search or Evaluation?] by [[Mark Uniacke]], [[Computer Chess Forums|Hiarcs Forum]], October 14, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=22817 Evaluation functions. Why integer?] by oysteijo, [[CCC]], August 06, 2008 » [[Float]], [[Score]]
* [http://www.talkchess.com/forum/viewtopic.php?t=25795 Evaluating every node?] by [[Gregory Strong]], [[CCC]], January 03, 2009
* [http://www.talkchess.com/forum/viewtopic.php?t=27299 Eval Dilemma] by [[Edsel Apostol]], [[CCC]], April 03, 2009
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=288424 Linear vs. Nonlinear Evalulation] by [[Gerd Isenberg]], [[CCC]], August 26, 2009
* [http://www.talkchess.com/forum/viewtopic.php?p=291259 Threat information from evaluation to inform q-search] by [[Gary Linscott|Gary]], [[CCC]], September 15, 2009 » [[Quiescence Search]]
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=32396 Correcting Evaluation with the hash table] by [[Mark Lefler]], [[CCC]], February 05, 2010
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=362888&t=35455 Re: Questions for the Stockfish team] by [[Milos Stanisavljevic]], [[CCC]], July 20, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=36104 Most important eval elements] by [[Tom King]], [[CCC]], September 17, 2010
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=374967&t=36421 Re: 100 long games Rybka 4 vs Houdini 1.03a] by [[Tord Romstad]], [[CCC]], November 02, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=37191 dynamically modified evaluation function] by [[Don Dailey]], [[CCC]], December 20, 2010
'''2011'''
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=22785 Suppose Rybka used Fruits evaluations] by [[Søren Riis|SR]], [[Computer Chess Forums|Rybka Forum]], August 29, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=41621 writing an evaluation function] by Pierre Bokma, [[CCC]], December 27, 2011
'''2012'''
* [http://www.talkchess.com/forum/viewtopic.php?t=42806 The evaluation value and value returned by minimax search] by [[Chao Ma]], [[CCC]], March 09, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=43385 Multi dimensional score] by [[Nicu Ionita]], [[CCC]], April 20, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=43386 Bi dimensional static evaluation] by [[Nicu Ionita]], [[CCC]], April 20, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=43387 Theorem proving positional evaluation] by [[Nicu Ionita]], [[CCC]], April 20, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=43545 log(w/b) instead of w-b?] by [[Gerd Isenberg]], [[CCC]], May 02, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=44014 The value of an evaluation function] by [[Ed Schroder|Ed Schröder]], [[CCC]], June 11, 2012
'''2013'''
* [http://www.talkchess.com/forum/viewtopic.php?t=46879 eval scale in Houdini] by [[Rein Halbersma]], [[CCC]], January 14, 2013 » [[Houdini]]
* [http://www.talkchess.com/forum/viewtopic.php?t=46993 An idea of how to make your engine play more rational chess] by [[Pio Korinth]], [[CCC]], January 25, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=48252 A Materialless Evaluation?] by [[Thomas Kolarik]], [[CCC]], June 12, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=48644 A different way of summing evaluation features] by [[Pio Korinth]], [[CCC]], July 14, 2013 <ref>[https://en.wikipedia.org/wiki/Euclidean_distance Euclidean distance from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Principal_component_analysis Principal component analysis from Wikipedia]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=49190 Improve the search or the evaluation?] by [[Jens Bæk Nielsen]], [[CCC]], August 31, 2013 » [[Knowledge#SearchVersusEvaluation|Search versus Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49421 Multiple EVAL] by [[Ed Schroder]], [[CCC]], September 22, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=50472 floating point SSE eval] by [[Marco Belli]], [[CCC]], December 13, 2013 » [[Float]], [[Score]]
'''2014'''
* [http://www.talkchess.com/forum/viewtopic.php?t=51012 5 underestimated evaluation rules] by [[Lyudmil Tsvetkov]], [[CCC]], January 23, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=51811 Thoughs on eval terms] by [[Fermin Serrano]], [[CCC]], March 31, 2014
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=55355 Value of a Feature or Heuristic] by [[Jonathan Rosenthal]], [[CCC]], February 15, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=55897 Couple more ideas] by [[Lyudmil Tsvetkov]], [[CCC]], April 05, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=55955 Most common/top evaluation features?] by [[Alexandru Mosoi]], [[CCC]], April 10, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=56690 eval pieces] by [[Daniel Anulliero]], [[CCC]], June 15, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=57022 * vs +] by [[Stefano Gemma]], [[CCC]], July 19, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=57087 (E)valuation (F)or (S)tarters] by [[Ed Schroder|Ed Schröder]], [[CCC]], July 26, 2015
'''2016'''
* [http://www.talkchess.com/forum/viewtopic.php?t=59091 Non-linear eval terms] by [[J. Wesley Cleveland]], [[CCC]], January 29, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=59570 A bizarre evaluation] by [[Larry Kaufman]], [[CCC]], March 20, 2016
* [http://int8.io/chess-position-evaluation-with-convolutional-neural-networks-in-julia/ Chess position evaluation with convolutional neural network in Julia] by [[Kamil Czarnogorski]], [http://int8.io/ Machine learning with Julia and python], April 02, 2016 » [[Deep Learning]], [[Neural Networks]]
* [http://www.talkchess.com/forum/viewtopic.php?t=61064 Calculating space] by [[Shawn Chidester]], [[CCC]], August 07, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=61236 Evaluation values help] by [[Laurie Tunnicliffe]], [[CCC]], August 26, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=61861 A database for learning evaluation functions] by [[Álvaro Begué]], [[CCC]], October 28, 2016 » [[Automated Tuning]], [[Learning]], [[Texel's Tuning Method]]
* [http://www.talkchess.com/forum/viewtopic.php?t=61875 Evaluation doubt] by [[Fabio Gobbato]], [[CCC]], October 29, 2016
'''2017'''
* [http://www.talkchess.com/forum/viewtopic.php?t=63181 Bayesian Evaluation Functions] by [[Jonathan Rosenthal]], [[CCC]], February 15, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=63408 improved evaluation function] by [[Alexandru Mosoi]], [[CCC]], March 11, 2017 » [[Texel's Tuning Method]], [[Zurichess]]
* [http://www.talkchess.com/forum/viewtopic.php?t=63803 random evaluation perturbation factor] by [[Stuart Cracraft]], [[CCC]], April 24, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=63863 horrid positional play in a solid tactical searcher] by [[Stuart Cracraft]], [[CCC]], April 29, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=64041 Another attempt at comparing Evals ELO-wise] by [[Kai Laskos]], [[CCC]], May 22, 2017 » [[Playing Strength]]
* [http://www.talkchess.com/forum/viewtopic.php?t=64230 static eval in every node?] by [[Erin Dame]], [[CCC]], June 09, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=65403 comparing between search or evaluation] by [[Uri Blass]], [[CCC]], October 09, 2017» [[Search]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65715 Neural networks for chess position evaluation- request] by [[Kamil Czarnogorski]], [[CCC]], November 13, 2017 » [[Deep Learning]], [[Neural Networks]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65829 AlphaGo's evaluation function] by Jens Kipper, [[CCC]], November 26, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=65946 Logarithmic Patterns In Evaluations] by [[Dennis Sceviour]], [[CCC]], December 09, 2017
'''2018'''
* [http://www.talkchess.com/forum/viewtopic.php?t=66413 replace the evaluation by playing against yourself] by [[Uri Blass]], [[CCC]], January 25, 2018 » [[Fortress]]
=External Links=
==Mathematical Foundations==
* [https://en.wikipedia.org/wiki/Heuristic_(computer_science) Heuristic from Wikipedia]
* [https://en.wikipedia.org/wiki/Linear_combination Linear combination from Wikipedia]
* [https://en.wikipedia.org/wiki/Linear_independence Linear independence from Wikipedia]
* [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]
* [https://hxim.github.io/Stockfish-Evaluation-Guide/ Stockfish Evaluation Guide] » [[Stockfish#EvaluationGuide|Stockfish Evaluation Guide]]
* [http://www.top-5000.nl/authors/rebel/chess840.htm#HW Evaluation in REBEL] by [[Ed Schroder|Ed Schröder]] » [[Rebel]]
* [http://www.top-5000.nl/eval.htm The value of an evaluation function] by [[Ed Schroder|Ed Schröder]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=44014 The value of an evaluation function] by [[Ed Schroder|Ed Schröder]], [[CCC]], June 11, 2012</ref>
* [http://rebel13.nl/efs/index.html Rebel - The EFS project] from [http://rebel13.nl/index.html Rebel Pure Nostalgica] by [[Ed Schroder|Ed Schröder]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57087 (E)valuation (F)or (S)tarters] by [[Ed Schroder|Ed Schröder]], [[CCC]], July 26, 2015</ref>
* [http://home.hccnet.nl/h.g.muller/eval.html Evaluation: Basics] of [[Micro-Max]] by [[Harm Geert Muller]]
* [http://www.gamedev.net/page/resources/_/technical/artificial-intelligence/chess-programming-part-vi-evaluation-functions-r1208 Chess Programming Part VI: Evaluation Functions] by [[François-Dominic Laramée]], [https://en.wikipedia.org/wiki/GameDev.net gamedev.net], October 2000
* [http://www.chessbin.com/post/Chess-Board-Evaluation.aspx Chess Board Evaluation] by [[Adam Berent]]
* [http://www.chessvariants.com/d.betza/pieceval/index.html About the Values of Chess Pieces] by [[Ralph Betza]]
=References=
<references />
'''[[Main Page|Up one level]]'''
[[Category:Wassily Kandinsky]]
