Author: William H Rogers
Date: 12:05:38 01/09/02
Go up one level in this thread
On January 09, 2002 at 12:50:12, David Hanley wrote: >I have seen it claimed somewhere that with perfect move ordering, an eight ply >search would only consume a thousand nodes or so, even only alphabeta ( no >hashing or forward pruning ). > >Is this so? > >dave I don't know how other people do it, but in the beginning I generated all moves for ply one then sorted them. This seemed to me to be the fastest way to get cut-offs as the highest rated move is tried first. After checking the first 2-5 moves all the rest were elimited with cut-offs by alpha/beta. So instead of using 38^n we end up with someting like 5^n . Well it seems to work for me in any event. Good luck. Bill
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.