Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: SEE Function

Author: Tom Kerrigan

Date: 22:34:50 04/07/00

Go up one level in this thread


On April 07, 2000 at 23:20:54, Robert Hyatt wrote:

>>I still disagree. Didn't DB do a quick evaluation in ~4 cycles? So going back to
>>my example, the time to search 2/5 capture moves using MVV/LVA is:
>>
>>generate moves = 2 * 2
>>make moves = 1 * 2
>>eval = 2 * 8
>>=> 22 cycles
>>
>>And if you use SEE:
>>
>>generate moves = 2 * 5
>>SEE = 5 * 5
>I don't see 5*5 cycles in SEE.  I see 5 to enumerate the capturing pieces,
>5 to minimax the score.  10 total...  That is definitely cheaper than searching
>a node, which takes 10 clock cycles in DB.  Because in the above case you
>would have to search up to 10 nodes (5 captures per side) which is 100 clocks.

I meant that the SEE would take on average 5 cycles, and it would have to be
done for 5 different moves.

Searching a node might take 10 cycles for DB. And adding a SEE would add a
significant number of cycles to many of those nodes. That's exactly my point.

-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.