Changes

Giraffe's [[Evaluation functionFunction|evaluation function]] is a [[Neural Networks#Deep|deep neural network]] trained by [[Temporal Difference Learning#TDLeaf|TDLeaf]] <ref>[[Jonathan Baxter]], [[Andrew Tridgell]], [[Lex Weaver]] ('''1998'''). ''TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search''. [https://www.chatbots.org/journal/australian_journal_of_intelligent_information_processing_systems/ Australian Journal of Intelligent Information Processing Systems], Vol. 5 No. 1, [http://arxiv.org/abs/cs/9901001 arXiv:cs/9901001]</ref> . Its feature representation includes a map of [[Static Exchange Evaluation|static exchange evaluations]] for all squares and sides <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57045 SEE Map] by [[Matthew Lai]], [[CCC]], July 20, 2015</ref> , a structure already proposed by [[Russell M. Church]] and [[Kenneth W. Church]] in ''Plans, Goals, and Search Strategies for the Selection of a Move in Chess'' <ref>[[Russell M. Church]], [[Kenneth W. Church]] ('''1977'''). ''Plans, Goals, and Search Strategies for the Selection of a Move in Chess''. [[Chess Skill in Man and Machine]]</ref> . Probability-based evaluation [[Score|scores]] are not in [[Centipawns|centipawns]] nor linear to [[Material|material]] , and span a +-10,000 range, with [[Checkmate#MateScore|mate scores]] of +- 30,000. The [[Search|search]] recently changed from traditional depth-based [[Iterative Deepening|iterative deepening]] to assigning number of nodes (or time) to child nodes <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57092 Time assignment to children] by [[Matthew Lai]], [[CCC]], July 26, 2015</ref> . Node budget allocation will also become [[Neural Networks|neural network]] based.