Author: Andrew Dados
Date: 10:31:18 09/25/00
Go up one level in this thread
On September 25, 2000 at 10:23:29, Andrew Williams wrote: >On September 25, 2000 at 06:45:34, Ricardo Gibert wrote: > >>Which of the following is the most effective for a chess playing computer >>program: >>(1) Never consider underpromotions. >>(2) Allow consideration of underpromotions. >>(3) Only consider underpromotions if promoting to a Queen leads to a stalemate >>or if underpromoting to a Knight gives check. > >My program ignores underpromotions in the qsearch, but otherwise it always >searches *all* moves. > >Andrew Williams I do the above, too, but with exception when promotion to N will be a check. I also prune underpromotions in the search when promotion to Queen was refuted by capture of it. (So eg d8=B will be also refuted by capture of it...) -Andrew-
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.