Search found 705 matches

by smatovic
Thu Feb 03, 2011 6:22 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Qsearch and MVV-LVA
Replies: 6
Views: 1164

Re: Qsearch and MVV-LVA

Do you mean maybe MVV/LVA in one and LVV/MVA in the other???
Yes, thats what i mean.
Thank you for correcting my wording.
by smatovic
Thu Feb 03, 2011 5:28 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Qsearch and MVV-LVA
Replies: 6
Views: 1164

Qsearch and MVV-LVA

I achieve the best nodes/seconds while using ascending MVV-LVA in AlhbaBeta and descending MVV-LVA in QSearch.

Is this common?

--
Srdja
by smatovic
Sat Jan 29, 2011 5:26 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Programming language features for computer chess
Replies: 28
Views: 7907

Re: Programming language features for computer chess

I tried to port the MicroMax 0x88 movegeneration to opencl. on different GPUs. It performed very slow compared to the available computing power. I guess the SIMD-like GPU-architecture and the loop-iterations from 0x88 move generation exclude each other. A Magic BitBoard approach couldnt be completed...
by smatovic
Mon Jul 05, 2010 7:13 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: GPGPU Chess Engine for Stockfish!!!
Replies: 4
Views: 1437

Re: GPGPU Chess Engine for Stockfish!!!

Do I have to change the entire code to have stockfish optimized for parallel computation or will the code structure allow me to insert the new code in the legacy one without changing the original one. Imo you have to redesign the complete code and architecture to perform well on a GPU. So it could ...
by smatovic
Mon Jun 21, 2010 6:13 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: move structure
Replies: 14
Views: 2492

Re: move structure

...ran some tests...packing and unpacking lowers performance significantly.
by smatovic
Sun Jun 20, 2010 3:53 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Vector problem - square addition
Replies: 12
Views: 1418

Re: Vector problem - square addition

hmm, maybe you should init the result array

Code: Select all

int result[] = {0,0,0,0,0,0,0,0};
by smatovic
Sun Jun 20, 2010 11:31 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Vector problem - square addition
Replies: 12
Views: 1418

Re: Vector problem - square addition

What is result[] doing ? Assumed the score for an position is stored in sq[] then you got the total score of a file in result[]. Where result[0] is file a and result[7] is file h. for (i =0; i<64; i++) { result[i-(i&56)]+=sq[i]; } for (i =0; i<8; i++) { cout << result...
by smatovic
Sat Jun 19, 2010 5:37 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: move structure
Replies: 14
Views: 2492

Re: move structure

Ok, i got a clue how this works....will think about that.
by smatovic
Sat Jun 19, 2010 4:08 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: move structure
Replies: 14
Views: 2492

Re: move structure

would be a reasonably efficient way to generate moves.
I dont get it. What is the content of nextMoveTable ?
by smatovic
Sat Jun 19, 2010 2:50 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Vector problem - square addition
Replies: 12
Views: 1418

Re: Vector problem - square addition

not sure if this is what you look for:

Code: Select all

result&#91;8&#93; /* 0-7 => a-h */

for &#40;i =0; i<64; i++)
    result&#91;i-&#40;i&56&#41;&#93;+=sq&#91;i&#93;