Author: Daniel Shawul
Date: 00:06:33 11/17/03
Hi folks I want my program to be a fast searcher.I used every pruning technique I knew to make it fast.But it is not satisfying. I am intending to use reductions intensively.Does anybody know a good place to start?BTW,what else should I do to make my program fast?
This page took 0.01 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.