Author: blass uri
Date: 14:25:22 05/31/00
Go up one level in this thread
On May 31, 2000 at 17:21:05, blass uri wrote: <snipped> >If people want to get an estimate how much better they can improve the move >ordering then I suggest to develop 2 programs. > >1)Program A searches with the same extensions of the original program when only >the order of moves may be different because it gets it from program B > >2)program B searches for the best move ordering and gives program A only the >knowledge about the order of moves to search. > >When you count nodes count only nodes of program A to get a fixed depth and >compare it with the number of nodes of the original program to get the same >depth. > I can add that I think that this is not a simple task to write the programs A and B(when the main problem should be writing program B that searches for the smallest tree to produce a cutoff). Uri
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.