Changes

Jump to: navigation, search

Lazy Evaluation

609 bytes removed, 22:46, 15 November 2019
no edit summary
'''[[Main Page|Home]] * [[Evaluation]] * Lazy Evaluation'''
[[FILE:Naturgeschichte und Abbildungen der Reptilien (6059239621)Kley Kränzchen.jpg|border|right|thumb|[[https://en.wikipedia.org/wiki/Chameleon ChameleonsCategory:Heinrich Kley|Heinrich Kley]] - Das Kränzchen <ref> [https://en.wikipedia.org/wiki/Chameleon Chameleons], [https://commons.wikimedia.org/wiki/FileCategory:Naturgeschichte_und_Abbildungen_der_Reptilien_(6059239621).jpg Plate 99Heinrich Kley|Heinrich Kley]] from [https://en.wikipedia- Das Kränzchen.org/wiki/Heinrich_Rudolf_Schinz Heinrich Rudolf Schinz] Federzeichnung ('''1833'''). ''Naturgeschichte und Abbildungen der Reptilien''. lithograph by [httpsaus://en.wikipedia.org/wiki/Karl_Joseph_Brodtmann Karl Joseph Brodtmann]Skizzenbuch I, [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons]1909)</ref> ]]
 In the chess programming sense of the phrase <ref>In general computer programming, [https://en.wikipedia.org/wiki/Lazy_evaluation Lazy evaluation] refers a technique of delaying a computation until the result is required.</ref>, '''Lazy Evaluation''' means dividing all the tasks performed by [[Evaluation functionFunction|evaluation function]] in (usually two) stages. If after performing all the tasks for a given stage score exceeds [[Beta|beta]] by a certain margin or if it falls below [[Alpha|alpha]] by the same margin, the score is returned and no more evaluation is conducted. The first stage usually consists of the evaluation terms that are relatively cheap, possibly [[Incremental Updates|incrementally updated]], like [[Material|material]] and [[Piece-Square Tables|piece-square tables]]. Lazy evaluation may be viewed as taking the [[Alpha-Beta|alpha-beta]] principle one step further. If some parts of the evaluation function are omitted due to this heuristics, it means that one side is already winning "the evaluation game" by the margin unacceptable to the opponent, and therefore a cutoff occurs.
=See also=
=External Links=
* [http://www.top-5000.nl/authors/rebel/chess840.htm#LAZY%20EVAL Search Techniques in REBEL (Lazy Eval)] from [http://www.top-5000.nl/authors/rebel/chess840.htm How Rebel Plays Chess] by [[Ed Schroder|Ed Schröder]] » [[Incremental Updates]], [[Rebel]]
* [http://macechess.blogspot.de/2014/06/not-being-lazy-anymore.html Not being lazy anymore ] by [[Thomas Petzke]], [http://macechess.blogspot.de/ mACE Chess], June 28, 2014 » [[iCE]]
* [https://en.wikipedia.org/wiki/Lazy_evaluation Lazy evaluation from Wikipedia] as general programming term
* [[Videos#DeepPurple:Category:Deep Purple|Deep Purple]] - [https://en.wikipedia.org/wiki/Lazy_%28Deep_Purple_song%29 Lazy] ([https://www.setlist.fm/setlist/deep-purple/1984/sydney-entertainment-centre-sydney-australia-4bde3f66.html Sydney 1984]), [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=iFSKvWICseQ|alignment=left|valignment=top}}
'''[[Evaluation|Up one Level]]'''
[[Category:Heinrich Kley]]
[[Category:Deep Purple]]

Navigation menu