Author: José de Jesús García Ruvalcaba
Date: 11:11:47 10/10/98
Go up one level in this thread
On October 10, 1998 at 14:03:26, blass uri wrote: > >On October 10, 1998 at 13:55:53, José de Jesús García Ruvalcaba wrote: > >>On October 10, 1998 at 11:33:14, blass uri wrote: >> >>>I think that in some endgames like KRN vs KR you can save space >>>by defining rules to do the right moves: >>> >>>If there is conversion in a small number of plies you can find it by search and >>>not use the tablebases to tell you the right move >>> >> >>You can do the search if the position is in the root. >>But what if it appears after a 18 ply search? >you do not define 18 as small >you define small only if you are sure that you can do practically the search >let say less than 8 plies > >If the rules for finding the right move does not tell you the right move and it >is at least 8 plies to conversion you save it in the exceptions. >I believe that there are not many positions like this. > >Uri Perhaps I did not state my point clearly. In the search tree, do appear many weird and ridiculous positions. Imagine that after a 18 ply search in one leaf node you have a position like KRNKR. It is unlikely it is a "sane" position. But you need the score, and if it is an exact one it is best. Is it affordable to extend eight more plies on that position? It is very likely that many more leaf nodes with the same reduced material appear. Is it affordable to extend eight more plies on an unspecied number of them?
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.