Author: Randall Shane
Date: 14:29:24 05/24/00
Go up one level in this thread
On May 24, 2000 at 17:20:29, Mike S. wrote: >On May 24, 2000 at 15:36:55, blass uri wrote: > >>The program has no idea about the difference between the best move and the >>second move. > >Really not? And how does it choose which is the best one to expect? Maybe I >would have to be a programmer to understand this. I seem to have a too simple >idea of a search tree...(?) Actually, normal alpha-beta searching will find the best move, but it won't find the second-best move -- to find the best move it's not necessary to rank all the moves among themselves. One way to look at alpha-beta searching is you can show that move A is beterr than either of move B and move C without having to decide which of B or C takes second place. A sorting algorithm analogy is that it's faster to pick out the highest value item in a list than to sort it.
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.