Author: Rafael Andrist
Date: 03:13:31 04/24/01
Go up one level in this thread
On April 23, 2001 at 15:14:00, Antonio Dieguez wrote: >>You forget that you have a branching factor of 100 at the root is ex. 1 and one >>of 10 in ex. 2. >> >>Using "my" definition, it isn't very different: >>ex.1: 3.50 >>ex.2: 2.52 > >ok, not MUCH different. > >Am sorry about being too much conclusive in my reply, but I just saw it strange. That's normal for a chess player or for a programmer :) It happens sometimes also to me. >Now I could like the formula, but only at high depths. Yes, at low depths is does not work very well. >Anyway I think is better b=(n-(n at depth 1))^(1/d-1), what do you think? to measure the effectiveness of a program, it may be a better a value (I need to test it out) (I've seen your correction) > >Ouch I see you really have a high branching factor. can you supply the position >of that search? After adding a killer heuristic, the branching factor is now about 7. The position is after 1.e4 e6 2.f4 Be7 3.d4 d5. It occured in a game with my prog. FEN rnbqk1nr/ppp1bppp/4p3/3p4/3PPP2/8/PPP3PP/RNBQKBNR w KQkq d6 0 4 >Antonio... > Rafael B. Andrist
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.