Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: a question for programmers about the search depth

Author: blass uri

Date: 10:58:22 12/24/98

Go up one level in this thread



On December 24, 1998 at 13:52:39, James T. Walker wrote:

>On December 24, 1998 at 11:02:09, blass uri wrote:
>
>>
>>On December 24, 1998 at 10:52:40, blass uri wrote:
>>
>>>
>>>Suppose you do a brute force search to depth x then what is the longest lines
>>>that you may search?
>>
>>I mean seeing everything for x plies when I say depth x.
>>
>>Uri
>>
>>
>>
>>
>>
>>>
>>>I understood that for Junior the longest line is at most 4x and  for crafty the
>>>longest line is at most 2x.
>>>
>>>correct me if I am wrong
>>>
>>>What is the longest line for other engines
>>>>>>>>>>>>>>>>
>Hello Uri,
>This may be off the post a little but have you seen the "Mate in 30" at the
>Rebel site that Rebel 10 solves in 1 second ?
>Jim Walker

I saw it and I understand that it is because of singular extensions in cases
when one side has only one legal move.

The question about Rebel is what is the maximal number of plies that Rebel
extend when you do not consider moves when 1 side has only one legal move or
replies to these moves.

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.