Author: Tony Werten
Date: 05:43:37 02/16/06
Go up one level in this thread
On February 16, 2006 at 02:40:45, Nathan Thom wrote: >On February 16, 2006 at 02:27:01, Tony Werten wrote: > > >>>I assume this isn't an issue as when I implement hashing and better move >>>ordering it will have a better move to fall back on? >> >>It still will be an isue. You should always search the best move of the previous >>iteration first. >> >>Tony > >Thanks, but thats what I meant by "when i implement better move ordering" :D That's not better move ordering, that's basic alpha beta. At the root, first search the best move of the previous iteration. else, timeouts will always kill you, because maybe you haven't searched the previous best move yet. What happens when you timeout and you have only searched 1 move that leads to a checkmate in 1 ? Tony
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.