Author: Christophe Theron
Date: 08:33:17 04/21/99
Go up one level in this thread
On April 21, 1999 at 06:06:22, Marc-Philippe HUGET wrote:
>On April 21, 1999 at 03:24:55, Peter Fendrich wrote:
>
>
>>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
>
>Hi,
>
>yes, of course but good books are not similar to fat books. You can have a very
>good book with 1 million moves and with this system, it is very easy to go
>through the book to find the right position and it is very fast. Either you can
>only choose the first move for this position or all moves for this position but
>it is very fast to do and undo moves, just some changes in the bitboard or in
>the chessboard.
>
>Marc-Philippe
Not so fast I think.
With a 1 million move book, and provided you can do/undo 100000 moves per
second, it will take you 10 seconds to browse thru the entire book.
If you are playing a blitz game, I think this begins to be a real problem.
Further, a speed of 100000 moves per second is not realistic. You have the disk
accesses, or at least the calls to the file system (even if the book file is
already in the cache), and if you are running on a rather slow computer, say a
P100, finding a move in the book could easily take 20 or 30 seconds.
I would not manage my book this way. Tiger often play games in my chess club,
running on a 386sx 20MHz laptop computer. The chess players here love to play
blitz games. If I was using your book method, there would be some cases where
finding the right move would take more than 5 minutes!!!
Christophe
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.