Description: new problem has arisen : the biggest smallest general search, even if only a small step in the purgation, Search position as the number will search depth grow exponentially. In most of the middle-game, every step, an average of 10 purgation, Assuming the computer search nine-step (search procedure, technically known as a depth of nine), it is necessary to search 1 billion location (10 to nine), this greatly limits the computer chess : We can not put up with the computer players will move next year. Reduce node search of the most simple way is to reduce the depth of search
To Search:
File list (Check if you may need any files):
Download