v1.0.0 - Initial Release!

This is the first release of byte-knight. Based on play against stash, the estimated ELO of byte-knight is around ~1800. The following features are implemented in this version:

Search

• Iterative deepening
• Negamax with a/b pruning
• Quiescent search
• Move ordering using basic MVV/LVA table
• PeSTO based evaluation with tapering using the PeSTO PSQT values
• Transposition table (used for move ordering and cutoffs)

Game

I've written my own board representation complete with legal and pseudo-legal move generation as well as magic bitboards for sliding piece attacks. Performance is acceptable and will likely be improved on in the future.

---

These release notes are auto-generated by Github.

What's Changed

• Fix generating sliding attacks (include edges) by @DeveloperPaul123 in #1
• Fix perft and move generation by @DeveloperPaul123 in #2
• feat: legal move generation by @DeveloperPaul123 in #3
• feat: add open bench support by @DeveloperPaul123 in #4
• fix: issues in move ordering and search by @DeveloperPaul123 in #5
• fix: standing pat eval was backwards by @DeveloperPaul123 in #6
• feat: re-enable qsearch by @DeveloperPaul123 in #7
• fix: issue with pin ray calculation in certain situations by @DeveloperPaul123 in #10
• chore: rename byte_board -> chess by @DeveloperPaul123 in #11
• feat: implement pesto evaluation using psqt tables by @DeveloperPaul123 in #13
• feat: add support for basic search cancelation by @DeveloperPaul123 in #14
• chore: update how tt-move scoring is done. by @DeveloperPaul123 in #16
• fix: open-bench crashes by @DeveloperPaul123 in #17
• fix: clippy suggestions by @DeveloperPaul123 in #15
• refactor: simplify the input hander by @DeveloperPaul123 in #18
• fix: remove unsafe code by @DeveloperPaul123 in #20
• chore: minor tweaks and fixes by @DeveloperPaul123 in #21
• refactor: restructure project by @DeveloperPaul123 in #23
• chore: update ci runner images to be explicit by @DeveloperPaul123 in #25
• chore: add documentation by @DeveloperPaul123 in #27
• fix: store tt table per game, not per search by @DeveloperPaul123 in #28
• chore: nuke search by @DeveloperPaul123 in #29
• feat: re-add qsearch to main search by @DeveloperPaul123 in #30
• feat: implement (again) transposition table by @DeveloperPaul123 in #31
• feat: shrink the tt entry object size by @DeveloperPaul123 in #32
• fix: bug in psqt by @DeveloperPaul123 in #34
• chore: add unit tests for MVV/LVA eval for ordering by @DeveloperPaul123 in #35
• chore: prep for 1.0.0 release by @DeveloperPaul123 in #36

New Contributors

• @DeveloperPaul123 made their first contribution in #1

Full Changelog: https://github.com/DeveloperPaul123/byte-knight/commits/v1.0.0