Introduction - If you have any usage issues, please Google them yourself
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
Packet : 5956454gk.rar filelist
加法器
加法器\加法器
加法器\加法器\Debug
加法器\加法器\ReadMe.txt
加法器\加法器\res
加法器\加法器\res\加法器.ico
加法器\加法器\res\加法器.rc2
加法器\加法器\Resource.h
加法器\加法器\StdAfx.cpp
加法器\加法器\StdAfx.h
加法器\加法器\加法器.aps
加法器\加法器\加法器.clw
加法器\加法器\加法器.cpp
加法器\加法器\加法器.dsp
加法器\加法器\加法器.dsw
加法器\加法器\加法器.h
加法器\加法器\加法器.ncb
加法器\加法器\加法器.opt
加法器\加法器\加法器.plg
加法器\加法器\加法器.rc
加法器\加法器\加法器Dlg.cpp
加法器\加法器\加法器Dlg.h