Author: Álvaro Begué
Date: 13:13:13 09/22/04
Go up one level in this thread
I use a combination of things that seems to work very well: *In depth 1, I search all moves with full window, so the returned scores are all exact. I sort the moves using those scores (I also use the scores to detect easy moves). *When a move fails high, I put it at the top of the list. *When I finish searching a ply, moves that have ever failed high are kept in whatever order they are. The rest are ordered by number of nodes to refute (more nodes first), but I only partially sort them (3 passes of bubble sort), so a move can at most be pushed three places down the list. I do this because I have a weird pruning mechanism that occasionally will refute a move very quickly, and I don't want to put it all the way at the end of the list.
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.