How many chess games are possible that result in checkmate, draw or stalemate?
Can this be calculated?|||Yes, it can be calculated but only approximately. It is known as the Shannon Number. It is very huge.
It was used as an example of why some problems can not be solved by brute force computing but instead computers need to understand strategy and heuristics.|||I think the possibilities are way too large. But professional players do not allow themselves to be checkmated. They resign whenever they realize that result is inevitable.|||G.H Hardy(1997, p.17) estimated the possible chess games as10^10^50.
See chess in ''wolfram'' (google search engine)|||don't think so...too many variables
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment