TalkChess.com

My analysis and testing have lead me to conclusion that countermove & follow-up history counters help with move ordering at all-nodes, because cut-nodes are already almost optimally ordered... what happens is that at all-nodes this history counters help with finding out new PV lines... because of su...

I am programming in both. Some functions like initialization functions and engine protocol functions are in C. Search functions will be in assembler. MSVC can compile both kind of files and link them. I know how to access non nested C structures from the .asm file. But nowhere shows me how to acces...

RFC, would be interested in any possible design flaws you see... How do you define design flaw? I am Software Architect, and what you are trying to do is something completely new, so there is no established background theory/knowledge that can be used to judge whether something is a "design flaw" o...

(1) This is "classical" table-based move generation, you might check chessprogramming wiki for more information... HGM correctly notices that this approach was implemented in GnuChess (version 5 was bitboard-based, so you have to look for version 4). there are different ways of organizing data insid...

My attemps are mostly improving Andscacs positionally, without forgetting other more standard approaches. Not much success for the moment... I feel your pain... improving evaluation function is hard... it seems that cognitive distance between ideas in our head and C/C++ code is too big for us, and ...

We humans are really, really bad at predicting the future[*]. Hello Dann, small digression... long time ago, in 1999., when I started with chess programming, there was very little material available online... one of the rare places where I got my chess stuff was your ftp server... and I never got t...

I'm posting my bold predictions, in hope of open, constructive discussion without trashing and trolling... hopefully, you have something to say and have predictions of yours, too... Right off the bat, let's address A0/leela chess phenomenon. Obviously, they are here to stay... it is practically THE ...

Also, very weird thing is that if you do staged move generation (caps and non-caps separately) you lose a lot of speed... it is normal to lose 10% or maybe even a little more (depends on the quality of implementation), but you halved your nps! that's weird...

Lasse, that's fast, damn fast... I'm impressed... Let me get this straight: you managed to beat QPerft with almost double nps count? No additional tricks? no hash table, no special SSE instructions, no copy-make tricks? I just don't believe bitboards can go that fast... :twisted: specially if you us...

Fantastic work!

This must've taken a LOT of effort!