Author: GuyHaworth
Date: 07:45:14 01/11/03
Go up one level in this thread
... John Tamplin wrote a program to the Wu/Beal algorithm (with small improvements) to create Pawnless DTC EGTs to the Nalimov format. Almost all 3-5-man endgames were done. SHREDDER 4 (if not 5) interfaced to KT's EGTs but it would require a different application behind the SHREDDER/KT_EGT interface to cycle through all positions and output to a 'Nalimov array'. I haven't studied the Nalimov code but if the 'subgame reverse-inheritance' phase is changed as follows: a) side mated ==> DTC = DTM = 0 b) stm converts to win ==> DTC = 1 rather than DTM = dm+1 c) stm forced to convert to loss ==> DTC = 0 rather than DTM = dm then Eugene's code generates DTC EGTs rather than DTM EGTs. Maybe the EN-program-cognoscenti know where this coding is? This seems a safer route to creating the DTC EGTs. g
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.