Author: Steffen Jakob
Date: 03:08:07 07/04/04
Go up one level in this thread
On July 04, 2004 at 05:46:42, Andrew Williams wrote: >On July 03, 2004 at 22:31:54, Mathieu Pagé wrote: > >>Hi ! >> >>I was wondering, what is a normal branching factor for my program... it use >>AlphaBeta, iterative deepening, a transposition table and an aspiration search. >>it's evaluation function is blindly fast (and bad). For the starting position I >>got branching factor of less thant 2 (time to depth N+1 / Time To depth N). >> >>is this normal ? >> >><output> >>MatMoi version: 5.12.2 >>Creer par Mathieu Page >>Date: Jun 12 2004 19:36:41 >> >>>st 60 >>>gonow >> depth time score variation >> 1-> 0.09 0.00 a2a3 >> 2-> 0.13 0.00 a2a3 a7a6 >> 3-> 0.17 0.00 a2a3 a7a6 a3a4 >> 4-> 0.20 0.00 a2a3 a7a6 a3a4 b7b6 >> 5 0.24 1.00 b2b3 a7a6 c1a3 b7b6 a3e7 >> 5-> 0.28 1.00 b2b3 a7a6 c1a3 b7b6 a3e7 >> 6-> 0.66 -1.00 b2b3 b7b6 b3b4 c8b7 b4b5 b7g2 >> 7-> 1.27 1.00 b2b3 a7a6 a2a3 b7b6 c1b2 c7c6 b2g7 >> 8-> 5.38 -1.00 b2b3 a7a6 b3b4 b7b6 a2a3 e7e6 b4b5 a6b5 >> 9-> 12.55 1.00 b2b3 a7a6 b3b4 b7b6 e2e3 c7c6 e3e4 d7d6 f1a6 >> > >Do you have a bug here? Why would the score go from 0.00 to +1.00 and then to >-1.00 and then back to +1.00? Before worrying about your branching factor, I >would look in detail at the apparent problem you have above. Looking at the PVs I would say he has no qsearch. :) Greetings, Steffen.
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.