Author: Dan Honeycutt
Date: 21:07:42 03/19/04
I've followed the many recent posts on the history heuristic with much interest. Buoyed with confidence that i understood at least the basics from reading these posts, i introduced a simple from-to-depth^2 heuristic in my (very green) program. tests just concluded with some 20 odd positions indicate about a 9 percent reduction in nodes searched. not as impressive as some have obtained but still a solid improvement i think. thanks to all contributors. Dan H.
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.