Author: Andrew Slough
Date: 19:57:34 09/09/99
Go up one level in this thread
On September 09, 1999 at 21:57:28, Ricardo Gibert wrote: >Would it be feasible to generate an EGTB in the following manner: Instead of >storing DTM or DTC in the EGTB, how about storing "nth generated move progresses >towards mate"? It would seem this would be more compact in some endings. An old >idea? Yes? No? Maybe? Incorporating a little primitive AI to order the moves >generated would make the the tables even more compact. Information on the number of moves until a mate is needed during search probes (there may have been 10 reversible moves, so I would want to know if I could mate in 40) and during tablebase generation for algorithm termination. I'm not convinced it would be a more compressed representation either, but then again I'm not convinced Eugene's representation is optimal either... Move ordering is certainly the problem to make things compress well, but have you ever watch a computer play KBBKN? I'm not sure that primitive AI would give good results. Andy
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.