Author: Steve Coladonato
Date: 04:26:10 06/26/02
Go up one level in this thread
On June 25, 2002 at 11:43:05, Gian-Carlo Pascutto wrote: >On June 25, 2002 at 11:28:03, Steve Coladonato wrote: > >>You keep saying this but a ply is a ply and if program X reports a score at ply >>depth M and program Y reports a score at ply depth M then there is a comparison >>to be made here. > >Yes, you can make 'a' comparison. The issue is whether that comparison >makes any sense. > >What point are you going to try to illustrate by comparing 14 plies >from Gandalf with 14 plies of Fritz? > >-- >GCP I'm going to compare the time it takes for each program to get to 14 ply. For example, say I have a game I want to analyze over night. Let's say the game has 40 moves and I don't want to analyze the first 5. That leaves 35 moves to analyze or a position analysis by the engine 70 times (analysis for both black and white). And say I also want to have the analysis go to 11 ply. If Fritz takes 6 mins. to get to 11 ply that equates to 70*6/60 or 7 hours of compute time. If Gandalf takes 2 hrs. to get to 11 ply that's 70*2/24 or almost 6 days to do the analysis. So if I constrain the time for analyzing each move to around 6 mins., Fritz will have it done for me the following morning. This example is only a generalization and I know that programs utilize the allotted 6 mins. differently but the idea is to find the deepest depth I'm comfortable with and have an engine analyze the game inside some time constraint. Steve
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.