-
Notifications
You must be signed in to change notification settings - Fork 12
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
bench: 1944878 ELO | 1.87 +- 3.83 (95%) SPRT | 8.0+0.08s Threads=1 Hash=32MB LLR | 2.96 (-2.94, 2.94) [-5.00, 0.00] GAMES | N: 12848 W: 2656 L: 2587 D: 7605 ELO | 9.49 +- 5.61 (95%) SPRT | 8.0+0.08s Threads=1 Hash=32MB LLR | 2.96 (-2.94, 2.94) [0.00, 5.00] GAMES | N: 5528 W: 1114 L: 963 D: 3451
- Loading branch information
1 parent
d9c95a0
commit 6089a7b
Showing
15 changed files
with
4,817 additions
and
14 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
File renamed without changes.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,104 @@ | ||
| #pragma once | ||
|
|
||
| #include <board.h> | ||
| #include <search_constants.h> | ||
| #include <tbprobe.h> | ||
| #include <transposition_table.h> | ||
|
|
||
| #include <string> | ||
|
|
||
| namespace syzygy { | ||
|
|
||
| enum class wdl_type { | ||
| loss, | ||
| draw, | ||
| win | ||
| }; | ||
|
|
||
| struct tb_wdl_result { | ||
| bool success; | ||
| wdl_type wdl{wdl_type::draw}; | ||
|
|
||
| static constexpr tb_wdl_result failure() { return tb_wdl_result{false}; } | ||
| static constexpr tb_wdl_result from_value(const unsigned int& value) { | ||
| if (value == TB_WIN) { return tb_wdl_result{true, wdl_type::win}; } | ||
| if (value == TB_DRAW) { return tb_wdl_result{true, wdl_type::draw}; } | ||
| if (value == TB_LOSS) { return tb_wdl_result{true, wdl_type::loss}; } | ||
| return failure(); | ||
| } | ||
| }; | ||
|
|
||
| struct tb_dtz_result { | ||
| bool success; | ||
| search::score_type score{search::draw_score}; | ||
| chess::move move{chess::move::null()}; | ||
|
|
||
| static constexpr tb_dtz_result failure() { return tb_dtz_result{false}; } | ||
| static tb_dtz_result from_value(const chess::board& bd, const unsigned int& value) { | ||
| auto is_same_promo = [](const chess::move& mv, const int& promo) { | ||
| constexpr int num_pieces = 6; | ||
| return ((!mv.is_promotion() && promo == 0) || (mv.is_promotion() && (num_pieces - promo - 1) == static_cast<int>(mv.promotion()))); | ||
| }; | ||
|
|
||
| if (value == TB_RESULT_FAILED || value == TB_RESULT_CHECKMATE || value == TB_RESULT_STALEMATE) { failure(); } | ||
| const int wdl = TB_GET_WDL(value); | ||
|
|
||
| const chess::move dtz_move = [&] { | ||
| const chess::move_list list = bd.generate_moves(); | ||
| const int promo = TB_GET_PROMOTES(value); | ||
| const int from = TB_GET_FROM(value); | ||
| const int to = TB_GET_TO(value); | ||
| const auto it = std::find_if(list.begin(), list.end(), [&](const chess::move& mv) { | ||
| return mv.from().index() == from && mv.to().index() == to && is_same_promo(mv, promo); | ||
| }); | ||
| if (it != list.end()) { return *it; } | ||
| return chess::move::null(); | ||
| }(); | ||
|
|
||
| if (dtz_move == chess::move::null()) { return failure(); } | ||
|
|
||
| if (wdl == TB_WIN) { return tb_dtz_result{true, search::tb_win_score, dtz_move}; } | ||
| if (wdl == TB_LOSS) { return tb_dtz_result{true, search::tb_loss_score, dtz_move}; } | ||
| return tb_dtz_result{true, search::draw_score, dtz_move}; | ||
| } | ||
| }; | ||
|
|
||
| tb_wdl_result probe_wdl(const chess::board& bd) { | ||
| if (bd.num_pieces() > TB_LARGEST || bd.lat_.half_clock != 0) { return tb_wdl_result::failure(); } | ||
| if (bd.lat_.white.oo() || bd.lat_.white.ooo() || bd.lat_.black.oo() || bd.lat_.black.ooo()) { return tb_wdl_result::failure(); } | ||
|
|
||
| constexpr unsigned int rule_50 = 0; | ||
| constexpr unsigned int castling_rights = 0; | ||
| const unsigned int ep = bd.lat_.them(bd.turn()).ep_mask().any() ? bd.lat_.them(bd.turn()).ep_mask().item().index() : 0; | ||
| const bool turn = bd.turn(); | ||
|
|
||
| const unsigned value = tb_probe_wdl( | ||
| bd.man_.white.all().data, bd.man_.black.all().data, (bd.man_.white.king() | bd.man_.black.king()).data, | ||
| (bd.man_.white.queen() | bd.man_.black.queen()).data, (bd.man_.white.rook() | bd.man_.black.rook()).data, | ||
| (bd.man_.white.bishop() | bd.man_.black.bishop()).data, (bd.man_.white.knight() | bd.man_.black.knight()).data, | ||
| (bd.man_.white.pawn() | bd.man_.black.pawn()).data, rule_50, castling_rights, ep, turn); | ||
|
|
||
| return tb_wdl_result::from_value(value); | ||
| } | ||
|
|
||
| tb_dtz_result probe_dtz(const chess::board& bd) { | ||
| if (bd.num_pieces() > TB_LARGEST) { return tb_dtz_result::failure(); } | ||
| if (bd.lat_.white.oo() || bd.lat_.white.ooo() || bd.lat_.black.oo() || bd.lat_.black.ooo()) { return tb_dtz_result::failure(); } | ||
|
|
||
| const unsigned int rule_50 = bd.lat_.half_clock; | ||
| constexpr unsigned int castling_rights = 0; | ||
| const unsigned int ep = bd.lat_.them(bd.turn()).ep_mask().any() ? bd.lat_.them(bd.turn()).ep_mask().item().index() : 0; | ||
| const bool turn = bd.turn(); | ||
|
|
||
| const unsigned value = tb_probe_root( | ||
| bd.man_.white.all().data, bd.man_.black.all().data, (bd.man_.white.king() | bd.man_.black.king()).data, | ||
| (bd.man_.white.queen() | bd.man_.black.queen()).data, (bd.man_.white.rook() | bd.man_.black.rook()).data, | ||
| (bd.man_.white.bishop() | bd.man_.black.bishop()).data, (bd.man_.white.knight() | bd.man_.black.knight()).data, | ||
| (bd.man_.white.pawn() | bd.man_.black.pawn()).data, rule_50, castling_rights, ep, turn, nullptr); | ||
|
|
||
| return tb_dtz_result::from_value(bd, value); | ||
| } | ||
|
|
||
| void init(const std::string& path) { tb_init(path.c_str()); } | ||
|
|
||
| } // namespace syzygy |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,23 @@ | ||
| The MIT License (MIT) | ||
|
|
||
| Copyright (c) 2015 basil00 | ||
| Modifications Copyright (c) 2016-2017 by Jon Dart | ||
|
|
||
| Permission is hereby granted, free of charge, to any person obtaining a copy | ||
| of this software and associated documentation files (the "Software"), to deal | ||
| in the Software without restriction, including without limitation the rights | ||
| to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | ||
| copies of the Software, and to permit persons to whom the Software is | ||
| furnished to do so, subject to the following conditions: | ||
|
|
||
| The above copyright notice and this permission notice shall be included in all | ||
| copies or substantial portions of the Software. | ||
|
|
||
| THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR | ||
| IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, | ||
| FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE | ||
| AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | ||
| LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
| OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | ||
| SOFTWARE. | ||
|
|
Oops, something went wrong.