I've been playing a bit with the intel compiler, and it is actually better than the microsoft one (it might only be for an intel processor though).
I've gone from 978ms (diff code) to 950ms. Maybe not a huge difference, but I think it's worth its weight.

So, as far as I'm concerned: GCC < MS ...

I've been reading books about chess strategy to be able to code my AI properly, but the limit is never clear.
I was wondering what is generally a good time to change the state of the game to middle or end game, in chess programming?
What do stockfish, komodo, houdini do?

I've got the same config as you.

There's the O/x option, but doesn't seem to do anything more than O/2 according to the results.

I tried the GCC compiler again, with the given options, it's a little faster than before, but still slower than visual studio. I also tried the intel compiler, also ...

I see. I'm still not sold on bitboards, but I shall try for sure at some point.

I also wonder how well this guy's program would do. Obviously the search approach would be a little different, but I can see it work pretty well regardless. Still though, it's probably not for every machine.


As for me ...

I think the super piece is a slower alternative, but I might have missed a good idea while explorating this option.

What I ended up doing, even if still not the best, was to check both squares that an enemy pawn could occupy to put the king in check (while also checking if it's anything except a ...

We did it boys!

perft 6
Depth: 6
Nodes: 119060324
Time: 998 ms

I looked into it but couldn't find where to ask the compiler to unroll loops.

Btw, I didn't work with git on this project, and deleted obsolete versions as I coded so I don't have my code with loops anymore.

My bad thevineator, I was convinced you were coding in Java, for some reason.

Could you educate me with this following question: are things done with bitboards impossible with other structures? I reckon it's less memory consuming, but aren't 64bits essentially boolean arrays? Not trying to be a ...

The difference is huge.
A perft 5 is 1,3s with debug and a perft 6 is 1,05s with release.
I think it has to do with the fact that I manually unrolled my loops? Just a guess.

Btw, I have read about the intel c++ compiler. It seems to have a good reputation and they claim to be a better option than ...

It is updating pieces count (also light/dark squared bishops) and the fifty moves rule.

I have not done the hash yet, as I had in mind to use them to store moves generated in a TT and make it even faster (perhaps twice or more), and just wanted a raw result of my move generation atm, although I ...