Author: Gian-Carlo Pascutto
Date: 10:56:59 06/24/02
Go up one level in this thread
On June 24, 2002 at 13:52:45, Steve Coladonato wrote: ><snip> >> >>You can compare plies of the same program and if a program searches deeper then >>in most cases you can expect a bigger part of it's pv to be correct. >> > >Thanks Uri > >So given the "standard" definition of ply, why can't I compare the time it takes >program X to get to ply M vs. program Y? By definition of ply, the time it >takes to get to evaluation at ply M should be comparable regardless of what is >going on behind the scenes. What is the definition of ply? I wonder what you consider 'comparable'. There's no guarantee they'll be similar whatsoever. >Program X's variation at ply M may be inferior to >program Y's, but at ply M that is what each is saying is the best >move/variation. Yes. (Is there a point?) -- GCP
This page took 0.01 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.