Author: KarinsDad
Date: 09:35:52 08/04/99
Go up one level in this thread
On August 04, 1999 at 12:16:52, Dann Corbit wrote: >As a 'for instance': > >Suppose that on promotion, a program sees that it can promote to a knight >instead of a queen, and get a king fork, taking a bishop, followed by a queen >fork, taking the other bishop. In such a case, it might evaluate: > -pawn+knight+bishop+bishop+two_bishop_bonus+(minor positional goo) >verses > -pawn+queen >and get something a fraction more valuable than a queen. But down the road I >would rather have the queen than a knight and remove the two bishops. > >How do programs deal with this? This is a guess. The program will head towards the promotion. When it is 1 ply away and the program's turn to move, it will search 9 or 10 ply down on the 2 choices and make a determination based on what it sees (assuming that unlike Junior, it will even consider the underpromotion). I think this will be handled automatically by just about every program and is not an issue. In my program, queens are worth 1900, bishops 640, knights 600. So, a knight and 2 bishops is worth 1880, very close to the queen. It would be real easy due to the number of squares gained by the opponent not having the 2 bishops to have a positional advantage with the 3 minor pieces over the queen to gain the 20 points or 1/10th pawn (in fact I wouldn't be surprised if my program would go for the 3 minor pieces almost every time). KarinsDad :)
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.