Author: blass uri
Date: 15:12:12 06/08/99
Go up one level in this thread
On June 08, 1999 at 15:42:40, Pat King wrote: >On June 08, 1999 at 12:48:26, KarinsDad wrote: > >[snip] >> >>If one computer program knows that another program does not underpromote (and >>this is REALLY writing your code to take advantage of other programs), it could >>prune it's legal move engine (the search portion for opponent's moves, not the >>the program's own moves) more in order to not check the underpromotions. That >>gives it an advantage in creating a smaller (a teeny tiny bit) tree. >> >OR write it to DO an underpromotion at the first opportunity, winning when your >opponent program gags on it! Doing a wrong underpromotion is not going to help against Junior because Junior except underpromotion moves in games and understand the position after them. It only does not check them in the search. Uri
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.