Author: Peter Hegger
Date: 09:04:04 02/25/98
Hello all!! I'm a newbie when it comes to computer chess so please forgive me if my questions have already been answered. Has anyone ever calculated the total number of possible moves in a game of chess? If so, it would logically follow that the nps would translate into the percentage of possible moves needed to play a perfect game of chess. i.e. at what point in nps would the program be able to spot a mate or draw after say 1.e4? A trillion nps? An octillion nps? I'm thinking that even these guesses are quite low as to what would actually be required, even if the above program were allowed to think for 3 months on move 1. Since the laws of physics have given us an unsurpassable upper limit when it comes to processor speed (you can't go faster than light speed)will we ever solve the game? Even with multiple processors? If such a feat is ever accomplished will the mythical program doing it have any knowledge based evaluation functions or will the shear speed of such a program negate any need for knowledge based evaluation? Thank you in advance. Peter F. Hegger peterfh@lon.ionline.net
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.