Author: Robert Hyatt
Date: 12:25:03 05/28/01
Go up one level in this thread
On May 28, 2001 at 12:19:21, Marc van Hal wrote: >I did read in crafty's source code that minmax is used to determine if a piece >is attacked or not. >My question actualy is if you block this option on a to early point, >you handicap the program and is it for this reason why 0-0-0 is not played by >programs in the game Nimzowitsch- Alapin >Also if you play quick games or tournament games the threath of capture should >lay on an other valeu. >Also with new faster hardware this kind of search is to my point of vieuw more >a handicap then a solution > >Ofcourse I am not a programmer yet but this where questions wich came up when I >did read about this min-max search. > >I am verry intrested i your answers. > >Marc van Hal Everybody uses minimax search, with alpha/beta pruning. In the SEE code you are looking at most likely, there is no _search_ being done. The pieces bearing on a particular target are enumerated in increasing value of piece order, then the 'minimax' result of that potential sequence of captures determines who would stop first if anybody... It has nothing to do with the search, however, it is used to order the moves only.
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.