Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: computer calculations of number of ways to play first 10-ply

Author: Tom Kerrigan

Date: 10:33:34 07/29/98

Go up one level in this thread


On July 29, 1998 at 13:21:05, Danniel Corbit wrote:

>On July 29, 1998 at 10:48:44, Tom Kerrigan wrote:
>
>>On July 29, 1998 at 10:06:43, Danniel Corbit wrote:
>>
>>>Let's say, for the sake of jihad, that we define sensible moves in the following
>>>manner:
>>>From a given FEN position, look at what every GM who has ever visited that
>>>position has done.
>>>From the same FEN position, let every top commercial and amateur program examine
>>>that position for 24 hours.
>>>At this point, we would have, I suspect, a small list of possible very good
>>>moves, a mid sized list of so-so moves, and a large list of bad moves.
>>
>>Perhaps.
>>I don't know what this would accomplish, and it seems like similar things have
>>been done by people who do opening book stuff.
>>Basically, what you're writing isn't really related to the topic at hand.
>I disagree.  It is related, because I believe that an exhaustive search has very
>little value, and a careful analysis of the "ahem" good moves has a very high
>value.

Well, if you already know what the good moves are, why don't you just play them
and get on with it?

Your point seems to be that exhaustive search is useless. I won't even begin to
debate this because it's impossible anyway. When it's possible, we can debate
about it. :)

Cheers,
Tom



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.