Author: Will Singleton
Date: 16:25:01 05/02/99
Go up one level in this thread
On May 02, 1999 at 14:14:44, Francis Monkman wrote: >I got to thinking along the same old lines again -- regardless of whether >winning moves can be shown to have advantage after whatever ply-depth the >machine is capable of, isn't there a strong case for monitoring the changing >expectations of a move at increasing ply-depths, so that something which, while >it may not have 'caught up with' the favorite move chosen, may have revealed >significant increases in expectation, and hence be particularly suited to >further exploration, ie extension(s) to the search? > >Any ideas or feedback, or possibly a programmer willing to try? I coded a >working engine (in 68000 assembler, from scratch), but can't afford the time to >start again, nor would I 'put myself forward' as a candidate for the job. > >Francis Monkman I think a well-used method for determining the order of root moves is to see how long each takes, then sort (excluding the best move) based on longest time taken. So, I suppose you could look at the root order at each iteration, and see if any moves have moved significantly up the list. But I don't know about extending on such information; in fact, I don't think that info is very significant, other than for root ordering purposes. Or do you have another method for determining epectations? Will
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.