Skip to content

Releases

Cadence 0.6.0

Choose a tag to compare

@github-actions github-actions released this 14 Nov 00:18
Immutable release. Only release title and notes can be modified.
170f5e3

Cadence 0.6.0, built from 170f5e3 at the tag 0.6.0. Bench: 34686410 nodes.

Seven binaries: Windows and Linux x86-64, each in an AVX2 build and a generic one for processors without AVX2 (it still needs POPCNT), Linux aarch64, macOS arm64, and macOS x86-64 in an AVX2 build. SHA256SUMS lists their checksums, with those of bench.txt, which holds the bench count every binary was checked against, and of the install scripts. Each binary carries a build provenance attestation: gh attestation verify <file> --repo grounzero/cadence.

The macOS binaries are not notarized. Clear the quarantine flag with xattr -d com.apple.quarantine <file>, or build from source.

install.sh (Linux, macOS, and Windows under Git Bash or WSL) and install.ps1 (Windows PowerShell) install the binary for the system they run on once its SHA-256 matches SHA256SUMS and its bench matches bench.txt. Where no binary fits or the check fails, as on an Intel Mac without AVX2, they build the release from source and hold the build to the same bench. Without --version they take the latest stable release, or while none is published they offer the newest pre-release; --version 0.6.0 names this one. Their SHA-256s, as in SHA256SUMS:

c9fc68954fd1eef3906661002bfe3c841fea3b3f44474ccc3975c835094634c0  install.sh
d2f3aceb7a501f9ad326146bf31f12fafbe4fbf627d4a05cffb946b9c001e6e0  install.ps1

From source: git clone https://github.com/grounzero/cadence.git, git checkout 0.6.0, cargo build --release; the binary is target/release/cadence. On an x86-64 processor without AVX2, build with cargo build --release --config .cargo/x86-64-generic.toml.

Everything since 0.5.23, published first as four release candidates, each
a pre-release: 0.6.0-rc.1 (2026-11-06), 0.6.0-rc.2 (2026-11-08),
0.6.0-rc.3 (2026-11-10) and 0.6.0-rc.4 (2026-11-13). It adds release
binaries and install scripts, scores a position where neither side has the
material to mate as a draw, and fixes how the engine answers the GUI, uses
the tablebases and ponders.

Added

  • Tests: proofs, checked by the Kani model checker on every change, that
    the score encoding, the transposition table's entries and buckets, the
    history and correction updates, the pruning margins and reductions, and
    the time budget stay within their bounds. A failed proof fails the build.
  • The README installs from the latest release's own scripts.
  • The installers verify each binary (checksum, bench and, with gh, its build
    attestation) and say which checks ran.
  • They upgrade older installs, report when you're up to date, and ask before
    a downgrade or replacing a different build.
  • Clearer errors when a system blocks the binary, and uninstall removes only
    what the installer added.
  • Releases: each release builds seven binaries, Windows and Linux x86-64
    each in an AVX2 build and a generic one, Linux aarch64, macOS arm64 and
    macOS x86-64, and publishes them with SHA256SUMS, bench.txt, the two
    install scripts and a provenance attestation for each binary, made by the
    release workflow run at the release's tag; a manual run drafts and attests
    a release only when run at its tag, and never once it is published.
  • The test log: docs/testing/sprt-log.csv gives every SPRT, passed or
    failed, with its games and result.

Changed

  • Search: a position where neither side has the material to mate is scored
    as a draw. The bench rises from 24,819,899 to 34,686,410 nodes.
  • Tools: setup-worker.py refuses a configuration inside the repository,
    and git ignores worker.json and credentials.cadence. The Makefile
    clears an inherited RUSTFLAGS, and with it CARGO_ENCODED_RUSTFLAGS
    and every CARGO_TARGET_<triple>_RUSTFLAGS.
  • The README gives a table of strength estimates from our own gauntlets
    against rated engines, and docs/calibration/strength.md publishes each
    gauntlet's games and fit, and how to check them.
  • Tools: the pre-commit hook rebuilds its boundary checker when any file
    the checker is built from is newer than it, not only its main source.
  • The README is shorter. Getting started offers a release's binaries first,
    then the install scripts, and the README ends with acknowledgements and
    the license. Setting up an OpenBench worker and creating a test are
    explained by python3 openbench/setup-worker.py --help instead.
  • UCI: under UCI_LimitStrength, the engine prints only the lines the GUI
    asked for, and reports the move it plays.
  • UCI: SyzygyPath is taken exactly as sent, spaces included.
  • The README documents every UCI option, the tools and the generic build.
  • Search: its state is grouped into its counters, its move-ordering
    tables, the run's result and its clock, with no change to play: every
    bench position searches the same nodes as before.

Fixed

  • UCI: position sent during a search stops and joins that search first.
    The search could answer bestmove for the old position after the new
    one had been set.
  • UCI: setoption name Hash sent during a search stops and joins that
    search before the table is resized. The search could end without its
    bestmove.
  • Tools: perft --divide writes castling as the position does, the king
    taking its rook only where a castling king or rook stands off its
    standard square. A standard position listed e1h1 and e1a1.
  • Tools: datagen extract publishes its training and holdout files as a
    pair, so a failure between the two no longer leaves one of them
    published.
  • Tools: bench runs its searches on the 16 MB stack the engine's search
    threads have, as the tests now do, rather than the system's default.
  • Pondering: after a ponderhit, the iteration the search was running stops
    at the move's planned time until an iteration completes. It could run on
    to the limit of half the remaining clock and then play the ponder's last
    result.
  • UCI: after a ponderhit, the reported time and nps count from the
    go, as nodes does. nps was overstated.
  • Tablebases: at a won root, only the winning moves that reach a capture
    or a pawn move soonest are searched. The losing side is unchanged.
  • Search: when the tablebases cut a node, the transposition table keeps
    that node's move.
  • Tablebases: a root the tables rank reports the tables' verdict as its
    score, a root move is ranked under the fifty-move counter as the
    tablebase library ranks it, each table file is opened once and one that
    fails is named, and stop and the clock are checked between root probes.
  • UCI: the clock starts when go is read, and every go is answered,
    with bestmove 0000 after a position command that failed. A clock
    value that is not a whole number reads as zero, a go limit too large
    to hold reads as the largest the engine holds, the count in go mate is
    clamped, a root with no legal move reports a score line, and an input
    line is limited to a mebibyte.
  • Positions: a FEN with impossible material is refused, castling letters
    with no rook to castle with are dropped, and the move counters are
    clamped.
  • Search: a reduction stays below the depth it reduces, a finished line is
    kept, and under a node limit with helper threads the main thread
    finishes its first iteration. perft refuses a depth deeper than the
    search allows.
  • Version: a build calls itself by the release's version only at that
    version's annotated tag, on an unmodified tree.
  • Tools: bench, perft, spsa and magics exit with a failure when
    they cannot write their output, texel checks its arguments and its
    weights, and datagen caps its workers, keeps its games in order and
    refuses a record whose moves do not end as it says.
  • Build: the generic Windows build keeps SSE3.

Test 76, for the transposition table fix: -0.27 (between -2.75 and
+2.20), a self-play estimate against the build before it at the short
control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the fix costs strength. It
was stopped at 24,106 games before it decided, and the fix was taken on a
result that shows no cost. It is not a rating.

Test 77, for keeping the fastest wins at a won tablebase root: +0.36, give
or take 1.63, a self-play estimate against the build before it at the
short control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the change costs strength,
and it passed at 54,626 games. It is not a rating.

Test 80, for scoring a position with no mating material as a draw: +2.73
(between -0.46 and +5.93), a self-play estimate against the build before it
at the short control. This was a non-regression test, which asks only
whether the change costs strength, and it passed at 15,760 games. It is not
a rating.

Cadence 0.6.0-rc.4

Cadence 0.6.0-rc.4 Pre-release
Pre-release

Choose a tag to compare

@github-actions github-actions released this 13 Nov 11:32
Immutable release. Only release title and notes can be modified.
9774120

Cadence 0.6.0-rc.4, built from 9774120 at the tag 0.6.0-rc.4. Bench: 34686410 nodes.

A release candidate, published as a pre-release.

Seven binaries: Windows and Linux x86-64, each in an AVX2 build and a generic one for processors without AVX2 (it still needs POPCNT), Linux aarch64, macOS arm64, and macOS x86-64 in an AVX2 build. SHA256SUMS lists their checksums, with those of bench.txt, which holds the bench count every binary was checked against, and of the install scripts. Each binary carries a build provenance attestation: gh attestation verify <file> --repo grounzero/cadence.

The macOS binaries are not notarized. Clear the quarantine flag with xattr -d com.apple.quarantine <file>, or build from source.

install.sh (Linux, macOS, and Windows under Git Bash or WSL) and install.ps1 (Windows PowerShell) install the binary for the system they run on once its SHA-256 matches SHA256SUMS and its bench matches bench.txt. Where no binary fits or the check fails, as on an Intel Mac without AVX2, they build the release from source and hold the build to the same bench. Without --version they take the latest stable release, or while none is published they offer the newest pre-release; --version 0.6.0-rc.4 names this one. Their SHA-256s, as in SHA256SUMS:

8699db9c460174885ade0d81b502f3efd33ec3be97805c47f865af471127906e  install.sh
43c1658df17ae918b9fd725ab9c06e2b7ee26046f19de1ead80fbe71895f69ee  install.ps1

From source: git clone https://github.com/grounzero/cadence.git, git checkout 0.6.0-rc.4, cargo build --release; the binary is target/release/cadence. On an x86-64 processor without AVX2, build with cargo build --release --config .cargo/x86-64-generic.toml.

A release candidate for 0.6.0, published as a pre-release, after
0.6.0-rc.3 of 2026-11-10. It scores a position where neither side has the
material to mate as a draw, stops a running search before position or a
new Hash takes effect, and has the install scripts ask only where there
is a choice to make.

Added

  • Tests: proofs, checked by the Kani model checker on every change, that
    the score encoding, the transposition table's entries and buckets, the
    history and correction updates, the pruning margins and reductions, and
    the time budget stay within their bounds. A failed proof fails the build.
  • Install scripts: install.sh for Linux, macOS, and Windows under Git
    Bash or WSL, and install.ps1 for Windows PowerShell. Each installs a
    release's binary for the system it runs on once the binary's SHA-256 and
    bench match the release's, or builds the release from source where no
    binary fits, and can download the 3-4-5 piece Syzygy tables. The README
    says how to run them.
  • Releases: each release builds seven binaries, Windows and Linux x86-64
    each in an AVX2 build and a generic one, Linux aarch64, macOS arm64 and
    macOS x86-64, and publishes them with SHA256SUMS, bench.txt, the two
    install scripts and a provenance attestation for each binary.

Changed

  • Search: a position where neither side has the material to mate is scored
    as a draw. The bench rises from 24,819,899 to 34,686,410 nodes.
  • Install scripts: they ask only before building from source, installing a
    compiler or Rust, replacing an install, changing the PATH or downloading
    the tablebases, and state the rest: the build they take, the folder and
    the binary's check. --generic and --dir are new names for
    --build generic and --prefix, which still work. The tablebase download
    shows its progress in megabytes and prints the folder for SyzygyPath on
    a line of its own, and after adding to the PATH they say how to run
    cadence before a new terminal opens.
  • Install scripts: without --version they take the latest stable release,
    or where none is published they name the newest pre-release, print the
    command that installs it and ask. A build from source names the tag it
    builds, and none is offered when nothing is published. A failed download
    is described in plain words, with the details in the log.
  • Install scripts: a token in GITHUB_TOKEN is sent with their requests to
    GitHub's API, and a refusal for GitHub's hourly limit on unauthenticated
    requests is named as one, with what to do.
  • The README gives a table of strength estimates from our own gauntlets
    against rated engines, and docs/calibration/strength.md publishes each
    gauntlet's games and fit, and how to check them.
  • Tools: the pre-commit hook rebuilds its boundary checker when any file
    the checker is built from is newer than it, not only its main source.
  • The README is shorter, starts with the install scripts and ends with
    acknowledgements. Setting up an OpenBench worker and creating a test are
    explained by python3 openbench/setup-worker.py --help instead.
  • UCI: under UCI_LimitStrength, the engine prints only the lines the GUI
    asked for, and reports the move it plays.
  • UCI: SyzygyPath is taken exactly as sent, spaces included.
  • The README documents every UCI option, the tools and the generic build.
  • Search: its state is grouped into its counters, its move-ordering
    tables, the run's result and its clock, with no change to play: every
    bench position searches the same nodes as before.

Fixed

  • UCI: position sent during a search stops and joins that search first.
    The search could answer bestmove for the old position after the new
    one had been set.
  • UCI: setoption name Hash sent during a search stops and joins that
    search before the table is resized. The search could end without its
    bestmove.
  • Tools: perft --divide writes castling as the position does, the king
    taking its rook only where a castling king or rook stands off its
    standard square. A standard position listed e1h1 and e1a1.
  • Tools: datagen extract publishes its training and holdout files as a
    pair, so a failure between the two no longer leaves one of them
    published.
  • Tools: bench runs its searches on the 16 MB stack the engine's search
    threads have, as the tests now do, rather than the system's default.
  • Pondering: after a ponderhit, the iteration the search was running stops
    at the move's planned time until an iteration completes. It could run on
    to the limit of half the remaining clock and then play the ponder's last
    result.
  • UCI: after a ponderhit, the reported time and nps count from the
    go, as nodes does. nps was overstated.
  • Tablebases: at a won root, only the winning moves that reach a capture
    or a pawn move soonest are searched. The losing side is unchanged.
  • Install scripts: under Git Bash on an Intel processor, install.sh
    chose the generic build where the AVX2 build runs. It now chooses as
    install.ps1 does.
  • Search: when the tablebases cut a node, the transposition table keeps
    that node's move.
  • Tablebases: a root the tables rank reports the tables' verdict as its
    score, a root move is ranked under the fifty-move counter as the
    tablebase library ranks it, each table file is opened once and one that
    fails is named, and stop and the clock are checked between root probes.
  • UCI: the clock starts when go is read, and every go is answered,
    with bestmove 0000 after a position command that failed. A clock
    value that is not a whole number reads as zero, a go limit too large
    to hold reads as the largest the engine holds, the count in go mate is
    clamped, a root with no legal move reports a score line, and an input
    line is limited to a mebibyte.
  • Positions: a FEN with impossible material is refused, castling letters
    with no rook to castle with are dropped, and the move counters are
    clamped.
  • Search: a reduction stays below the depth it reduces, a finished line is
    kept, and under a node limit with helper threads the main thread
    finishes its first iteration. perft refuses a depth deeper than the
    search allows.
  • Version: a build calls itself by the release's version only at that
    version's annotated tag, on an unmodified tree.
  • Tools: bench, perft, spsa and magics exit with a failure when
    they cannot write their output, texel checks its arguments and its
    weights, and datagen caps its workers, keeps its games in order and
    refuses a record whose moves do not end as it says.
  • Build: the generic Windows build keeps SSE3.

Test 76, for the transposition table fix: -0.27 (between -2.75 and
+2.20), a self-play estimate against the build before it at the short
control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the fix costs strength. It
was stopped at 24,106 games before it decided, and the fix was taken on a
result that shows no cost. It is not a rating.

Test 77, for keeping the fastest wins at a won tablebase root: +0.36, give
or take 1.63, a self-play estimate against the build before it at the
short control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the change costs strength,
and it passed at 54,626 games. It is not a rating.

Test 80, for scoring a position with no mating material as a draw: +2.73
(between -0.46 and +5.93), a self-play estimate against the build before it
at the short control. This was a non-regression test, which asks only
whether the change costs strength, and it passed at 15,760 games. It is not
a rating.

Cadence 0.6.0-rc.3

Cadence 0.6.0-rc.3 Pre-release
Pre-release

Choose a tag to compare

@github-actions github-actions released this 10 Nov 18:11
091e409

Cadence 0.6.0-rc.3, built from 091e409 at the tag 0.6.0-rc.3. Bench: 24819899 nodes.

A release candidate, published as a pre-release.

Seven binaries: Windows and Linux x86-64, each in an AVX2 build and a generic one for processors without AVX2 (it still needs POPCNT), Linux aarch64, macOS arm64, and macOS x86-64 in an AVX2 build. SHA256SUMS lists their checksums, with those of bench.txt, which holds the bench count every binary was checked against, and of the install scripts. Each binary carries a build provenance attestation: gh attestation verify <file> --repo grounzero/cadence.

The macOS binaries are not notarized. Clear the quarantine flag with xattr -d com.apple.quarantine <file>, or build from source.

install.sh (Linux, macOS, and Windows under Git Bash or WSL) and install.ps1 (Windows PowerShell) install the binary for the system they run on once its SHA-256 matches SHA256SUMS and its bench matches bench.txt. Where no binary fits or the check fails, as on an Intel Mac without AVX2, they build the release from source and hold the build to the same bench. They take the latest published release, which is never a release candidate, unless --version 0.6.0-rc.3 names this one. Their SHA-256s, as in SHA256SUMS:

910a8748b0c4c9cb96edfa6a58aa9a7a3e7236cf81eb3b750426af017990ab4c  install.sh
6b47a59a5aba27f2fcdcaf23f4a59a0faa09774e54693f38510ea942fe53647c  install.ps1

From source: git clone https://github.com/grounzero/cadence.git, git checkout 0.6.0-rc.3, cargo build --release; the binary is target/release/cadence. On an x86-64 processor without AVX2, build with cargo build --release --config .cargo/x86-64-generic.toml.

A release candidate for 0.6.0, published as a pre-release, after
0.6.0-rc.2 of 2026-11-08. It adds two fixes to pondering, and proofs that
CI checks on every change. The release checks run on our own machines have
passed.

Added

  • Tests: proofs, checked by the Kani model checker on every change, that
    the score encoding, the transposition table's entries and buckets, the
    history and correction updates, the pruning margins and reductions, and
    the time budget stay within their bounds. A failed proof fails the build.
  • Install scripts: install.sh for Linux, macOS, and Windows under Git
    Bash or WSL, and install.ps1 for Windows PowerShell. Each installs a
    release's binary for the system it runs on once the binary's SHA-256 and
    bench match the release's, or builds the release from source where no
    binary fits, and can download the 3-4-5 piece Syzygy tables. The README
    says how to run them.
  • Releases: each release builds seven binaries, Windows and Linux x86-64
    each in an AVX2 build and a generic one, Linux aarch64, macOS arm64 and
    macOS x86-64, and publishes them with SHA256SUMS, bench.txt, the two
    install scripts and a provenance attestation for each binary.

Changed

  • UCI: under UCI_LimitStrength, the engine prints only the lines the GUI
    asked for, and reports the move it plays.
  • UCI: SyzygyPath is taken exactly as sent, spaces included.
  • The README documents every UCI option, the tools and the generic build.
  • Search: its state is grouped into its counters, its move-ordering
    tables, the run's result and its clock, with no change to play: every
    bench position searches the same nodes as before.

Fixed

  • Pondering: after a ponderhit, the iteration the search was running stops
    at the move's planned time until an iteration completes. It could run on
    to the limit of half the remaining clock and then play the ponder's last
    result.
  • UCI: after a ponderhit, the reported time and nps count from the
    go, as nodes does. nps was overstated.
  • Tablebases: at a won root, only the winning moves that reach a capture
    or a pawn move soonest are searched. The losing side is unchanged.
  • Install scripts: under Git Bash on an Intel processor, install.sh
    chose the generic build where the AVX2 build runs. It now chooses as
    install.ps1 does.
  • Search: when the tablebases cut a node, the transposition table keeps
    that node's move.
  • Tablebases: a root the tables rank reports the tables' verdict as its
    score, a root move is ranked under the fifty-move counter as the
    tablebase library ranks it, each table file is opened once and one that
    fails is named, and stop and the clock are checked between root probes.
  • UCI: the clock starts when go is read, and every go is answered,
    with bestmove 0000 after a position command that failed. A clock
    value that is not a whole number reads as zero, a go limit too large
    to hold reads as the largest the engine holds, the count in go mate is
    clamped, a root with no legal move reports a score line, and an input
    line is limited to a mebibyte.
  • Positions: a FEN with impossible material is refused, castling letters
    with no rook to castle with are dropped, and the move counters are
    clamped.
  • Search: a reduction stays below the depth it reduces, a finished line is
    kept, and under a node limit with helper threads the main thread
    finishes its first iteration. perft refuses a depth deeper than the
    search allows.
  • Version: a build calls itself by the release's version only at that
    version's annotated tag, on an unmodified tree.
  • Tools: bench, perft, spsa and magics exit with a failure when
    they cannot write their output, texel checks its arguments and its
    weights, and datagen caps its workers, keeps its games in order and
    refuses a record whose moves do not end as it says.
  • Build: the generic Windows build keeps SSE3.

Test 76, for the transposition table fix: -0.27 (between -2.75 and
+2.20), a self-play estimate against the build before it at the short
control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the fix costs strength. It
was stopped at 24,106 games before it decided, and the fix was taken on a
result that shows no cost. It is not a rating.

Test 77, for keeping the fastest wins at a won tablebase root: +0.36, give
or take 1.63, a self-play estimate against the build before it at the
short control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the change costs strength,
and it passed at 54,626 games. It is not a rating.

Cadence 0.6.0-rc.2

Cadence 0.6.0-rc.2 Pre-release
Pre-release

Choose a tag to compare

@github-actions github-actions released this 08 Nov 15:09
18e9828

Cadence 0.6.0-rc.2, built from 18e9828 at the tag 0.6.0-rc.2. Bench: 24819899 nodes.

A release candidate, published as a pre-release.

Seven binaries: Windows and Linux x86-64, each in an AVX2 build and a generic one for processors without AVX2 (it still needs POPCNT), Linux aarch64, macOS arm64, and macOS x86-64 in an AVX2 build. SHA256SUMS lists their checksums, with those of bench.txt, which holds the bench count every binary was checked against, and of the install scripts. Each binary carries a build provenance attestation: gh attestation verify <file> --repo grounzero/cadence.

The macOS binaries are not notarized. Clear the quarantine flag with xattr -d com.apple.quarantine <file>, or build from source.

install.sh (Linux, macOS, and Windows under Git Bash or WSL) and install.ps1 (Windows PowerShell) install the binary for the system they run on once its SHA-256 matches SHA256SUMS and its bench matches bench.txt. Where no binary fits or the check fails, as on an Intel Mac without AVX2, they build the release from source and hold the build to the same bench. They take the latest published release, which is never a release candidate, unless --version 0.6.0-rc.2 names this one. Their SHA-256s, as in SHA256SUMS:

090005e0f9f85daab713a7f51a1cc98ba76b9a8869841b534d739dc83d038c3e  install.sh
cb067502ed9181368667fdd9dfffcc0e8859f744ff280289a97b9c39d26bc4cb  install.ps1

From source: git clone https://github.com/grounzero/cadence.git, git checkout 0.6.0-rc.2, cargo build --release; the binary is target/release/cadence. On an x86-64 processor without AVX2, build with cargo build --release --config .cargo/x86-64-generic.toml.

A release candidate for 0.6.0, published as a pre-release, after
0.6.0-rc.1 of 2026-11-06. It adds the change that keeps only the fastest
wins at a won tablebase root, pull request 189, which rc.1 left out while
its test ran, and a fix to the install script under Git Bash. The release
checks run on our own machines have passed.

Added

  • Install scripts: install.sh for Linux, macOS, and Windows under Git
    Bash or WSL, and install.ps1 for Windows PowerShell. Each installs a
    release's binary for the system it runs on once the binary's SHA-256 and
    bench match the release's, or builds the release from source where no
    binary fits, and can download the 3-4-5 piece Syzygy tables. The README
    says how to run them.
  • Releases: each release builds seven binaries, Windows and Linux x86-64
    each in an AVX2 build and a generic one, Linux aarch64, macOS arm64 and
    macOS x86-64, and publishes them with SHA256SUMS, bench.txt, the two
    install scripts and a provenance attestation for each binary.

Changed

  • UCI: under UCI_LimitStrength, the engine prints only the lines the GUI
    asked for, and reports the move it plays.
  • UCI: SyzygyPath is taken exactly as sent, spaces included.
  • The README documents every UCI option, the tools and the generic build.
  • Search: its state is grouped into its counters, its move-ordering
    tables, the run's result and its clock, with no change to play: every
    bench position searches the same nodes as before.

Fixed

  • Tablebases: at a won root, only the winning moves that reach a capture
    or a pawn move soonest are searched. The losing side is unchanged.
  • Install scripts: under Git Bash on an Intel processor, install.sh
    chose the generic build where the AVX2 build runs. It now chooses as
    install.ps1 does.
  • Search: when the tablebases cut a node, the transposition table keeps
    that node's move.
  • Tablebases: a root the tables rank reports the tables' verdict as its
    score, a root move is ranked under the fifty-move counter as the
    tablebase library ranks it, each table file is opened once and one that
    fails is named, and stop and the clock are checked between root probes.
  • UCI: the clock starts when go is read, and every go is answered,
    with bestmove 0000 after a position command that failed. A clock
    value that is not a whole number reads as zero, a go limit too large
    to hold reads as the largest the engine holds, the count in go mate is
    clamped, a root with no legal move reports a score line, and an input
    line is limited to a mebibyte.
  • Positions: a FEN with impossible material is refused, castling letters
    with no rook to castle with are dropped, and the move counters are
    clamped.
  • Search: a reduction stays below the depth it reduces, a finished line is
    kept, and under a node limit with helper threads the main thread
    finishes its first iteration. perft refuses a depth deeper than the
    search allows.
  • Version: a build calls itself by the release's version only at that
    version's annotated tag, on an unmodified tree.
  • Tools: bench, perft, spsa and magics exit with a failure when
    they cannot write their output, texel checks its arguments and its
    weights, and datagen caps its workers, keeps its games in order and
    refuses a record whose moves do not end as it says.
  • Build: the generic Windows build keeps SSE3.

Test 76, for the transposition table fix: -0.27 (between -2.75 and
+2.20), a self-play estimate against the build before it at the short
control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the fix costs strength. It
was stopped at 24,106 games before it decided, and the fix was taken on a
result that shows no cost. It is not a rating.

Test 77, for keeping the fastest wins at a won tablebase root: +0.36, give
or take 1.63, a self-play estimate against the build before it at the
short control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the change costs strength,
and it passed at 54,626 games. It is not a rating.

Cadence 0.6.0-rc.1

Cadence 0.6.0-rc.1 Pre-release
Pre-release

Choose a tag to compare

@github-actions github-actions released this 06 Nov 22:19
7aa1d91

Cadence 0.6.0-rc.1, built from 7aa1d91 at the tag 0.6.0-rc.1. Bench: 24819899 nodes.

A release candidate, published as a pre-release.

Seven binaries: Windows and Linux x86-64, each in an AVX2 build and a generic one for processors without AVX2 (it still needs POPCNT), Linux aarch64, macOS arm64, and macOS x86-64 in an AVX2 build. SHA256SUMS lists their checksums, with those of bench.txt, which holds the bench count every binary was checked against, and of the install scripts. Each binary carries a build provenance attestation: gh attestation verify <file> --repo grounzero/cadence.

The macOS binaries are not notarized. Clear the quarantine flag with xattr -d com.apple.quarantine <file>, or build from source.

install.sh (Linux, macOS, and Windows under Git Bash or WSL) and install.ps1 (Windows PowerShell) install the binary for the system they run on once its SHA-256 matches SHA256SUMS and its bench matches bench.txt. Where no binary fits or the check fails, as on an Intel Mac without AVX2, they build the release from source and hold the build to the same bench. They take the latest published release, which is never a release candidate, unless --version 0.6.0-rc.1 names this one. Their SHA-256s, as in SHA256SUMS:

f4a0dcd57be8963f911d4747c53eb678990cc522e16670eac169befdee6bbbf3  install.sh
d26cc76865fcbeb0900c5791de8887bcb3984b2ec7af2f82878366b041920ddf  install.ps1

From source: git clone https://github.com/grounzero/cadence.git, git checkout 0.6.0-rc.1, cargo build --release; the binary is target/release/cadence. On an x86-64 processor without AVX2, build with cargo build --release --config .cargo/x86-64-generic.toml.

A release candidate for 0.6.0, published as a pre-release. Two things come
in rc.2 and are not here: the change that keeps only the fastest wins at a
won tablebase root, pull request 189, whose test is still running, and the
release checks run on our own machines, which wait for that test to end.

Added

  • Install scripts: install.sh for Linux, macOS, and Windows under Git
    Bash or WSL, and install.ps1 for Windows PowerShell. Each installs a
    release's binary for the system it runs on once the binary's SHA-256 and
    bench match the release's, or builds the release from source where no
    binary fits, and can download the 3-4-5 piece Syzygy tables. The README
    says how to run them.
  • Releases: each release builds seven binaries, Windows and Linux x86-64
    each in an AVX2 build and a generic one, Linux aarch64, macOS arm64 and
    macOS x86-64, and publishes them with SHA256SUMS, bench.txt, the two
    install scripts and a provenance attestation for each binary.

Changed

  • UCI: under UCI_LimitStrength, the engine prints only the lines the GUI
    asked for, and reports the move it plays.
  • UCI: SyzygyPath is taken exactly as sent, spaces included.
  • The README documents every UCI option, the tools and the generic build.

Fixed

  • Search: when the tablebases cut a node, the transposition table keeps
    that node's move.
  • Tablebases: a root the tables rank reports the tables' verdict as its
    score, a root move is ranked under the fifty-move counter as the
    tablebase library ranks it, each table file is opened once and one that
    fails is named, and stop and the clock are checked between root probes.
  • UCI: the clock starts when go is read, and every go is answered,
    with bestmove 0000 after a position command that failed. A clock
    value that is not a whole number reads as zero, a go limit too large
    to hold reads as the largest the engine holds, the count in go mate is
    clamped, a root with no legal move reports a score line, and an input
    line is limited to a mebibyte.
  • Positions: a FEN with impossible material is refused, castling letters
    with no rook to castle with are dropped, and the move counters are
    clamped.
  • Search: a reduction stays below the depth it reduces, a finished line is
    kept, and under a node limit with helper threads the main thread
    finishes its first iteration. perft refuses a depth deeper than the
    search allows.
  • Version: a build calls itself by the release's version only at that
    version's annotated tag, on an unmodified tree.
  • Tools: bench, perft, spsa and magics exit with a failure when
    they cannot write their output, texel checks its arguments and its
    weights, and datagen caps its workers, keeps its games in order and
    refuses a record whose moves do not end as it says.
  • Build: the generic Windows build keeps SSE3.

Test 76, for the transposition table fix: -0.27 (between -2.75 and
+2.20), a self-play estimate against the build before it at the short
control, both sides given the tables up to five pieces. This was a
non-regression test, which asks only whether the fix costs strength. It
was stopped at 24,106 games before it decided, and the fix was taken on a
result that shows no cost. It is not a rating.