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 search depth, but greatly affected the computer players in the spotlight. If there are ways to reduce the search in depth under the premise of the need to search nodes decreased? Fortunately, evidence, procedures need not consider all th
To Search:
- [fivelink_java_yjg] - no cut-hand with the 331 artificial inte
- [WangqiBook22] - This a VB procedures prepared by the boo
- [yggbook] - prepared with the message of this progra
- [AlphaBeta] - AlphaBeta pruning algorithm, an example
- [wei] - Data to establish an index based on quad
File list (Check if you may need any files):
Download