Search found 363 matches

by phhnguyen
Fri Jul 09, 2010 2:16 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Xiangqi evaluation function
Replies: 7
Views: 1473

Re: Xiangqi evaluation function

Few suggestions for beginners that you may consider: 1) King tropism Implement King tropism in Xiangqi is little easier than Western chess because a Xq King can move in a small area only. You need to build King tropism for short range attacking pieces Pawns and Horses only. For long range attacking ...
by phhnguyen
Fri Jun 18, 2010 4:28 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: search speed
Replies: 6
Views: 1249

Re: search speed

1) i only make domove and don't do unmake, a game is an array of position so unmake move is somethink like "index--;" I guess that he means the method of implementation of perft, not only do/unmake. There are two ways, very little different in implementation but may give a difference on speed: if (...
by phhnguyen
Tue Jun 08, 2010 3:48 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Crafty Transpostion Table Question
Replies: 45
Views: 4298

Re: Crafty Transpostion Table Question

Opps, you have posted already when I have been typing so my previous post seems be out of date. You are right, if "atomic" data is less than 64 bit, your Xor is the best method. I have got wrong understand the size of atomic data when read your paper :( Thank you very much for making clearly everyth...
by phhnguyen
Tue Jun 08, 2010 3:40 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Crafty Transpostion Table Question
Replies: 45
Views: 4298

Re: Crafty Transpostion Table Question

I have re-read your post and your technical paper "Lockless Hashing" in which you divided 128 bit hash data into 2 parts (64 bit each) as "atomic" data. But as the previous post you means that "atomic" data may be 32 bit only? Or did I miss something? If yes (32 bit), I think I should surrender that...
by phhnguyen
Tue Jun 08, 2010 3:10 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Crafty Transpostion Table Question
Replies: 45
Views: 4298

Re: Crafty Transpostion Table Question

Bob, That is why I suggest that we should reorganize data. In one side of data, type, depth and value come together so you can use them safely. In the other side is the move of the correct position - not problem for using too. The 6-bit unuse you may simply ignore again. The benefit is clear: we can...
by phhnguyen
Tue Jun 08, 2010 2:14 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Crafty Transpostion Table Question
Replies: 45
Views: 4298

Re: Crafty Transpostion Table Question

SImple. This is the "lockless hashing" idea for parallel search. The issue is that different threads can store into the same hash table address at approximately the same time. There are two 64 bit values, the signature (A) and the score/etc (B). If two processors try to store at the same time, you ...
by phhnguyen
Fri Jun 04, 2010 3:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Crafty Transpostion Table Question
Replies: 45
Views: 4298

Re: Crafty Transpostion Table Question

I am wondering if it is another solution for "lockless" if we set the hash key in the middle of the hash data (e. g: 32 bit data + 64 bit hash key + 32 bit data). Any wrong pair of A and B will simply destroy the hash key and we can avoid using the Xor. The XOR trick is probably cheaper. Anyway, it...
by phhnguyen
Fri Jun 04, 2010 3:21 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Crafty Transpostion Table Question
Replies: 45
Views: 4298

Re: Crafty Transpostion Table Question

SImple. This is the "lockless hashing" idea for parallel search. The issue is that different threads can store into the same hash table address at approximately the same time. There are two 64 bit values, the signature (A) and the score/etc (B). If two processors try to store at the same time, you ...
by phhnguyen
Fri May 07, 2010 6:20 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Visual C++ 6.0 vs 2008?
Replies: 12
Views: 2137

Re: Visual C++ 6.0 vs 2008?

Mincho Georgiev wrote:MSVC++ 6.0 doesnt support 'long long' types, keep that in mind.
Do you mean 64 bit integer? In VC6.0 we can declare int64_t or LONG LONG.

I can develop most of chess jobs, from engine to GUI, using only VC6.0. However, it is too "old" to continue to use.
by phhnguyen
Fri May 07, 2010 2:10 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Visual C++ 6.0 vs 2008?
Replies: 12
Views: 2137

Re: Visual C++ 6.0 vs 2008?

Thanks all. Now it is clear to me. I will use VS2008. I guess some my friends "hate" VS200x because they use it for C# and compare with Java IDEs.

BTW, does anyone compare VS200x with gcc (in Windows)? Any change for gcc (in term of performance)?