Author: Daniel Clausen
Date: 13:41:27 01/07/00
Go up one level in this thread
Hi >>What he means is, it will transpose back even when there *might* be something >>better. When what the program could and should calculate is actually better than >>transposing, his program prefers to transpose. He did not mean to imply that the >>book was bad. For instance, it may prefer to get back into book, rather than win >>a piece. >When the book is o.k., then there will be a reason not to win the piece. I'm not so sure about this. Consider the following example: FEN: r1bqkbnr/pppp1ppp/2n5/4p1N1/2B1P3/8/PPPP1PPP/RNBQK2R/ w KQkq - -r . -b -q -k -b -n -r -p -p -p -p . -p -p -p . . -n . . . . . . . . . -p . n . . . b . p . . . . . . . . . . . p p p p . p p p r n b q k . . r White to move. Here white can move Nf3 to reach a book position - or it could simply play Nxf7 and win the rook. I'm aware that this is just a silly constructed example and the question arises how to reach this position. But I'm pretty sure there are other examples which have the same problem and consist of more logical moves to reach. Kind regards, -sargon
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.