Author: Vincent Diepeveen
Date: 14:05:01 05/29/01
Go up one level in this thread
On May 29, 2001 at 14:05:36, Peter Berger wrote: >On May 29, 2001 at 13:02:43, Vincent Diepeveen wrote: > ><snip> >> round 5 : gambitmaster - diep 1/2-1/2 >> >>Apologies i forgot which program gambitmaster is, but i can't remember! > >Gambitmaster was the handle of the program "Der Bringer" written by Gerrit >Reubold . > ><snip> >> >>I've had games like that in 1996 and 1997 already. Hard to blame DIEP >>doing something wrong. It just got lousy search depths. I can at most >>work a bit harder to limit all the stupid extensions a bit at blitz >>levels. >> >>I find any shot, but getting 8 ply simply isn't enough! I already figured >>that out in 1997 in the world championship very bitterly, and only >>can write that again here as being the major problem in this game. >> > >This search depth issue is interesting - how deep did Diep search when it played >35. ...Rh1 and especially 72. ...Kh8 ? Were those moves played because of 8 ply >searches ? i can check in log file small moment. The move Re1-h1 i got out of my hashtable and i didn't get a new PV actually there only hashtable line within 0:00 seconds. Also the 24 seconds it searched there didn't bring a new PV, probably because it had problems searching the move as it probably dropped in score... It was busy 8 ply there by the way score for Rh1 was +1.147 72...Kh8 the same thing happened it had first 9 ply out of hashtable in 0:00.00 without new moves of course and i had to blitz so it had 0% chance to get a diff pv out of hashtable as that Kh8 was a truebound score of +1.1 A problem here is that also if it was leading to a draw, that seeing a repetition score is hard then, because previous searches it was searching deeper as 9 ply, so it gets some true bounds out of hashtable then causing the problem. >pete
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.