TalkChess.com

Partial success. New sample code. #pragma pack (push, 1) typedef struct { int sqr; int typ; // the type of piece, WP ... BK int clr; int prv; // the previous on board piece int nxt; // the next on board piece int val; // the value of the piece } ps; // piece-structure typedef struct { int castle; i...

This is actually the structure in my real code. typedef struct { int sqr; // the square the piece is on int typ; // the type of piece, WP ... BK int clr; // the side int prv; // the previous on board piece int nxt; // the next on board piece int val; // the value of the piece } ps; // piece-structu...

Double.c typedef struct { int prv; int nxt; } piece_s; typedef struct { int board[64]; piece_s piece[40]; } thread_s; Looking at this, I think you're missing an important piece of information, namely how to map to board index. You could either embed it into piece_s or use another array, say int boa...

Linked.asm .386 .model flat .data .code public c MoveGen MoveGen: push ebp mov ebp, esp mov ebx, [ebp+8] ; code to traverse t->piece[].nxt mov esp, ebp pop ebp ret end Let's try: ebx = thread_s * lea esi,[ebx + 4*64 + 4] // esi = &thread->piece[0].nxt // edx = current index xor edx, edx // you may ...

the default alignment MSVC uses for structures is 8 bytes, since you only seem to use 32 bit integers in your structs it should be very straightforward to calculate the proper offset. Sorry, but this is not true. The default alignment is simply the alignment of a member that requires maximum aligme...

I do have my engine Carnivor that has a similar GNUChess 4 style table look up move generator that on my 2013 i7-3930k 4.2 GHz processor single thread searches 20 million positions per second. And in the middle game searches 33 million positions per second. And I mean during a game and not just in ...

Michael Sherwin wrote: ↑

Tue Mar 12, 2019 6:02 am

I hit preview and it sent me to the login screen losing my post.

Yes, this used to happen to me as well. It taught me to always copy the whole post to the clipboard before previewing/posting.

Multicore processors (like the TR2990x) have poor memory access mechanics. In large data set code there tends to be more waiting while cores compete for data. My idea for chess engines is to dedicate one thread to the hashtable. The dedicated thread will poll a global data structure for store and r...

viditchess wrote: ↑

Tue Feb 26, 2019 7:23 pm

Now I get the following speed. Is it normal? I somehow feel that the speed gain should be more than 8k.

Do you realize you have 16 physical cores? You can'r run 2x faster with hyperthreading. ~1.3x is normal.

Ok, no problem. I think this clears up the confusion