bump version

iCodeSometime · Nov 30, 2022 · 1483978 · 1483978
1 parent 46acd25
commit 1483978
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 1 deletion.
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -1,3 +1,6 @@
+v0.0.5
+ - Fixed castling san generation
+
 v0.0.4
  - Added `Board::legal_destinations_from` to get the bitboard representing all legal destinations from a given square.
 

diff --git a/Cargo.toml b/Cargo.toml
@@ -1,6 +1,6 @@
 [package]
 name = "candidate"
-version = "0.0.4"
+version = "0.0.5"
 edition = "2021"
 authors = ["Kenneth Cochran <[email protected]>", "Jordan Bray <[email protected]>"]
 description = "This is a fast chess move generator.  It has a very good set of documentation, so you should take advantage of that.  It (now) generates all lookup tables with a build.rs file, which means that very little pseudo-legal move generation requires branching.  There are some convenience functions that are exposed to, for example, find all the squares between two squares.  This uses a copy-on-make style structure, and the Board structure is as slimmed down as possible to reduce the cost of copying the board.  There are places to improve perft-test performance further, but I instead opt to be more feature-complete to make it useful in real applications.  For example, I generate both a hash of the board and a pawn-hash of the board for use in evaluation lookup tables (using Zobrist hashing).  There are two ways to generate moves, one is faster, the other has more features that will be useful if making a chess engine.  See the documentation for more details."