rustio rustio.net

candidate vs chess vs chess_

Side-by-side comparison of Rust crates

45
candidate
growingv0.0.5

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.

52
chess
growingv3.2.0

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 tabels 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.

52
chess_
experimentalv3.3.2

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.

Core Metrics

candidatechesschess_
Health Score455252
Total Downloads6.9K181.8K86
30d Downloads000
Dependents02237
Releases5363
Last Updated1410d ago2038d ago6d ago
Age3y 10m10y 4m1m

Health Breakdown

candidate
Maintenance
8
Quality
16
Community
3
Popularity
5
Documentation
13
chess
Maintenance
6
Quality
19
Community
9
Popularity
6
Documentation
12
chess_
Maintenance
14
Quality
16
Community
5
Popularity
2
Documentation
15

Technical Details

candidatechesschess_
Version0.0.53.2.03.3.2
Stable (≥1.0)✗ No✓ Yes✓ Yes
LicenseMITMITMIT
Dependencies755
Crate Size53KB46KB46KB
Features300
Yanked %0.0%0.0%0.0%
Edition202120182024
MSRV——1.88.0
Owners111

Quick Verdict

  • •chess leads with a health score of 52/100, but none of the options score above 80.
  • •chess is depended on by 223 crates — strongest ecosystem trust.
  • •⚠ candidate, chess have not been updated in over a year.
  • •candidate is pre-1.0 — API may change.