Author: Robert Hyatt
Date: 14:02:14 03/31/00
Go up one level in this thread
On March 31, 2000 at 15:14:32, James Robertson wrote:
>On March 31, 2000 at 14:17:12, KarinsDad wrote:
>
>>I was thinking of implementing a SEE function in my program, however, I have run
>>into a few difficulties.
>>
>>Could someone please explain how they implement their SEE function, when they
>>use it, and what they use it for?
>>
>>Or possibly a good web site that explains it.
>>
>>Any help is appreciated.
>>
>>Thanks,
>>
>>KarinsDad :)
>
>Look at Crafty. It has a beautiful SEE function. I believe it was borrowed from
>the programmers of COKO who developed that particular algorithm. You'll have to
>talk to Dr. Hyatt for details though.
>
>James
The "tail end" of my SEE came from Coko IV. IE the piece of code that looks
like this:
next_capture--;
if(next_capture&1) sign=-1;
else sign=1;
while (next_capture) {
if (sign < 0) {
if(swap_list[next_capture] <= swap_list[next_capture-1])
swap_list[next_capture-1]=swap_list[next_capture];
}
else {
if(swap_list[next_capture] >= swap_list[next_capture-1])
swap_list[next_capture-1]=swap_list[next_capture];
}
next_capture--;
sign=-sign;
}
return (swap_list[0]);
The rest of it is original since (a) Coko wasn't a bitmap program and
(b) coko didn't worry about xray attacks (two rooks doubled, or a bishop
behind a queen, etc.)
Bob
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.