Author: Robert Hyatt
Date: 18:35:54 12/06/04
Go up one level in this thread
On December 06, 2004 at 20:48:57, William Bryant wrote: >Have other people tried to probed the hash table in the QSearch for a best move >to improve >move ordering. > >I realize, that if it is not a capture or promotion, it will be dropped. > >But if it is a capture or promotion, search it first. > >Note: I am not talking about storing best moves, just checking for them. > > >Any thought or discussion would be appreciated. > > >William It will work just fine, but whether it is worth the trouble or not needs testing. IE a capture might look good if you can follow it up with only a capture, it might look worse if you can play a non-capture. This means that the move might look good near the root, but bad in the q-search where it fails to produce a cutoff as expected... Needs lots of testing. And don't forget your obvious mention that you have to be sure the best move really is a capture or you will blow your tree up...
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.