Author: Ralf Elvsén
Date: 16:51:14 09/12/99
I have read about some experiments where you let a program play against itself, but one version is searching one or more ply deeper than the other. From this you can estimate how much stronger a program gets given more time to search. Is it possible to perform an experiment like this on one computer according to the following? You take the principal variation given by the computer which looks like move1 move2 move3 ... i.e. the computer plays move1 and assumes the reply will be move2. Then you consistently make move2 (just like when you're cheating and look at the info from the computer) in reply to move1. Move2 is based on a search one ply more shallow than move1, so I figure this would work OK to simulate the abovementioned experiments. On the other hand, both moves "aim" for the same position (the one after the last move in the line). I haven't really been able to decide whether this would work or not. Presently I take the position that this would indeed give the same results as an ordinary experiment, but I sway back and forth, so if you think otherwise, you will not have a hard time to convince me :) Ralf
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.