Author: Uri Blass
Date: 04:28:56 02/16/04
Go up one level in this thread
On February 16, 2004 at 06:22:02, Tord Romstad wrote: >On February 16, 2004 at 05:54:48, Matthias Gemuh wrote: > >>On February 16, 2004 at 05:10:37, Tord Romstad wrote: >> >>>> >>>>And this is not the first time you give this advice! >>>> >> >>> >>>No, it is not the first, and probably not the last time. :-) >>> >> >> >>Hi Tord, >>would I speed up my engine considerably by optimizing GenerateMoves() ? :-) > >Hi Matthias! > >I feel that giving the same advice more than once in the same thread >might be a bit too much. :-) > >But on a somewhat related note, there is one little piece of information >on your BigLion page which I have always found really weird: You write >that you store the pseudo-legal move list in your hash table. I have >never tried anything like this myself, but I find it hard to believe >that it is really a good idea. Doesn't this make your hash table >entries insanely big? Does it really give you a sufficiently big >performance effect that it is worth the price? > >>BTW, I now evaluate internal nodes, but pruning is yet disasterous: >>too many good moves depart with the trash. >>I will keep on experimenting. Expect a balanced fight between >>Gothmog and BigLion before the year 2015, if the rapture tarries. > >I think BigLion has a big potential, and that a balanced fight should >be possible in the not very far future. However, I am not sure this >is the right time to experiment with new pruning tricks. I have the >impression that you still suffer from a few serious bugs in your search, >and you should probably try to fix them before you make your search more >complicated. > >Tord I guess that you are right. I suggest Matthias simply to start by investigating the positions when Biglion fails in WAC to see if the reason is some bugs. Uri
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.