Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Opening Books / Tablebases

Author: blass uri

Date: 08:52:44 05/10/00

Go up one level in this thread


On May 10, 2000 at 10:09:47, William H Rogers wrote:

>We saw a game played last year with the computer winning the game without ever
>getting out of its opening book. It gave mate without ever having to use its
>evaluation engine. I did not and still don't think that unlimited books should
>be allowed. What I mean by that is, I don't think that computer books should be
>allowed to go any deeper than say 10 moves. If this were the case, I think that
>the games would be more realistic and even whether they played humans or other
>computers. I know that a lot of people disagree with me, but this is my feeling
>about the subject.
>Bill

Cases when the computer is winning a game without ever getting out of book are
rare.

It is also easy to get computers out of book in less than 10 moves without
getting a bad position.

Uri



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.