Author: Peter McKenzie
Date: 14:58:03 07/09/99
Go up one level in this thread
On July 09, 1999 at 06:14:17, Ernst A. Heinz wrote: >On July 08, 1999 at 13:14:55, Christian Goralski wrote: > >> Nimzo-Paderborn >> >>Verbesserungen gegenueber Nimzo99 >> >> [...] >> >>b) Eigene komprimierte Endspiel-Datenbank, auf die auch in der Ruhesuche >>zugegriffen wird. Dadurch werden Abtaeusche in gewonnene Endspiele sehr >>schnell gefunden bzw. Abtaeusche in verlorene vermieden > >Just for the record and information of interested chess programmers: > >The new endgame databases of "Nimzo-Paderborn" are based on the >knowledgeable encoding technique as introduced by "DarkThought" and >decribed in my article "Knowledgeable Encoding and Querying of Endgame >Databases" in the ICCA Journal 22(2), pp. 81-97. > >Chrilly Donninger further advanced my published scheme in "Nimzo". > >>c) Zusaetzlich (zum Nullmove) neue selektive Suchtechnik (Details sind aber >>Top-Secret). > >In Paderborn, Chrilly openly admitted to employ multi-cut pruning. >Maybe this is the "top secret" method ... > >The bibliographic refernces for multi-cut pruning follow below. > >Bj"ornsson, Y. and Marsland, T.A. (1999). >Multi-cut pruning in alpha-beta search. >1st International Conference on Computers and Games, >Proceedings, H.J. van den Herik and H. Iida (eds.), >pp. 15--24, LNCS 1558, Springer, ISBN 3-540-65766-5. > >Bj"ornsson, Y. and Marsland, T.A. (1998). >Risk management in game-tree pruning. >Technical Report TR 98-07, Department of Computing Science, >University of Alberta. Perhaps someone could post a brief overview of what Multi-cut pruning is? I've never heard of it before... > >=Ernst=
This page took 0.01 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.