Expand description
A chess helpmate solver and unwinnability detector.
Given a position and an intended winner, determines whether a helpmate is achievable (a sequence of legal moves ending in checkmate by the intended winner) or proves that none exists.
Note that in a helpmate both players cooperate toward that goal: the intended winner delivers checkmate, but not necessarily by force.
See the README for the background motivating this crate, and for usage examples.
Enums§
- Winnability
- Result of a
winnabilityanalysis for the intended winner.
Functions§
- is_
unwinnable_ fast - Fast but incomplete check for unwinnability; cheaper than
winnabilitywhen a mating line isn’t needed. - winnability
- Full helpmate search for
intended_winner.