Author: stuart taylor
Date: 06:08:28 02/11/00
Go up one level in this thread
On February 11, 2000 at 08:47:46, Albert Silver wrote: >On February 11, 2000 at 08:34:16, Vincent Vega wrote: > >>I understand that somebody is working on confirming whether there is a linear >>ELO increase with ply depth. If this indeed proves to be the case (as earlier >>results show), the slow searchers will get the same benefit with the increase of >>processor speed as the fast searchers. On the other hand, if there is a falloff >>somewhere, watch out for CSTAL, etc. They will rule in a couple years. > >I don't see how anyone could confirm a linear ELO increase with ply depth unless >a large amount of games were played with limited depths against human players. >Unless you are talking about computer-computer games where the effect is far >more decisive. > > Albert Silver What's the rationale behind the possibility that greater depth may not necesarily result in better decisions over the board? Do you mean brute force vs. selective search, or great depth branching off a very limited ply count? (which is like very selective search with good pruning) S.Taylor
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.