Author: Reinhard Scharnagl
Date: 23:50:58 02/22/06
Go up one level in this thread
On February 23, 2006 at 01:53:58, Gabor Szots wrote: >I am just curious whether it is so extremely hard to implement underpromotions >in a program. Vasik Propaganda Rajlich put up a poll at his site, allegedly in >order to "Help us make the products that you want". The people here _want >underpromotions_ but, although promised several times, Rybka is still incapable >of it. Now is it really important for him what the masses want but the task is >simply too hard? > >Gábor Maybe it is a question of internal encoding of moves. If the code is not aware of a change of the moved piece, underpromotions hardly could be communicated. SMIRF actually has a 32 Bit encoding including several flags and check threading information (threat direction), so it has no problem to encode also underpromotions. Currently I am working out an (hopefully performant) encoding scheme using only 16 Bit, but still covering also 10x8 boards (as before). And it seems, that I am close to a solution. Reinhard.
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.