![]() Nonetheless it shows how amazing chess is. ☺ Basically, it is the lower limit of what the total number of chess games is (the game-tree), and probably nothing close to the actual number. You may not fully understand what this is about, but I don't either. The Shannon number is, according to Wikipedia, the "estimated lower bound on the game-tree complexity of chess" it was calculated by mathematician Claude Shannon to be about 10^123. Of course, most of these positions would never come about between decent players, but still.the possibilities I've heard that there are over 4 billion possible board positions after only 4 moves by each player, which blows my mind. Sorry to plead ignorant, but what is the Shannon number? Therefore it is pointless to argue about "possibilities" after a certain position, since most will be irrelevant. ![]() There are positions where the side utilizing the wall wins and some where he/she loses, but either way the game depends on the player in how they got to the postition and how they will play on afterwards. It really has nothing to do with the pawn wall. The Shannon number is only the "lower bound" of the chess game-tree complexity and only considers games going up to 40 moves.Ģ. Some people are discussing the Shannon number, but I will say two things:ġ. Also, you seem to not be grasping the idea of infinite. The game-tree complexity of chess takes into account all possible moves (those which win AND which lose). Shannon's number, if your strategy was full proof and unbeatable, then chess would be limited by that !!!! and it aint, infinite possibilities Īctually, even if his strategy was "fool" proof and unbeatable, the game-tree complexity of chess would still be limited by Shannon's number, not by the number of possibilities in his strategy.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |