Author: Mike S.
Date: 11:31:13 10/18/00
Go up one level in this thread
On October 18, 2000 at 08:57:56, Uri Blass wrote: >(...) >I believe that it is possible to do programs that make plans and not only >calculate moves(it should first calculate target position and later search for >moves to achieve this target) but I believe that there is no program that works >in this way. To see, if the target position can be achieved (or forced even) against the opponents defence, you would have to do a more or less "normal" tree search starting from the board position. But this means, the target position must appear in the search tree (anyway)... so, if it's good, it should be found by the usual search, and the previous "targetting" part is not needed and would waste time. Is this correct (I'm no programmer)? And could it make sense to aim for target positions, which are very far ahead (in plies), so that they cannot be covered by the normal search, and could therefore be missed? Regards, M.Scheidl
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.