TalkChess.com

Does it cover all the possibilities? Has someone done a better one already? Any suggested changes? r3k2r/1bp2pP1/5n2/1P1Q4/1pPq4/5N2/1B1P2p1/R3K2R b KQkq c3 0 1 Thanks I don't remeber one position to test all cases, not sure if it's possible; if so then it would be really nice if you don't have to ...

in my regular search I never promote to bishop because that is clearly a waste of time. Is this really worth it? I always consider all legal moves in search and never even considered doing anything like that. Besides there are other ways to avoid wasting time on bishop underpromotions rather than c...

And the bsf and bsr instructions are clock tick inefficient. Does this still hold on modern CPUs? Anyway, since you're hunting for cycles, one more low hanging fruit for you: mark default case in your switches unreachable to eliminate bounds check, turning the switch into plain jump table, making y...

I misread as "Google's bloat...", thought that Google open sourced yet another masterpiece :D So this bfloat16 is basically float where you throw away 16 bits worth of mantissa. Packing/unpacking from 32-bit float should be trivial, so probably clever, but hey only 7 bits of mantissa, is it really e...

And a good compiler will translate a (considerable) switch-case in a jump table anyway. True, but you still need the switch inside the loop. Also, the compiler typically generates code to verify that the expression you switch on is in a valid range. You can still hint the compiler that default is u...

Yes, first n args are passed in registers, but I like having twice the number of registers more. I haven't done any serious assembly in years though (except for a stub that passes control to generated machine code for my scripting language) It's worth noting that addresses use 64-bit registers by de...

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 ...