Author: Inmann Werner
Date: 02:31:10 03/31/00
Go up one level in this thread
On March 28, 2000 at 07:10:40, Jan Pernicka wrote: >On March 22, 2000 at 10:10:51, Inmann Werner wrote: > >>On March 22, 2000 at 09:54:23, Jan Pernicka wrote: >> >>>On March 22, 2000 at 08:32:37, Inmann Werner wrote: >>> >>>>On March 22, 2000 at 08:05:13, Jan Pernicka wrote: >>>> >>>>>On March 22, 2000 at 07:12:59, Inmann Werner wrote: >>>>> >>>>>>On March 22, 2000 at 06:30:58, Jan Pernicka wrote: >>>>>> >>>> >>> So - what's maximum searching depth of your program (say, in middle >>> game) ? >> >>about 12 plys in normal timed games...(>1 min per move) >> > > I suppose you enjoy bitboards.... :) > I'd like to know how much faster is it comparing with "classic" board... > Ups, you got my "dark side". My change to bitboard is only "half hearted", there was no speed increase. (I do not think, bitboards make programs faster on it). But you have much easier methods to put in new things. Evaluation, threats.... As Christoph Theron said, if I had only more time ......... >>>>- null move extension, i only allow once in a branch (it blows up the tree too >>>>much) >>> >>> - this surprised me - I think that null move ext. shout shorten the time >>> of search. (In other words - you have experienced that null-move ext. >>> fails too often - and thus regular research has to be done?) >>> >>dont mix things. Null move shortens the tree a lot. But if the null move brings >>back the information, that i get mated, if i do the null move, that leads to a >>null move extension. The normal nullmove condition cuts the tree! >> > > Thank you for explanation, but - it would be, I think, better, to extent > only on "mate in 1" threat and not to all mate thrats (in some sharp games > it seems very reasonable... - or not?). Hmm. Maybe here I would get problems with my hashing. But the idea is to think about....... > > >>I extend up to 9 times in one branch, but only once at one ply in this branch. >>I extend, but one ply deeper, if I come there and have no cutoff before. If I > ------ -------- >>extend one ply deeper, the extension is much smaller, cause it is deeper to the >>horizon. >> > > I think, it specially means, that you extent every time you reach > the horizon ?! (because at that case no cutoff have occured...). > But maybe I don't fully understand what in this case is included under > "before" and "there"... (I take the liberty to underline it in the text > above...) I have a variable called extend. I pass it to the alpha-beta routine at each call. If something interesting is going on, i increase the value. At start of alpha-beta, i look, if the variable gets over 100. If yes, i really extend and decrease the variable by 100. The possible rest stays in the variable and will be passed with the alpha beta calls following (nearer to the leaves) > >>>If my premise is true - and you are from Germany - then we are neighbours >>>- I'm from Czech... >> >>Yes, we are neighbours, but I am from AUSTRIA!!!!!!!!! >> > > So - greetings to all chess programmers, especially to those in Austria :) > > Jan > > PS: Congratulation to you for being father... Thanks a lot :-) Werner
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.