Author: rasjid chan
Date: 19:20:35 04/04/04
Go up one level in this thread
On April 04, 2004 at 14:10:43, Robert Hyatt wrote: I do what Renze is doing as I have fails outside window bounds, but I have not monitored how often it fails low at root below alpha. Is it found that often there is no scores to sort on? Rasjid >On April 04, 2004 at 08:12:50, Renze Steenhuisen wrote: > >> >>Lectori salutem! >> >>I was wondering how others are doing the re-ordering at the root-node after an >>iteration has completed? Because there are some different option actually... >> >>I was doing a very simple way of re-ordering, by just ordering them according to >>the returned scores in descending order (Best Score First, Worst Score Last). > >How do you get a score for any move other than the first move? > >> >>The first move to be searched is the best move found on the previous level, >>sounds logical to me, but what next? I would say that it may pay-off to first >>search the moves that were best in earlier iterations, before searching the rest >>of the never-found-to-be-best moves. Finally to have the moves ordered by the >>returned score. >> >>Is this correct? Can I get some good advice on this point? Thanks! >> > > > >I don't see where you can get scores to sort on. I use node counts for each >sub-tree produced by each root move... > > > > > >>Cheers! >> Renze
This page took 0.02 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.