25,161
edits
Changes
Created page with "'''Home * Knowledge * Interior Node Recognizer''' FILE:Circle_Limit_IV.jpg|border|right|thumb|310px|link=http://www.mcescher.com/Gallery/recogn-bmp/LW436...."
'''[[Main Page|Home]] * [[Knowledge]] * Interior Node Recognizer'''
[[FILE:Circle_Limit_IV.jpg|border|right|thumb|310px|link=http://www.mcescher.com/Gallery/recogn-bmp/LW436.jpg|[[Arts#Escher|M. C. Escher]], Circle Limit IV, 1960 <ref>[http://www.mcescher.com/Gallery/gallery-recogn.htm Picture gallery "Recognition and Success 1955 - 1972"] from [http://www.mcescher.com/ The Official M.C. Escher Website]</ref> ]]
'''Interior Node recognizers''',<br/>
[[Evaluation|evaluation]] like functions called from within a [[Node|node]] in order to avoid unnecessary searches if perfect knowledge is available, either to [[Pruning|prune]] or narrow the [[Bound|bounds]] at [[Interior Node|interior nodes]]. Most of the time result replacing search is obtained from [[Endgame Tablebases|endgame tablebases]], generated by [[Retrograde Analysis|retrograde analysis]], but this may well be replaced by code detecting certain characteristics of the position. A trivial example of such a heuristic (restricted to detecting [[Draw|draws]]) may be found on a page devoted to [[KPK]] endings. Other examples are positions with known draws, such as lone K vs lone K, K+B vs K or K+N vs K.
Implementation of this technique requires a [[Legal Move#LegalityTest|legality check]] (even in the most basic example, claiming draw when there are only kings on the board, a buggy code may encourage going into this ending by the means of the illegal capture) or a legal [[Move Generation|move generator]]. In general, if a recognizer is based on a remaining [[Material|material]], special care must be taken to avoid the possibility of a [[Stalemate|stalemate]] and whether hanging pieces may be captured - for instance if the lonesome king in KBNK may capture either the bishop or knight. [[Score]] obtained from interior node recognizers may be treated as if it came from the probe of a [[Transposition Table|transposition table]], so they ought to be called near to it. In order to make recognizer results compatible with the results of probes from the transposition tables, they are composed from bound and score information.
=Score Type=
* [[Exact Score]]
* [[Lower Bound]]
* [[Upper Bound]]
* '''Fail Bound''' for unsuccessful recognition
=See also=
* [[Blockage Detection]]
* [[CPW-Engine_recognize|CPW-Engine Recognizer]]
* [[Draw]]
* [[Draw Evaluation]]
* [[Score#DrawScore|Draw Scores]]
* [[Material#InsufficientMaterial|Insufficient Material]]
* [[Material Hash Table]]
* [[Score#ValueRange|Score | Value Range]]
=Publications=
* [[David Slate]] ('''1984'''). ''Interior-node Score Bounds in a Brute-force Chess Program.'' [[ICGA Journal#7_4|ICCA Journal, Vol. 7, No. 4]]
* [[Ernst A. Heinz]] ('''1998'''). ''[http://people.csail.mit.edu/heinz/dt/node33.html Efficient Interior-Node Recognition]''. [[ICGA Journal#21_3|ICCA Journal, Vol. 21, No. 3]]
=Forum Posts=
* [http://www.talkchess.com/forum/viewtopic.php?t=14366 Help Finding X] by [[Mark Lefler]], [[CCC]], June 08, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=48826 Best was to Recognize Know Endgames?] by [[Steve Maughan]], [[CCC]], August 03, 2013
: [http://www.talkchess.com/forum/viewtopic.php?t=48826&start=22 Re: Best was to Recognize Know Endgames?] by [[Harm Geert Muller]], [[CCC]], August 03, 2013 » [[KBNK Endgame]]
=References=
<references />
'''[[Knowledge|Up one Level]]'''
[[Category:M. C. Escher]]
[[FILE:Circle_Limit_IV.jpg|border|right|thumb|310px|link=http://www.mcescher.com/Gallery/recogn-bmp/LW436.jpg|[[Arts#Escher|M. C. Escher]], Circle Limit IV, 1960 <ref>[http://www.mcescher.com/Gallery/gallery-recogn.htm Picture gallery "Recognition and Success 1955 - 1972"] from [http://www.mcescher.com/ The Official M.C. Escher Website]</ref> ]]
'''Interior Node recognizers''',<br/>
[[Evaluation|evaluation]] like functions called from within a [[Node|node]] in order to avoid unnecessary searches if perfect knowledge is available, either to [[Pruning|prune]] or narrow the [[Bound|bounds]] at [[Interior Node|interior nodes]]. Most of the time result replacing search is obtained from [[Endgame Tablebases|endgame tablebases]], generated by [[Retrograde Analysis|retrograde analysis]], but this may well be replaced by code detecting certain characteristics of the position. A trivial example of such a heuristic (restricted to detecting [[Draw|draws]]) may be found on a page devoted to [[KPK]] endings. Other examples are positions with known draws, such as lone K vs lone K, K+B vs K or K+N vs K.
Implementation of this technique requires a [[Legal Move#LegalityTest|legality check]] (even in the most basic example, claiming draw when there are only kings on the board, a buggy code may encourage going into this ending by the means of the illegal capture) or a legal [[Move Generation|move generator]]. In general, if a recognizer is based on a remaining [[Material|material]], special care must be taken to avoid the possibility of a [[Stalemate|stalemate]] and whether hanging pieces may be captured - for instance if the lonesome king in KBNK may capture either the bishop or knight. [[Score]] obtained from interior node recognizers may be treated as if it came from the probe of a [[Transposition Table|transposition table]], so they ought to be called near to it. In order to make recognizer results compatible with the results of probes from the transposition tables, they are composed from bound and score information.
=Score Type=
* [[Exact Score]]
* [[Lower Bound]]
* [[Upper Bound]]
* '''Fail Bound''' for unsuccessful recognition
=See also=
* [[Blockage Detection]]
* [[CPW-Engine_recognize|CPW-Engine Recognizer]]
* [[Draw]]
* [[Draw Evaluation]]
* [[Score#DrawScore|Draw Scores]]
* [[Material#InsufficientMaterial|Insufficient Material]]
* [[Material Hash Table]]
* [[Score#ValueRange|Score | Value Range]]
=Publications=
* [[David Slate]] ('''1984'''). ''Interior-node Score Bounds in a Brute-force Chess Program.'' [[ICGA Journal#7_4|ICCA Journal, Vol. 7, No. 4]]
* [[Ernst A. Heinz]] ('''1998'''). ''[http://people.csail.mit.edu/heinz/dt/node33.html Efficient Interior-Node Recognition]''. [[ICGA Journal#21_3|ICCA Journal, Vol. 21, No. 3]]
=Forum Posts=
* [http://www.talkchess.com/forum/viewtopic.php?t=14366 Help Finding X] by [[Mark Lefler]], [[CCC]], June 08, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=48826 Best was to Recognize Know Endgames?] by [[Steve Maughan]], [[CCC]], August 03, 2013
: [http://www.talkchess.com/forum/viewtopic.php?t=48826&start=22 Re: Best was to Recognize Know Endgames?] by [[Harm Geert Muller]], [[CCC]], August 03, 2013 » [[KBNK Endgame]]
=References=
<references />
'''[[Knowledge|Up one Level]]'''
[[Category:M. C. Escher]]
