Author: David Rasmussen
Date: 12:41:13 01/15/02
Go up one level in this thread
On January 15, 2002 at 14:59:42, Bo Persson wrote: > >But, some of us believe that the "difficult" moves are expensive because they >have been very hard to dismiss at previous iterations, and therefore are the >prime candidates for being best move whenever the PV move fails low. > >Then, why not search them first!? > No one says that node ordering is bad. It is quite good. If it wasn't, so many good programs wouldn't be using it. The reasons why node ordering works, are obvious. I am just saying: Can't we do better? /David
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.