Author: Ricardo Gibert
Date: 06:56:30 09/10/99
Go up one level in this thread
On September 10, 1999 at 00:20:59, Robert Hyatt wrote: >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. > > >Suppose _all_ moves head toward mate. How do you pick the one that leads to >the shortest mate? Not important? If you keep choosing a move that leads to >a mate in 10, you eventually run into the 50-move rule. This is why everyone >likes distance-to-mate databases. You missed the key word "progresses". You are including what I call retro-gressive moves leading to mate i.e. prolongs the win. I do need to amend my description for a very different reason, however. There is a problem in extracting reasonable defensive tries. How does the defender best prolong the game to delay its loss? "Nth generated move that is optimal rather than "Nth generated move progresses to mate" would include defenders best best defensive tries. All you need to know is that a move is optimal and not whether it mates in X number of moves or that it wins or draws. But this amendment is moot as the idea has other problems. DTM can be partitioned into smaller pieces, which makes it better memory wise.
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.