Author: Francis Monkman
Date: 11:14:44 05/02/99
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
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.