A developer announces version 2.0 of their Go chess library, featuring significant performance improvements with up to 40% faster move generation compared to existing libraries. The rebuild includes optimized bitboard implementation, robust PGN parsing, comprehensive documentation, and an optimized position type that forgoes
Sort: