| Commit message (Collapse) | Author | Age | Lines | |
|---|---|---|---|---|
| * | refactor: use bitboard trait | eug-vs | 2023-02-21 | -74/+89 |
| | | ||||
| * | perf: use De Bruijn algorithm for bitscanning | eug-vs | 2023-02-02 | -15/+35 |
| | | ||||
| * | perf: faster implementation of pop_count | eug-vs | 2023-02-02 | -4/+6 |
| | | ||||
| * | refactor: use Square as type everywhere | eug-vs | 2023-01-23 | -20/+16 |
| | | ||||
| * | feat: implement bitboard serialization | eug-vs | 2023-01-23 | -0/+32 |
| | | ||||
| * | feat: compute board occupancy and empty squares | eug-vs | 2023-01-22 | -2/+2 |
| | | ||||
| * | feat: align bitboard print with board print | eug-vs | 2023-01-22 | -2/+2 |
| | | ||||
| * | feat: improve bitboard print | eug-vs | 2023-01-21 | -5/+9 |
| | | ||||
| * | test: add visual prints | eug-vs | 2023-01-21 | -0/+1 |
| | | ||||
| * | feat: precompute first rank attacks | eug-vs | 2023-01-21 | -0/+3 |
| | | ||||
| * | feat: precompute knight and king attacks | eug-vs | 2023-01-21 | -0/+1 |
| | | ||||
| * | refactor: create board module | eug-vs | 2023-01-21 | -20/+0 |
| | | ||||
| * | feat: add Square enum | eug-vs | 2023-01-21 | -0/+21 |
| | | ||||
| * | refactor: do not pass u64 by reference | eug-vs | 2023-01-21 | -17/+16 |
| | | | | | | This is pointless since size of a pointer is also 64 bit on x64 systems, so we are not saving any memory at this point | |||
| * | refactor: do not wrap Bitboard into struct | eug-vs | 2023-01-21 | -23/+49 |
| | | ||||
| * | feat: implement Bitboard.pop_count() | eug-vs | 2023-01-20 | -0/+42 |
 |
index : chessnost | |
| Somewhat decent chess engine written in Rust |
| aboutsummaryrefslogtreecommitdiff |