Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How is this ply search depth calculated?

Author: Tim Foden

Date: 01:10:50 07/28/04

Go up one level in this thread


On July 28, 2004 at 02:07:15, Gopikrishna wrote:

>On July 27, 2004 at 18:27:37, Robert Hyatt wrote:
>
>>On July 27, 2004 at 18:07:31, Gopikrishna wrote:
>>
>>>5   0.030  -3.849   35581  Nf5 {++} Qb1+ 2. Kf2 fxe3+ 3. Ke2 Qe1+ 4. Kxe1
>>>                               exd2+ 5. Kxd2
>>>6   0.061  -1.326   70597  Nf5 {++} Qb1+ 2. Kf2 fxe3+ 3. Ke2 Bf3+ 4. gxf3 Bb4
>>>                               5. Qg5+ Kf8 6. Qg7+ Ke8 7. Qxh8+ Bf8 8. Nxe3
>>>
>>>Like 5 ply search means its just normal moves excluding check and capture
>>>extensions right? So it can be (5 normal moves + 3 check moves + 2 capture
>>>moves) right?
>>
>>
>>Who knows.  Could be 5 plies + checks + captures + threats + passed pawn pushes
>>+ singular moves + who-knows-what.  Depends on the program/programmer...
>
>No like I mean how do you all calculate? That is my doubt is if suppose any
>check move is made, then that is not counted right?

No.  You have the cause and effect the wrong way around.

 I mean its an extension I
>believe? And similarly for captures also right? So suppose if we are searching 4
>plies deep and if there is 2 check moves then we effectively search 6 plies deep
>right?

Yes, this is the right way around.

>>>5   0.030  -3.849   35581  Nf5 {++} Qb1+ 2. Kf2 fxe3+ 3. Ke2 Qe1+ 4. Kxe1
>>>                               exd2+ 5. Kxd2

In the above, the program was saying: "search 5 moves deep".

The logic during the search would go something like this:

Depth=5...  Nf5
Depth=4...  Qb1+
Depth=4...  Kf2
Depth=3...  fxe3+
Depth=3...  Ke2
Depth=2...  Qe1+
Depth=2...  Kxe1
Depth=1...  exd2+
Depth=1...  Kxd2
Depth=0...  <empty q-search>

Does this make it any clearer at all?  Or just more confusing?  :)

Cheers, Tim.



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.