Mark James Watkins,
an American mathematician affiliated with the School of Mathematics and Statistics [1], University of Sydney, and member of its Computational Algebra Group[2]. In computer chess forums, Mark Watkins is well known under the pseudonym "BB+" as an expert poster and publisher of recognized papers concerning the Rybkacontroversies (both Ippolit and then Fruit). In February 2011, Mark Watkins disbanded his anonymity when involved in the ICGA Investigations regarding Fruit and Rybka.
Since late 2011 Mark Watkins worked on his long-term goal to weakly solve the game of Losing Chess, presumably by showing that 1. e3 wins for White. As of summer 2014 [4], leaving b6 and c5 as the remaining Black responses [5], all other responses to 1.e3 are indeed White wins, along with earlier work done by Ben Nye and others, as demonstrated by Proof-Number Search combined with Endgame Tablebases. On February 02, 2015, 1. e3 c5 was announced solved, on October 10, 2016, 1. e3 b6, proving 1.e3 wins [6].
an American mathematician affiliated with the School of Mathematics and Statistics [1], University of Sydney, and member of its Computational Algebra Group [2]. In computer chess forums, Mark Watkins is well known under the pseudonym "BB+" as an expert poster and publisher of recognized papers concerning the Rybka controversies (both Ippolit and then Fruit). In February 2011, Mark Watkins disbanded his anonymity when involved in the ICGA Investigations regarding Fruit and Rybka.
Table of Contents
Solving Losing Chess
Since late 2011 Mark Watkins worked on his long-term goal to weakly solve the game of Losing Chess, presumably by showing that 1. e3 wins for White. As of summer 2014 [4], leaving b6 and c5 as the remaining Black responses [5], all other responses to 1.e3 are indeed White wins, along with earlier work done by Ben Nye and others, as demonstrated by Proof-Number Search combined with Endgame Tablebases. On February 02, 2015, 1. e3 c5 was announced solved, on October 10, 2016, 1. e3 b6, proving 1.e3 wins [6].Selected Publications
2000 ...
2010 ...
Forum Posts
2010 ...
- "Automated Discovery of Search Extensions" by BB+, OpenChess Forum, June 22, 2010 » Extensions
- Some tablebase formats by BB+, OpenChess Forum, November 25, 2010 » Endgame Tablebases
- Retrograde tablebase methods by BB+, OpenChess Forum, November 26, 2010 » Retrograde Analysis
- Bad/good bishops in R3 and IPPOLIT/IvanHoe by BB+, OpenChess Forum, November 30, 2010
- Hard pruning history by BB+, OpenChess Forum, December 10, 2010
- Brief Q&A about Rybka 1.0 Beta and Fruit 2.1 by BB+, OpenChess Forum, December 14, 2010
- Monte Carlo in LOA by BB+, OpenChess Forum, December 30, 2010 » Monte-Carlo Tree Search, Lines of Action
2011- Node counting by BB+, OpenChess Forum, January 20, 2011
- Revisiting Strelka/Rybka by BB+, OpenChess Forum, January 25, 2011
- Feb 12 version: Rybka 1.0 Beta / Fruit 2.1 document by BB+, OpenChess Forum, February 12, 2011
- Attack of the Clones (ChessVibes) by BB+, OpenChess Forum, 19 February, 2011
- Loop 2007 / Fruit 2.1 by BB+, OpenChess Forum, Apr 18, 2011 » Loop, Fruit
- Node counts at a given depth/iteration in search by BB+, OpenChess Forum, May 23, 2011 » Branching Factor, Depth, Iterative Deepening, Odd-Even Effect
- The ICGA Process by BB+, OpenChess Forum, July 01, 2011
- Deep Fritz 11 eval by BB+, OpenChess Forum, October 23, 2011
2012- Re: ChessBase: A Gross Miscarriage of Justice in Computer Chess by BB+, OpenChess Forum, January 02, 2012 [15]
- Re: Hyatt Is Gone! by BB+ OpenChess Forum, Jan 03, 2012
- Rybka evidence recapitulation by BB+, OpenChess Forum, January 03, 2012
20132015 ...
External Links
References
What links here?
Up one Level