Author: Severi Salminen
Date: 12:29:06 01/31/02
Go up one level in this thread
>I can not say what most programmers are doing today but a few years ago the >logic was to generate all moves for a certain ply, sort them and then take the >best move. While the sorting seems to take time, I believe that in the long run >it save even more by selecting the best moves first without having to back up >and regenerate all over again. It is possible the the best move chosen at first >will not be the best overall, but at least you have a good chance of getting it >right in the beggining. It is always stated that alpha/beta works best if the >strongest moves are tried first. Whether it takes any longer this way or not I >can not tell you at this time. Hmm, I think the real issue here is _how_ to find that best move...Of course best move should be considered first. Good estimate (this applies to root node) is to count nodes spent at previous iteration and sort accordingly - PV first in any case. Severi
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.