Author: Vasik Rajlich
Date: 15:23:44 12/25/05
Go up one level in this thread
On December 25, 2005 at 14:45:15, Jan Kiwitter wrote: >Hi Vas > >>Yup. Rybka 1.2 will actually do ok here, but there are some deeper questions. >>One idea I have thought about a little bit is that an advantage should grow over >>time (ie with more search). I think it's true of every serious advantage, but >>the opposite may be true of small advantages. > >Interesting idea. Maybe one could say that if one is for example at least a >minor piece ahead (which means the advantage should normally grow rather fast) >but still the program cannot see any progress within a certain number of moves >then the possibility is rather high that the position is drawish (for example >blocked. > >Greetings >Jan Yup. At the extreme point, every winning position searched deeply enough will result in a mate score. The question is if this also works on a smaller scale. Vas
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.