Author: Peter Fendrich
Date: 00:24:55 04/21/99
Go up one level in this thread
On April 21, 1999 at 02:11:50, Marc-Philippe HUGET wrote: >On April 20, 1999 at 15:37:19, Christophe Theron wrote: > > >>>(e4(e5(d4 ...)(Nf6 ...))(d4(d5 ...)) >>And how do you handle transpositions? I have an idea, but I would like to hear >>yours. > >Hi, > >Transpositions are very simple since after each (, you are one-move forward and >after each ), you are one-move backward. So, if you have e4, you play the move >and you are in one position, after e5 you are in another position. It is a >depth-first search in a tree, you do and undo moves. In fact, with this kind of >books, you play moves until you find the correct position and then you play the >next move. > >After e4, position p1 >After e5, position p2 >After d4, position p3 and so on, if you finish the line beginning with d4 >You are after e5 and position p2 >After Nf6, position p4 etc. > >Marc-Philippe I don't get it. What happen after the opponent makes a move in the game? We now have the position p. Does the program search all of the book from the beinning to find p? //Peter
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.