Search found 724 matches

by jwes
Wed Apr 18, 2007 7:17 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Compiler switches
Replies: 16
Views: 17712

Re: Compiler switches

I read in the intel optimization manual that the bit operations are now very fast in the Core 2 Duo. Does the Intel compiler use these ? E.g., translate

if (x & (1 << n))
do something
x &= ~(1 << n)

to

BTR x,n
JNC xx
do something
xx:
by jwes
Sat Apr 07, 2007 7:34 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: WCSAC: nineteen possible cooks
Replies: 12
Views: 12764

Re: WCSAC: nineteen possible cooks

The nice thing about the cheap UPSs is that they handle the short power intteruptions of a few seconds. Those are not uncommon where I live.
by jwes
Tue Mar 20, 2007 12:26 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Check idea + bittwiddler request
Replies: 17
Views: 21490

Re: Check idea + bittwiddler request

You have given me a better idea. At the start of move generation, calculate bitmaps of squares that attack the opposing king for each of Q,R,B,N, and P. Then use these bitmaps with the move bitmaps to generate checking moves separately. Discovered checks are only a little more work. When finding the...
by jwes
Mon Mar 19, 2007 6:39 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Check idea + bittwiddler request
Replies: 17
Views: 21490

Check idea + bittwiddler request

I had an idea about deternining if a move gives check (the new? part is about discovered check). A move gves check iff 1. a. The piece moved is not a slider and it attacks the opposing king. b. The piece moved is a slider and there is a horizontal, vertical, or diagional line between the to square a...