Author: James Swafford
Date: 18:28:34 05/30/01
Go up one level in this thread
On May 30, 2001 at 17:10:25, Vincent Diepeveen wrote: >On May 30, 2001 at 16:04:18, James Swafford wrote: > >>On May 30, 2001 at 11:21:41, Vincent Diepeveen wrote: >> >>[snip] >> >>> >>>Good examples of successive algorithms are on the one hand >>> - MTD, if a program has a very conservative evaluation function >>> and a pawn is worth not so much >> >>What makes you say that? The evaluation needs some consistency, >>avoiding wild fluctuations, but what's with the "pawn is worth not >>so much" comment? > >pawn in diep is 1000. Ahh.. you are referring to the physical number assigned, not it's worth relative to other terms. Now I see your point. > >imagine the number of extra researches i need! > >>-- >>James >> >> >>> >>> - PVS (sometimes also used in combination with a root window) >>> >>>Very popular nowadays is nullmove using R=3 and near the leaves R=2, >>>whereas in past R=2 was very popular. >>> >>>Best regards, >>>Vincent
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.