Author: blass uri
Date: 14:01:21 06/07/99
Go up one level in this thread
On June 07, 1999 at 16:33:47, Dann Corbit wrote: >On June 07, 1999 at 15:24:21, blass uri wrote: >[snip] >>The question is what is the number of cases when underpromotion changes the >>practical result of the game and not the number of cases when underpromotion is >>the shortest way to win. >That is not the question I was examining. We could also write a program that >naively ignores e.p. rules and tosses a pawn once in a while because of it. It >may still win the game, so what is the point? A program that misses the best >move misses the best move. To gague how much stronger a fixed program would be >would be difficult or even to find out how much more often it will result in a >win. But a program that makes suboptimal choices can clearly be improved by >making optimal choices. I agree but the question is what is the demage in rating from not seeing underpromotions. I think that it is less than 2 elo points rating. 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.