Author: Robert Hyatt
Date: 05:52:38 06/12/01
Go up one level in this thread
On June 12, 2001 at 05:56:27, David Rasmussen wrote: >On June 11, 2001 at 20:52:07, Robert Hyatt wrote: > >>>I see now. That is of course a problem. But it would still be nicer, if this was >>>somehow prevented, so one could take full advantage of the opening knowledge in >>>the book. This would allow one to make transpositions into book positions from >>>non-book positions. >> >> >>It can do this. What my current book logic requires is that the previous >>position must be a legitimate book position that is followed by the current >>book position (to allow the transposition.) If this fails, crafty will have >>to search normally. But if It then finds a move that returns it to a book >>position, all will be ok as it will then transpose in for its "next" search >>since this and that position are known book positions. > >I know, but then you make the transposition "unintentionally" by search. I think >a scheme where a positions doesn't depend on it's parent position is nicer, as >the engine can use the book knowledge also in the case I mention. I don't really >see how the "going back" in the book, can be a problem, as long as one checks >during book move selection, that this move doesn't get one back in a position >that the game has already been in, that is, repetition check the book moves. "Unintentionally, by search" is what I want. I want to use the search to find a reasonable move if the beginning position is not a known book position. If it happens to find a move that takes it back into book, fine. If it doesn't, that is perhaps even better (again, the Nc6 move is what I want to avoid, so that I can play axb6 and win easily.) To answer your question "how can it hurt" just remember e4 e5 Nf3 a6 Bb5 and recall that Nc6 takes you back into book. axb5 wins the game. Which do you _really_ want to find? :)
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.