SamuraiDangyo
commented
2 years ago True. No code. Is the fastest code. Your generator is fast. But the problem is how you pick the best moves? And how you put the moves in hash table first. Not crystal clear. It's in your EnumerateMoves. Need to study and compile it to figure it out. Regards
The fastest way to sort a list: Have no list at all. Zero code = zero runtime. There is a way to write a chess engine by directly building the wanted heuristics into the movegenerator itself and branching of right when you encounter a possible move. Its described here:
https://www.codeproject.com/Articles/5313417/Worlds-Fastest-Bitboard-Chess-Movegenerator
This way there is no make/unmake move and no list. Also every move is only visited once and not twice.