Author: Larry Griffiths
Date: 05:27:30 02/01/01
Go up one level in this thread
On February 01, 2001 at 08:20:39, Severi Salminen wrote: >>>How do you calculate EBF in your program? What kind of EBF you get in Vincent's >>>position (position after 1.e4 e5 2.d4 d5)? I get 3.6 in 9 ply search. I'd like >>>to just compare. >> >>I've found that the easiest way is to see how much time it costs to finish the >>iteration. >> >>Times for XiniX on AMD 333( yes, I know I need a faster computer) >>ply: 5 time: 2s >>ply: 6 time: 3s >>ply: 7 time: 7s ( 2.3 * ply 6 ) >>ply: 8 time: 18s ( 2.6 * ply 7 ) >>ply: 9 time: 41s ( 2.3 * ply 8 ) >>ply:10 time: 98s ( 2.4 * ply 9 ) >>ply:11 time:217s ( 2.2 * ply 10) >>ply:12 time:500s ( 2.3 * ply 11) > >What kind of program is Xinix? BitBoard or array based? Are you using SEE and >futility pruning. I'm doing a ply 9 search on Celeron300 in 23 seconds so I'd >like to know where does the difference come from? How many nodes are you >counting each ply? And what about hashtables - are you using them? Of course >evaluation has a big impact here too. And don't get me wrong - I'm not saying >"my program is better than yours, blah, blah!" ;-) I just want to understand >chess engines better. > I would also like to know these things. It looks like my branching factor is varying from 3 to 6 on average. Are these results for chess? Is it from the initial board position? Larry. > >Severi
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.