- Magic Bitboard sliding attacks and pre-generated attack tables
- Make-Unmake position class
- 16-bit Move representation
- Extremely fast bulk-counted perft (over 180,000,000 NPS, single-threaded, without hashtable)
- Simple design for use in any chess engine
.png)
#include "position.h"
#include "tables.h"
#include "types.h"
int main() {
initialise_all_databases();
zobrist::initialise_zobrist_keys();
Position p;
Position::set("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq -", p);
std::cout << p;
MoveList<WHITE> list(p)
for(Move m : list) {
std::cout << m << "\n";
}
return 0;
}