Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » alt.math.recreational.independent

Topic: Chess Problem
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
Graham Ashe

Posts: 140
Registered: 5/9/06
Chess Problem
Posted: Aug 18, 2008 8:02 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

A few years back, I came across a document from the 1970s which stated that there were around 7 billion forced mate-in-2 problems (i.e. compositions) possible in chess. It never explained how they arrived at that figure. I was wondering if anyone knew.

Additionally, could the same method be used to approximate the number of forced mate-in-3 problems in the game?



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.