Author: Roy Eassa
Date: 12:48:50 01/31/02
Go up one level in this thread
On January 31, 2002 at 15:20:55, William H Rogers wrote: >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. >Bill That much was already assumed (sorry if I didn't make that clear). Looking first at the "best" move from last ply was also assumed. What I was trying to find out was whether this idea was a reasonable way to sort the OTHER moves (the ones you will examine after you've examined the previous ply's "best" move). (And I didn't realize that anybody had actually tried this idea before. I figured the idea would be shot down and I would learn the error of my thinking.)
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.