Author: Rolf Tueschen
Date: 05:24:30 12/19/02
Go up one level in this thread
On December 19, 2002 at 02:37:14, Bruce Moreland wrote: >On December 19, 2002 at 02:13:51, Russell Reagan wrote: > >>So during the reduced null-move search, is it common practice to do a qsearch at >>leaf-nodes? That would seem to solve a lot of the problem, but it could also >>cause the search to explode. What do most do? > >I don't know what most do. It is certainly possible to try to do a null move >search all the way down to the tips. A few tests would ascertain which way is >best. > >bruce Thank you both for the debate. How about giving just one single good position to explain what you were talking about. I think one diagram is better than thousand words. I'm surprised that you see so many difficulties in special for the middle game, Bruce. I was extrapolating from my average chess knowledge, but couldn't make such conclusions of course. Clear question. Is nullmove what I said or is it the key for the future of computer chess? I said that nullmove is more PR for the average amateurs, but the super GM have another source to exploit typical computer weaknesses. What do you think here? Rolf Tueschen
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.