Author: Tom Kerrigan
Date: 18:52:26 02/17/00
Go up one level in this thread
On February 17, 2000 at 19:18:48, Olaf Jenkner wrote: >>All programs use some sort of 'Alpha-beta' like searching (unless it is a >>Brute-force searcher). > >Alpha-beta is the most efficient way to do Brute-Force, because >Alpha-beta is used to avoid useless moves. Brute-Force is used >if you want to do all necessary moves. > >OJe This is getting a little confusing. There are two ways to do brute force searches: 1) minimax: searches all possible combinations 2) alpha-beta: searches all possible combinations except for the ones that are mathematically irrelevant They are functionally equivalent. So it would be stupid NOT to do alpha-beta. -Tom
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.