Botvinnik-Markoff Extension
Revision as of 22:06, 27 April 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * Search * Selectivity * Extensions * Botvinnik-Markoff Extension''' The '''Botvinnik-Markoff Extension''' is an extension proposed by Ser...")
Home * Search * Selectivity * Extensions * Botvinnik-Markoff Extension
The Botvinnik-Markoff Extension is an extension proposed by Sergei Markoff [1], inspired by Mikhail Botvinnik's work and publications on the program Pioneer, for instance to determine attack/defense targets for further analysis of attack/defense trajectories [2]. The extension is based on the threat move detection in null move pruning. If the 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
Forum Posts
- Markoff - Botvinnik - Kaissa - Hsu - ABC - Berliner by Walter Faxon, CCC, June 09, 2003
- The "same threat extension" as effective way to resolve horizon problem by Sergei Markoff, CCC, October 01, 2003, introducing the extension
- Test match with the Botvinnik-Markoff extension by Tord Romstad, CCC, October 02, 2003
- What is Botvinnik-Markov extension? by Maurizio Monge, CCC, October 26, 2005
- Botvinnik Markov revisited by Don Dailey, CCC , Jun 24, 2010
References
- ↑ The "same threat extension" as effective way to resolve horizon problem by Sergei Markoff, CCC, October 01, 2003
- ↑ Mikhail Botvinnik (1982). Decision Making and Computers. Advances in Computer Chess 3
