Author: Eran Karu
Date: 15:50:36 12/05/04
Go up one level in this thread
On December 05, 2004 at 08:41:42, Alan Grotier wrote: > > The brute force or the selective brute search algorithm?......Alan Brute force searches for all moves, both good and bad, in several plies ahead. It does not overlook any move at all but search is very slow. Selective search cuts off trees of bad moves and searches for several best moves in several plies ahead. It is fast but may overlook some good moves. Selective search is best for playing tournament games or blitz games. If you want to make a thorough analysis to find a best move in a game for a long time, brute force may be ideal. Eran Karu
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.