Computer Chess Club Archives

Search

Terms

Messages

Subject: Question about Alpha-Beta-Improvements

Author: Rafael Andrist

Date: 08:12:55 04/23/01

In my chessprog, I'm using an Alpha-Beta-Search with an infinite window. After
adding a hashtable, only half of the nodes need to be searched, but I get still
a branching factor around 9. The use of Iterative Deepening didn't change much.
So now my question is what can I do to improve the search? Should I try to
improve the move-sorting? Or is it necessary to use other pruning techniques
like Nullmove?

Thanks

Rafael B. Andrist

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.