25,161
edits
Changes
Created page with "'''Home * Search * Selectivity * Extensions * Botvinnik-Markoff Extension''' The '''Botvinnik-Markoff Extension''' is an extension proposed by Ser..."
'''[[Main Page|Home]] * [[Search]] * [[Selectivity]] * [[Extensions]] * Botvinnik-Markoff Extension'''
The '''Botvinnik-Markoff Extension''' is an extension proposed by [[Sergei Markoff]] <ref>[https://www.stmintz.com/ccc/index.php?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003</ref>, inspired by [[Mikhail Botvinnik|Mikhail Botvinnik's]] work and publications on the program [[Pioneer]], for instance to determine attack/defense targets for further analysis of attack/defense [[Trajectory|trajectories]] <ref>[[Mikhail Botvinnik]] ('''1982'''). ''Decision Making and Computers.'' [[Advances in Computer Chess 3]]</ref>. The extension is based on the [[Null Move Pruning#ThreatDetection|threat move detection]] in [[Null Move Pruning|null move pruning]]. If the [[Threat Move|threat move]] is the same on two consecutive plies (with one ply in between them to account for the side to move), the threat move is a serious one and the search is extended.
=See also=
* [[Mate Threat Extensions]]
* [[Null Move Pruning#ThreatDetection|Threat Detection]]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=299987 Markoff - Botvinnik - Kaissa - Hsu - ABC - Berliner] by [[Walter Faxon]], [[CCC]], June 09, 2003
* [https://www.stmintz.com/ccc/index.php?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003, introducing the extension
* [https://www.stmintz.com/ccc/index.php?id=318987 Test match with the Botvinnik-Markoff extension] by [[Tord Romstad]], [[CCC]], October 02, 2003
* [https://www.stmintz.com/ccc/index.php?id=457918 What is Botvinnik-Markov extension?] by [[Maurizio Monge]], [[CCC]], October 26, 2005
* [http://www.talkchess.com/forum/viewtopic.php?t=35124 Botvinnik Markov revisited] by [[Don Dailey]], [[CCC]] , Jun 24, 2010
=References=
<references />
'''[[Extensions|Up one level]]'''
The '''Botvinnik-Markoff Extension''' is an extension proposed by [[Sergei Markoff]] <ref>[https://www.stmintz.com/ccc/index.php?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003</ref>, inspired by [[Mikhail Botvinnik|Mikhail Botvinnik's]] work and publications on the program [[Pioneer]], for instance to determine attack/defense targets for further analysis of attack/defense [[Trajectory|trajectories]] <ref>[[Mikhail Botvinnik]] ('''1982'''). ''Decision Making and Computers.'' [[Advances in Computer Chess 3]]</ref>. The extension is based on the [[Null Move Pruning#ThreatDetection|threat move detection]] in [[Null Move Pruning|null move pruning]]. If the [[Threat Move|threat move]] is the same on two consecutive plies (with one ply in between them to account for the side to move), the threat move is a serious one and the search is extended.
=See also=
* [[Mate Threat Extensions]]
* [[Null Move Pruning#ThreatDetection|Threat Detection]]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=299987 Markoff - Botvinnik - Kaissa - Hsu - ABC - Berliner] by [[Walter Faxon]], [[CCC]], June 09, 2003
* [https://www.stmintz.com/ccc/index.php?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003, introducing the extension
* [https://www.stmintz.com/ccc/index.php?id=318987 Test match with the Botvinnik-Markoff extension] by [[Tord Romstad]], [[CCC]], October 02, 2003
* [https://www.stmintz.com/ccc/index.php?id=457918 What is Botvinnik-Markov extension?] by [[Maurizio Monge]], [[CCC]], October 26, 2005
* [http://www.talkchess.com/forum/viewtopic.php?t=35124 Botvinnik Markov revisited] by [[Don Dailey]], [[CCC]] , Jun 24, 2010
=References=
<references />
'''[[Extensions|Up one level]]'''
