Changes

Jump to: navigation, search

Mate at a Glance

341 bytes added, 16:12, 25 December 2020
no edit summary
'''[[Main Page|Home]] * [[Evaluation]] * [[King Safety]] * Mate at a Glance'''
[[FILE:Xeque-mate.jpg|border|right|thumb|link=https://sites.google.com/site/caroluschess/famous-people/artists/maria-helena-vieira-da-silva|[[Arts#daSilva:Category:Maria Helena Vieira da Silva|Maria Helena Vieira da Silva]] - Xeque Mate, 1949 <ref>[https://sites.google.com/site/caroluschess/famous-people/artists/maria-helena-vieira-da-silva Maria Helena Vieira da Silva - Carolus Chess]</ref> ]]
'''Mate at a Glance''',<br/>
an attempt to detect positions statically in [[Evaluation|evaluation]], where one side (not necessarily the [[Side to move|side to move]]) has a [[Legal Move|legal move]] to [[Checkmate|checkmate]] its opponent [[King|king]]. This is either a direct mate for the side to move or a mate threat, where one needs to defend accordantly rather than to [[Quiescence Search#StandPat|stand pat]] at a [[Quiescent Node|quiescent node]].
''Mate at a Glance'' was introduced in 1978 by [[John Birmingham]] and [[Peter Kent]] at [[Advances in Computer Chess 2]], as implemented in their ''Minimax algorithm Tester [[Master]]'', and published 1980 in the conference proceedings <ref>[[John Birmingham]] and , [[Peter Kent]] ('''1980'''). ''Mate at a Glance.'' [[Advances in Computer Chess 2]], reprinted in [[Computer Chess Compendium]]</ref>. Some mate pattern were implemented in various programs, as known for instance from [[Rebel]] <ref>[https://www.stmintz.com/ccc/index.php?id=209405 Re: Static Mate Detection] by [[Ed Schroder|Ed Schröder]], [[CCC]], January 23, 2002</ref>, [[Chess System Tal]] <ref>[https://www.stmintz.com/ccc/index.php?id=12822 move count frequency] by [[Chris Whittington]], [[CCC]], December, 08, 1997</ref>, [[XiniX]] and [[IsiChess]] <ref>[https://www.stmintz.com/ccc/index.php?id=209201 Static Mate Detection] by [[Gerd Isenberg]], [[CCC]], January 22, 2002</ref> . Some programmers apply ''Mate at a Glance'' only for cheap and simple cases which occur frequently, like obvious [https://en.wikipedia.org/wiki/Back_rank_checkmate back rank mates], some close mates with the [[Queen|queen]], and possibly mates with [[Knight|knight]] like the [https://en.wikipedia.org/wiki/Smothered_mate smothered mate]. A few programmers apply more general, but also likely more complicated and error-prone pattern.
=Is it worth?=
=Selected Publications=
* [[John Birmingham]] and , [[Peter Kent]] <ref>In the ICGA Database John Birmingham is mentioned as sole author</ref> ('''1980'''). ''Mate at a Glance.'' [[Advances in Computer Chess 2]], reprinted in [[Computer Chess Compendium]]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=209201 Static Mate Detection] by [[Gerd Isenberg]], [[CCC]], January 22, 2002
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=49676 Ptterns] by [[Manuel Peña]], [[Computer Chess Forums|Winboard Forum]], November 20, 2008
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=64460 Algorithm for mate recognition] by Fulvio, [[CCC]], June 30, 2017
=External Links=
=References=
<references />
 
'''[[King Safety|Up one Level]]'''
[[Category:Maria Helena Vieira da Silva]]

Navigation menu