Author: leonid
Date: 04:28:31 03/09/01
Go up one level in this thread
On March 09, 2001 at 01:47:53, Matt McKnight wrote: >That's a good idea. I haven't tried that yet, and I think that I didn't >communicate what I was trying to do with this idea. > >I'm only keeping two moves to play at the very end of the list, because in the >last search they were the lowest failing moves. I'm hoping that I will not get >to those two bad moves. This sound to me as something completely new. Keeping two worst moves for something useful. I never did this and I have no idea where it can work. In mine each ply is devided by two parts: "active" and "passive". The last best move is saved as best "passive" or "active". And program use each time the best "active" or "passive" even if sometime this "best move" is not from the last one. >Is this any good, or should I scrap it? It seems to give me fewer nodes/ply. You can find the best for your program only on the place and by statistics because nobody can guess exactly how your program is written. Few time when I looked into somebody else code, I was all the time impressed by huge difference with my writing. Leonid. >Matt
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.