diff --git a/.clang-format b/.clang-format
index a998f2ec..b2faad3b 100644
--- a/.clang-format
+++ b/.clang-format
@@ -1,5 +1,5 @@
---
Language: Cpp
BasedOnStyle: Google
-ColumnLimit: 100
+ColumnLimit: 120
IndentWidth: 4
diff --git a/.devcontainer/Dockerfile b/.devcontainer/Dockerfile
new file mode 100644
index 00000000..c6f94433
--- /dev/null
+++ b/.devcontainer/Dockerfile
@@ -0,0 +1,27 @@
+FROM mcr.microsoft.com/devcontainers/cpp:1-debian-12
+
+# [Optional] Uncomment this section to install additional vcpkg ports.
+# RUN su vscode -c "${VCPKG_ROOT}/vcpkg install "
+
+# [Optional] Uncomment this section to install additional packages.
+ENV CC=clang
+ENV CXX=clang++
+RUN apt-get update && export DEBIAN_FRONTEND=noninteractive \
+ && apt install lsb-release wget software-properties-common gnupg git -y \
+ && wget https://apt.llvm.org/llvm.sh \
+ && chmod +x llvm.sh \
+ && ./llvm.sh 18 \
+ && apt install llvm-18-dev libclang-18-dev clang-18 -y \
+ && update-alternatives --install /usr/bin/cc cc /usr/bin/clang-18 100 \
+ && update-alternatives --install /usr/bin/c++ c++ /usr/bin/clang++-18 100 \
+ && update-alternatives --install /usr/bin/clang clang /usr/bin/clang-18 100 \
+ && update-alternatives --install /usr/bin/clang++ clang++ /usr/bin/clang++-18 100
+
+RUN git clone https://github.com/include-what-you-use/include-what-you-use.git
+WORKDIR include-what-you-use
+RUN git checkout clang_18
+WORKDIR ..
+RUN mkdir build && cd build
+RUN cmake -G "Unix Makefiles" -DCMAKE_PREFIX_PATH=/usr/lib/llvm-18 ./include-what-you-use
+RUN make -j4
+RUN make install
diff --git a/.devcontainer/devcontainer.json b/.devcontainer/devcontainer.json
new file mode 100644
index 00000000..51f46544
--- /dev/null
+++ b/.devcontainer/devcontainer.json
@@ -0,0 +1,25 @@
+// For format details, see https://aka.ms/devcontainer.json. For config options, see the
+// README at: https://github.com/devcontainers/templates/tree/main/src/cpp
+{
+ "name": "C++",
+ "build": {
+ "dockerfile": "Dockerfile"
+ },
+ // Features to add to the dev container. More info: https://containers.dev/features.
+ // "features": {},
+
+ // Use 'forwardPorts' to make a list of ports inside the container available locally.
+ // "forwardPorts": [],
+
+ // Use 'postCreateCommand' to run commands after the container is created.
+ // "postCreateCommand": "gcc -v",
+
+ // Configure tool-specific properties.
+ "customizations": {
+ "jetbrains": {
+ "backend": "CLion"
+ }
+ },
+ // Uncomment to connect as root instead. More info: https://aka.ms/dev-containers-non-root.
+ // "remoteUser": "root"
+}
diff --git a/.github/ISSUE_TEMPLATE/bug_report.md b/.github/ISSUE_TEMPLATE/bug_report.md
index 88240f5b..6e67c147 100644
--- a/.github/ISSUE_TEMPLATE/bug_report.md
+++ b/.github/ISSUE_TEMPLATE/bug_report.md
@@ -11,15 +11,17 @@ assignees: Dannyj1
A clear and concise description of what the bug is.
**FEN or PGN File (if applicable)**
-If you have a specific position in which the bug consistently occurs, you can place the FEN string of said position here. If not, please provide the PGN file of a game where the bug happened.
+If you have a specific position in which the bug consistently occurs, you can place the FEN string of said position
+here. If not, please provide the PGN file of a game where the bug happened.
**Game Settings (if applicable)**
Things like time control, opening book, chess variant, opponent engine, etc.
**Desktop (please complete the following information):**
- - OS: [e.g. Windows, Linux]
- - Version: [e.g. 10, 11, Debian Bookworm]
- - Chess UI (if applicable): [e.g. Arena, CuteChess]
+
+- OS: [e.g. Windows, Linux]
+- Version: [e.g. 10, 11, Debian Bookworm]
+- Chess UI (if applicable): [e.g. Arena, CuteChess]
**Additional context/comments**
Add any other context about the problem or additional comments here.
diff --git a/.github/workflows/ctest.yml b/.github/workflows/ctest.yml
index 055f37aa..9085c7ab 100644
--- a/.github/workflows/ctest.yml
+++ b/.github/workflows/ctest.yml
@@ -21,12 +21,12 @@ jobs:
- name: Setup Clang
uses: KyleMayes/install-llvm-action@v2
with:
- version: "17"
+ version: "18"
arch: "x64"
- name: Configure CMake & Build
run: |
- cmake -DCMAKE_BUILD_TYPE=Release -DAPPEND_VERSION=OFF -DENABLE_WARNINGS=ON -DENABLE_SANITIZER=OFF -DENABLE_TESTS=ON .
+ cmake -DCMAKE_BUILD_TYPE=Debug -DAPPEND_VERSION=OFF -DENABLE_WARNINGS=ON -DENABLE_SANITIZER=OFF -DENABLE_TESTS=ON .
cmake --build . --target all
- name: Run CTest
diff --git a/.github/workflows/doxygen.yml b/.github/workflows/doxygen.yml
new file mode 100644
index 00000000..d862bdb4
--- /dev/null
+++ b/.github/workflows/doxygen.yml
@@ -0,0 +1,21 @@
+name: Doxygen GitHub Pages Deploy Action
+
+on:
+ push:
+ branches:
+ - master
+ - rewrite
+
+jobs:
+ deploy:
+ runs-on: ubuntu-latest
+ permissions:
+ contents: write
+ steps:
+ - uses: DenverCoder1/doxygen-github-pages-action@v2.0.0
+ with:
+ github_token: ${{ secrets.GITHUB_TOKEN }}
+ branch: gh-pages
+ #folder: docs/html
+ #config_file: Doxyfile
+ doxygen_version: 1.12.0
diff --git a/.github/workflows/release.yml b/.github/workflows/release.yml
index 3d89a6b3..63b97ad1 100644
--- a/.github/workflows/release.yml
+++ b/.github/workflows/release.yml
@@ -12,7 +12,7 @@ jobs:
fail-fast: false
matrix:
include:
- - os: ubuntu-22.04
+ - os: ubuntu-latest
build-name: Linux
artifact-extension: .tar.gz
config-command: cmake -DCMAKE_BUILD_TYPE=Release -DAPPEND_VERSION_USE_GIT=OFF .
@@ -39,9 +39,9 @@ jobs:
- name: Setup Clang (Linux)
if: runner.os == 'Linux'
- uses: KyleMayes/install-llvm-action@v1
+ uses: KyleMayes/install-llvm-action@v2
with:
- version: "17"
+ version: "18"
- name: Setup msys and install required packages
if: runner.os == 'Windows'
@@ -74,12 +74,6 @@ jobs:
mkdir rel
cp "$executable_name" rel/
cp LICENSE README.md rel/
- mkdir "rel/source-code"
- cp -r src "rel/source-code"
- cp -r senjo "rel/source-code"
- cp LICENSE "rel/source-code"
- cp README.md "rel/source-code"
- cp CMakeLists.txt "rel/source-code"
cd rel
${{ matrix.archive-command }} "../$executable_name${{ matrix.artifact-extension }}" *
@@ -91,13 +85,13 @@ jobs:
create-release:
needs: build
- runs-on: ubuntu-22.04
+ runs-on: ubuntu-latest
steps:
- name: Download artifacts
uses: actions/download-artifact@v4
with:
path: artifacts
-
+
- name: Create Release
uses: softprops/action-gh-release@v1
with:
diff --git a/.github/workflows/valgrind.yml b/.github/workflows/valgrind.yml
index 55e4cfde..6d3bddc2 100644
--- a/.github/workflows/valgrind.yml
+++ b/.github/workflows/valgrind.yml
@@ -21,7 +21,7 @@ jobs:
- name: Setup Clang
uses: KyleMayes/install-llvm-action@v2
with:
- version: "17"
+ version: "18"
arch: "x64"
- name: Install valgrind
@@ -36,7 +36,7 @@ jobs:
- name: Run Valgrind
run: |
- valgrind --error-exitcode=1 --errors-for-leak-kinds=definite,indirect,possible --show-leak-kinds=definite,indirect,possible --leak-check=full --show-reachable=no ./Zagreus fastbench
+ valgrind --error-exitcode=1 --errors-for-leak-kinds=definite,indirect,possible --show-leak-kinds=definite,indirect,possible --leak-check=full --show-reachable=no ./Zagreus bench fast
- name: Delete CMake cache
run: rm -rf CMakeFiles CMakeCache.txt cmake_install.cmake Makefile
@@ -51,4 +51,4 @@ jobs:
- name: Run w/ sanitizers
run: |
- ./Zagreus fastbench
+ ./Zagreus bench fast
diff --git a/.gitignore b/.gitignore
index 47e4b33f..5d94eb02 100644
--- a/.gitignore
+++ b/.gitignore
@@ -2,3 +2,7 @@
/cmake-build-debug/
/cmake-build-release/
/perft.txt
+/quiet-labeled.epd
+/src/uci-specification.txt
+/cmake-build*/
+/terraform/
diff --git a/.idea/.gitignore b/.idea/.gitignore
new file mode 100644
index 00000000..13566b81
--- /dev/null
+++ b/.idea/.gitignore
@@ -0,0 +1,8 @@
+# Default ignored files
+/shelf/
+/workspace.xml
+# Editor-based HTTP Client requests
+/httpRequests/
+# Datasource local storage ignored files
+/dataSources/
+/dataSources.local.xml
diff --git a/CMakeLists.txt b/CMakeLists.txt
index 9c894b28..a09d08d6 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -20,18 +20,18 @@
# along with Zagreus. If not, see .
cmake_minimum_required(VERSION 3.25)
-set(CMAKE_CXX_STANDARD 20)
+set(CMAKE_CXX_STANDARD 23)
project(Zagreus)
-set(ZAGREUS_VERSION_MAJOR "5")
+set(ZAGREUS_VERSION_MAJOR "6")
set(ZAGREUS_VERSION_MINOR "0")
# Default values
set(BUILD_FLAGS "")
# Define the different profiles and their corresponding flags
-set(DEBUG_FLAGS "-static-libgcc -static-libstdc++ -fno-omit-frame-pointer -pthread -gdwarf-4 -g -Wno-unused-command-line-argument")
-set(PROFILING_FLAGS "-static-libgcc -static-libstdc++ -pthread -g -Wno-unused-command-line-argument")
-set(RELEASE_FLAGS "-static-libgcc -static-libstdc++ -pthread -Wno-unused-command-line-argument")
+set(DEBUG_FLAGS "-static-libgcc -static-libstdc++ -fno-omit-frame-pointer -pthread -gdwarf-4 -g -Wno-unused-command-line-argument -std=c++23")
+set(PROFILING_FLAGS "-static-libgcc -static-libstdc++ -pthread -g -Wno-unused-command-line-argument -std=c++23")
+set(RELEASE_FLAGS "-static-libgcc -static-libstdc++ -pthread -Wno-unused-command-line-argument -std=c++23")
if (WIN32)
# Add the --pdb flag for Windows
@@ -54,6 +54,8 @@ if (CMAKE_BUILD_TYPE STREQUAL "Debug")
option(APPEND_VERSION_USE_GIT "Append version or branch to filename using git, when off it always uses just the version" ON)
option(ENABLE_CLANG_TIDY "Enable the use of clang-tidy (slows down compiling a lot)" OFF)
option(ENABLE_TESTS "Enable the compilation and execution of tests" ON)
+ option(ENABLE_IWYU "Enable the use of Include What You Use (IWYU)" ON)
+ option(ENABLE_TUNER "Enable compilation of the tuner" OFF)
else ()
option(ENABLE_OPTIMIZATION "Enable optimization flags (-O3)" ON)
option(ENABLE_OPTIMIZATION_FAST_MATH "Enable fast math optimization flags (-Ofast)" ON)
@@ -68,6 +70,8 @@ else ()
option(APPEND_VERSION_USE_GIT "Append version or branch to filename using git, when off it always uses just the version" ON)
option(ENABLE_CLANG_TIDY "Enable the use of clang-tidy (slows down compiling a lot)" OFF)
option(ENABLE_TESTS "Enable the compilation and execution of tests" OFF)
+ option(ENABLE_IWYU "Enable the use of Include What You Use (IWYU)" OFF)
+ option(ENABLE_TUNER "Enable compilation of the tuner" OFF)
endif ()
if (ENABLE_TESTS)
@@ -103,6 +107,8 @@ message("APPEND_VERSION: ${APPEND_VERSION}")
message("APPEND_VERSION_USE_GIT: ${APPEND_VERSION_USE_GIT}")
message("ENABLE_CLANG_TIDY: ${ENABLE_CLANG_TIDY}")
message("ENABLE_TESTS: ${ENABLE_TESTS}")
+message("ENABLE_IWYU: ${ENABLE_IWYU}")
+message("ENABLE_TUNER: ${ENABLE_TUNER}")
if (APPEND_VERSION)
execute_process(COMMAND git rev-parse --abbrev-ref HEAD
@@ -143,9 +149,9 @@ if (ENABLE_OPTIMIZATION)
set(PROFILING_FLAGS "${PROFILING_FLAGS} -O3")
endif ()
else ()
- set(RELEASE_FLAGS "${RELEASE_FLAGS} -O1 -fno-inline")
- set(DEBUG_FLAGS "${DEBUG_FLAGS} -O1 -fno-inline")
- set(PROFILING_FLAGS "${PROFILING_FLAGS} -O1 -fno-inline")
+ set(RELEASE_FLAGS "${RELEASE_FLAGS} -O0 -fno-inline")
+ set(DEBUG_FLAGS "${DEBUG_FLAGS} -O0 -fno-inline")
+ set(PROFILING_FLAGS "${PROFILING_FLAGS} -O0 -fno-inline")
endif ()
if (ENABLE_LTO)
@@ -200,20 +206,35 @@ set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${BUILD_FLAGS}")
set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} ${BUILD_FLAGS}")
file(GLOB inc_zagreus "src/*.h" "src/*.cpp")
-file(GLOB inc_senjo "senjo/*.h" "senjo/*.cpp")
-add_executable(Zagreus src/main.cpp ${inc_senjo} ${inc_zagreus})
+add_executable(Zagreus src/main.cpp ${inc_zagreus})
target_compile_definitions(Zagreus PRIVATE ZAGREUS_VERSION_MAJOR="${ZAGREUS_VERSION_MAJOR}")
target_compile_definitions(Zagreus PRIVATE ZAGREUS_VERSION_MINOR="${ZAGREUS_VERSION_MINOR}")
+if (ENABLE_IWYU)
+ find_program(IWYU_PATH NAMES "include-what-you-use")
+
+ if (IWYU_PATH)
+ set(CMAKE_CXX_INCLUDE_WHAT_YOU_USE "${IWYU_PATH}")
+ set_property(TARGET Zagreus PROPERTY CXX_INCLUDE_WHAT_YOU_USE "${IWYU_PATH};-Xiwyu;--error;-Xiwyu;--no_comments;-Xiwyu;--cxx17ns;-Xiwyu;--no_fwd_decls")
+ message(STATUS "IWYU found and enabled: ${IWYU_PATH}")
+ else ()
+ message(WARNING "IWYU requested but not found. Please install IWYU or disable ENABLE_IWYU.")
+ endif ()
+endif ()
+
+if (ENABLE_TUNER)
+ add_compile_definitions(ZAGREUS_TUNER)
+endif ()
+
if (ENABLE_TESTS)
file(GLOB tests_folder "tests/*.h" "tests/*.cpp")
# Remove main from inc_zagreus
list(REMOVE_ITEM inc_zagreus "${CMAKE_CURRENT_SOURCE_DIR}/src/main.cpp")
- add_executable(zagreus-tests ${tests_folder} ${inc_senjo} ${inc_zagreus})
+ add_executable(zagreus-tests ${tests_folder} ${inc_zagreus})
target_link_libraries(zagreus-tests PRIVATE Catch2::Catch2WithMain)
target_compile_definitions(zagreus-tests PRIVATE ZAGREUS_VERSION_MAJOR="${ZAGREUS_VERSION_MAJOR}")
@@ -223,4 +244,4 @@ if (ENABLE_TESTS)
include(CTest)
include(Catch)
catch_discover_tests(zagreus-tests)
-endif ()
\ No newline at end of file
+endif ()
diff --git a/Doxyfile b/Doxyfile
new file mode 100644
index 00000000..50252795
--- /dev/null
+++ b/Doxyfile
@@ -0,0 +1,2924 @@
+# Doxyfile 1.12.0
+
+# This file describes the settings to be used by the documentation system
+# Doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+#
+# Note:
+#
+# Use Doxygen to compare the used configuration file with the template
+# configuration file:
+# doxygen -x [configFile]
+# Use Doxygen to compare the used configuration file with the template
+# configuration file without replacing the environment variables or CMake type
+# replacement variables:
+# doxygen -x_noenv [configFile]
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the configuration
+# file that follow. The default is UTF-8 which is also the encoding used for all
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the
+# iconv built into libc) for the transcoding. See
+# https://www.gnu.org/software/libiconv/ for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME = Zagreus
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER =
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO =
+
+# With the PROJECT_ICON tag one can specify an icon that is included in the tabs
+# when the HTML document is shown. Doxygen will copy the logo to the output
+# directory.
+
+PROJECT_ICON =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where Doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY = ./docs
+
+# If the CREATE_SUBDIRS tag is set to YES then Doxygen will create up to 4096
+# sub-directories (in 2 levels) under the output directory of each output format
+# and will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding Doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system. Adapt CREATE_SUBDIRS_LEVEL to
+# control the number of sub-directories.
+# The default value is: NO.
+
+CREATE_SUBDIRS = NO
+
+# Controls the number of sub-directories that will be created when
+# CREATE_SUBDIRS tag is set to YES. Level 0 represents 16 directories, and every
+# level increment doubles the number of directories, resulting in 4096
+# directories at level 8 which is the default and also the maximum value. The
+# sub-directories are organized in 2 levels, the first level always has a fixed
+# number of 16 directories.
+# Minimum value: 0, maximum value: 8, default value: 8.
+# This tag requires that the tag CREATE_SUBDIRS is set to YES.
+
+CREATE_SUBDIRS_LEVEL = 8
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, Doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by Doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Bulgarian,
+# Catalan, Chinese, Chinese-Traditional, Croatian, Czech, Danish, Dutch, English
+# (United States), Esperanto, Farsi (Persian), Finnish, French, German, Greek,
+# Hindi, Hungarian, Indonesian, Italian, Japanese, Japanese-en (Japanese with
+# English messages), Korean, Korean-en (Korean with English messages), Latvian,
+# Lithuanian, Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese,
+# Romanian, Russian, Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish,
+# Swedish, Turkish, Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, Doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC = YES
+
+# If the REPEAT_BRIEF tag is set to YES, Doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF = "The $name class" \
+ "The $name widget" \
+ "The $name file" \
+ is \
+ provides \
+ specifies \
+ contains \
+ represents \
+ a \
+ an \
+ the
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# Doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, Doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB = NO
+
+# If the FULL_PATH_NAMES tag is set to YES, Doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which Doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where Doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH =
+
+# If the SHORT_NAMES tag is set to YES, Doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF = NO
+
+# If the JAVADOC_BANNER tag is set to YES then Doxygen will interpret a line
+# such as
+# /***************
+# as being the beginning of a Javadoc-style comment "banner". If set to NO, the
+# Javadoc-style will behave just like regular comments and it will not be
+# interpreted by Doxygen.
+# The default value is: NO.
+
+JAVADOC_BANNER = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then Doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# By default Python docstrings are displayed as preformatted text and Doxygen's
+# special commands cannot be used. By setting PYTHON_DOCSTRING to NO the
+# Doxygen's special commands can be used and the contents of the docstring
+# documentation blocks is shown as Doxygen documentation.
+# The default value is: YES.
+
+PYTHON_DOCSTRING = YES
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then Doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:^^"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". Note that you cannot put \n's in the value part of an alias
+# to insert newlines (in the resulting output). You can put ^^ in the value part
+# of an alias to insert a newline as if a physical newline was in the original
+# file. When you need a literal { or } or , in the value part of an alias you
+# have to escape them by means of a backslash (\), this can lead to conflicts
+# with the commands \{ and \} for these it is advised to use the version @{ and
+# @} or use a double escape (\\{ and \\})
+
+ALIASES =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL = NO
+
+# Set the OPTIMIZE_OUTPUT_SLICE tag to YES if your project consists of Slice
+# sources only. Doxygen will then generate output that is more tailored for that
+# language. For instance, namespaces will be presented as modules, types will be
+# separated into more groups, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_SLICE = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by Doxygen: IDL, Java, JavaScript,
+# Csharp (C#), C, C++, Lex, D, PHP, md (Markdown), Objective-C, Python, Slice,
+# VHDL, Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
+# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# tries to guess whether the code is fixed or free formatted code, this is the
+# default for Fortran type files). For instance to make Doxygen treat .inc files
+# as Fortran files (default is PHP), and .f files as C (default is Fortran),
+# use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by Doxygen. When specifying no_extension you should add
+# * to the FILE_PATTERNS.
+#
+# Note see also the list of default file extension mappings.
+
+EXTENSION_MAPPING =
+
+# If the MARKDOWN_SUPPORT tag is enabled then Doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See https://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by Doxygen, so you can
+# mix Doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT = YES
+
+# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
+# to that level are automatically included in the table of contents, even if
+# they do not have an id attribute.
+# Note: This feature currently applies only to Markdown headings.
+# Minimum value: 0, maximum value: 99, default value: 6.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+TOC_INCLUDE_HEADINGS = 6
+
+# The MARKDOWN_ID_STYLE tag can be used to specify the algorithm used to
+# generate identifiers for the Markdown headings. Note: Every identifier is
+# unique.
+# Possible values are: DOXYGEN use a fixed 'autotoc_md' string followed by a
+# sequence number starting at 0 and GITHUB use the lower case version of title
+# with any whitespace replaced by '-' and punctuation characters removed.
+# The default value is: DOXYGEN.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+MARKDOWN_ID_STYLE = DOXYGEN
+
+# When enabled Doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let Doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also makes the inheritance and
+# collaboration diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# https://www.riverbankcomputing.com/software) sources only. Doxygen will parse
+# them like normal C++ but will assume all classes use public instead of private
+# inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# Doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then Doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, Doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# Doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run Doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE = 0
+
+# The NUM_PROC_THREADS specifies the number of threads Doxygen is allowed to use
+# during processing. When set to 0 Doxygen will based this on the number of
+# cores available in the system. You can set it explicitly to a value larger
+# than 0 to get more control over the balance between CPU load and processing
+# speed. At this moment only the input processing can be done using multiple
+# threads. Since this is still an experimental feature the default is set to 1,
+# which effectively disables parallel processing. Please report any issues you
+# encounter. Generating dot graphs in parallel is controlled by the
+# DOT_NUM_THREADS setting.
+# Minimum value: 0, maximum value: 32, default value: 1.
+
+NUM_PROC_THREADS = 1
+
+# If the TIMESTAMP tag is set different from NO then each generated page will
+# contain the date or date and time when the page was generated. Setting this to
+# NO can help when comparing the output of multiple runs.
+# Possible values are: YES, NO, DATETIME and DATE.
+# The default value is: NO.
+
+TIMESTAMP = NO
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, Doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE = NO
+
+# If the EXTRACT_PRIV_VIRTUAL tag is set to YES, documented private virtual
+# methods of a class will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIV_VIRTUAL = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC = NO
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES = NO
+
+# If this flag is set to YES, the name of an unnamed parameter in a declaration
+# will be determined by the corresponding definition. By default unnamed
+# parameters remain unnamed in the output.
+# The default value is: YES.
+
+RESOLVE_UNNAMED_PARAMS = YES
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# will also hide undocumented C++ concepts if enabled. This option has no effect
+# if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all friend
+# declarations. If set to NO, these declarations will be included in the
+# documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS = NO
+
+# With the correct setting of option CASE_SENSE_NAMES Doxygen will better be
+# able to match the capabilities of the underlying filesystem. In case the
+# filesystem is case sensitive (i.e. it supports files in the same directory
+# whose names only differ in casing), the option must be set to YES to properly
+# deal with such files in case they appear in the input. For filesystems that
+# are not case sensitive the option should be set to NO to properly deal with
+# output files written for symbols that only differ in casing, such as for two
+# classes, one named CLASS and the other named Class, and to also support
+# references to files without having to specify the exact matching casing. On
+# Windows (including Cygwin) and macOS, users should typically set this option
+# to NO, whereas on Linux or other Unix flavors it should typically be set to
+# YES.
+# Possible values are: SYSTEM, NO and YES.
+# The default value is: SYSTEM.
+
+CASE_SENSE_NAMES = SYSTEM
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then Doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES = NO
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then Doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_HEADERFILE tag is set to YES then the documentation for a class
+# will show which file needs to be included to use the class.
+# The default value is: YES.
+
+SHOW_HEADERFILE = YES
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then Doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then Doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then Doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then Doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then Doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and Doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING Doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if ... \endif and \cond
+# ... \endcond blocks.
+
+ENABLED_SECTIONS =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# Doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by Doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by Doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents Doxygen's defaults, run Doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file. See also section "Changing the
+# layout of pages" for information.
+#
+# Note that if you run Doxygen from a directory containing a file called
+# DoxygenLayout.xml, Doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES =
+
+# The EXTERNAL_TOOL_PATH tag can be used to extend the search path (PATH
+# environment variable) so that external tools such as latex and gs can be
+# found.
+# Note: Directories specified with EXTERNAL_TOOL_PATH are added in front of the
+# path already specified by the PATH variable, and are added in the order
+# specified.
+# Note: This option is particularly useful for macOS version 14 (Sonoma) and
+# higher, when running Doxygen from Doxywizard, because in this case any user-
+# defined changes to the PATH are ignored. A typical example on macOS is to set
+# EXTERNAL_TOOL_PATH = /Library/TeX/texbin /usr/local/bin
+# together with the standard path, the full search path used by doxygen when
+# launching external tools will then become
+# PATH=/Library/TeX/texbin:/usr/local/bin:/usr/bin:/bin:/usr/sbin:/sbin
+
+EXTERNAL_TOOL_PATH =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by Doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by Doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then Doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, Doxygen will generate warnings for
+# potential errors in the documentation, such as documenting some parameters in
+# a documented function twice, or documenting parameters that don't exist or
+# using markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR = YES
+
+# If WARN_IF_INCOMPLETE_DOC is set to YES, Doxygen will warn about incomplete
+# function parameter documentation. If set to NO, Doxygen will accept that some
+# parameters have no documentation without warning.
+# The default value is: YES.
+
+WARN_IF_INCOMPLETE_DOC = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, Doxygen will only warn about wrong parameter
+# documentation, but not about the absence of documentation. If EXTRACT_ALL is
+# set to YES then this flag will automatically be disabled. See also
+# WARN_IF_INCOMPLETE_DOC
+# The default value is: NO.
+
+WARN_NO_PARAMDOC = NO
+
+# If WARN_IF_UNDOC_ENUM_VAL option is set to YES, Doxygen will warn about
+# undocumented enumeration values. If set to NO, Doxygen will accept
+# undocumented enumeration values. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: NO.
+
+WARN_IF_UNDOC_ENUM_VAL = NO
+
+# If the WARN_AS_ERROR tag is set to YES then Doxygen will immediately stop when
+# a warning is encountered. If the WARN_AS_ERROR tag is set to FAIL_ON_WARNINGS
+# then Doxygen will continue running as if WARN_AS_ERROR tag is set to NO, but
+# at the end of the Doxygen process Doxygen will return with a non-zero status.
+# If the WARN_AS_ERROR tag is set to FAIL_ON_WARNINGS_PRINT then Doxygen behaves
+# like FAIL_ON_WARNINGS but in case no WARN_LOGFILE is defined Doxygen will not
+# write the warning messages in between other messages but write them at the end
+# of a run, in case a WARN_LOGFILE is defined the warning messages will be
+# besides being in the defined file also be shown at the end of a run, unless
+# the WARN_LOGFILE is defined as - i.e. standard output (stdout) in that case
+# the behavior will remain as with the setting FAIL_ON_WARNINGS.
+# Possible values are: NO, YES, FAIL_ON_WARNINGS and FAIL_ON_WARNINGS_PRINT.
+# The default value is: NO.
+
+WARN_AS_ERROR = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that Doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# See also: WARN_LINE_FORMAT
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT = "$file:$line: $text"
+
+# In the $text part of the WARN_FORMAT command it is possible that a reference
+# to a more specific place is given. To make it easier to jump to this place
+# (outside of Doxygen) the user can define a custom "cut" / "paste" string.
+# Example:
+# WARN_LINE_FORMAT = "'vi $file +$line'"
+# See also: WARN_FORMAT
+# The default value is: at line $line of file $file.
+
+WARN_LINE_FORMAT = "at line $line of file $file"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr). In case the file specified cannot be opened for writing the
+# warning and error messages are written to standard error. When as file - is
+# specified the warning and error messages are written to standard output
+# (stdout).
+
+WARN_LOGFILE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT = ./src
+
+# This tag can be used to specify the character encoding of the source files
+# that Doxygen parses. Internally Doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see:
+# https://www.gnu.org/software/libiconv/) for the list of possible encodings.
+# See also: INPUT_FILE_ENCODING
+# The default value is: UTF-8.
+
+INPUT_ENCODING = UTF-8
+
+# This tag can be used to specify the character encoding of the source files
+# that Doxygen parses The INPUT_FILE_ENCODING tag can be used to specify
+# character encoding on a per file pattern basis. Doxygen will compare the file
+# name with each pattern and apply the encoding instead of the default
+# INPUT_ENCODING) if there is a match. The character encodings are a list of the
+# form: pattern=encoding (like *.php=ISO-8859-1).
+# See also: INPUT_ENCODING for further information on supported encodings.
+
+INPUT_FILE_ENCODING =
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by Doxygen.
+#
+# Note the list of default checked file patterns might differ from the list of
+# default file extension mappings.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cxxm,
+# *.cpp, *.cppm, *.ccm, *.c++, *.c++m, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl,
+# *.idl, *.ddl, *.odl, *.h, *.hh, *.hxx, *.hpp, *.h++, *.ixx, *.l, *.cs, *.d,
+# *.php, *.php4, *.php5, *.phtml, *.inc, *.m, *.markdown, *.md, *.mm, *.dox (to
+# be provided as Doxygen C comment), *.py, *.pyw, *.f90, *.f95, *.f03, *.f08,
+# *.f18, *.f, *.for, *.vhd, *.vhdl, *.ucf, *.qsf and *.ice.
+
+FILE_PATTERNS = *.c \
+ *.cc \
+ *.cxx \
+ *.cxxm \
+ *.cpp \
+ *.cppm \
+ *.ccm \
+ *.c++ \
+ *.c++m \
+ *.java \
+ *.ii \
+ *.ixx \
+ *.ipp \
+ *.i++ \
+ *.inl \
+ *.idl \
+ *.ddl \
+ *.odl \
+ *.h \
+ *.hh \
+ *.hxx \
+ *.hpp \
+ *.h++ \
+ *.ixx \
+ *.l \
+ *.cs \
+ *.d \
+ *.php \
+ *.php4 \
+ *.php5 \
+ *.phtml \
+ *.inc \
+ *.m \
+ *.markdown \
+ *.md \
+ *.mm \
+ *.dox \
+ *.py \
+ *.pyw \
+ *.f90 \
+ *.f95 \
+ *.f03 \
+ *.f08 \
+ *.f18 \
+ *.f \
+ *.for \
+ *.vhd \
+ *.vhdl \
+ *.ucf \
+ *.qsf \
+ *.ice
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which Doxygen is
+# run.
+
+EXCLUDE =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# ANamespace::AClass, ANamespace::*Test
+
+EXCLUDE_SYMBOLS =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS = *
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH =
+
+# The INPUT_FILTER tag can be used to specify a program that Doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+#
+#
+# where is the value of the INPUT_FILTER tag, and is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that Doxygen will use the data processed and written to standard output
+# for further processing, therefore nothing else, like debug statements or used
+# commands (so in case of a Windows batch file always use @echo OFF), should be
+# written to standard output.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by Doxygen.
+
+INPUT_FILTER =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by Doxygen.
+
+FILTER_PATTERNS =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the Doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+# The Fortran standard specifies that for fixed formatted Fortran code all
+# characters from position 72 are to be considered as comment. A common
+# extension is to allow longer lines before the automatic comment starts. The
+# setting FORTRAN_COMMENT_AFTER will also make it possible that longer lines can
+# be processed before the automatic comment starts.
+# Minimum value: 7, maximum value: 10000, default value: 72.
+
+FORTRAN_COMMENT_AFTER = 72
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER = YES
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# multi-line macros, enums or list initialized variables directly into the
+# documentation.
+# The default value is: NO.
+
+INLINE_SOURCES = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct Doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# entity all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of Doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see https://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the configuration file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by Doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then Doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then Doxygen will use the
+# clang parser (see:
+# http://clang.llvm.org/) for more accurate parsing at the cost of reduced
+# performance. This can be particularly helpful with template rich C++ code for
+# which Doxygen's built-in parser lacks the necessary type information.
+# Note: The availability of this option depends on whether or not Doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES and the CLANG_ADD_INC_PATHS
+# tag is set to YES then Doxygen will add the directory of each input to the
+# include path.
+# The default value is: YES.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_ADD_INC_PATHS = YES
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by Doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS =
+
+# If clang assisted parsing is enabled you can provide the clang parser with the
+# path to the directory containing a file called compile_commands.json. This
+# file is the compilation database (see:
+# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) containing the
+# options used when the source files were built. This is equivalent to
+# specifying the -p option to a clang tool, such as clang-check. These options
+# will then be passed to the parser. Any options specified with CLANG_OPTIONS
+# will be added as well.
+# Note: The availability of this option depends on whether or not Doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+
+CLANG_DATABASE_PATH =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX = YES
+
+# The IGNORE_PREFIX tag can be used to specify a prefix (or a list of prefixes)
+# that should be ignored while generating the index headers. The IGNORE_PREFIX
+# tag works for classes, function and member names. The entity will be placed in
+# the alphabetical list under the first letter of the entity name that remains
+# after removing the prefix.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, Doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank Doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that Doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that Doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of Doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank Doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that Doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank Doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that Doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by Doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# Note: Since the styling of scrollbars can currently not be overruled in
+# Webkit/Chromium, the styling will be left out of the default doxygen.css if
+# one or more extra stylesheets have been specified. So if scrollbar
+# customization is desired it has to be added explicitly. For an example see the
+# documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES =
+
+# The HTML_COLORSTYLE tag can be used to specify if the generated HTML output
+# should be rendered with a dark or light theme.
+# Possible values are: LIGHT always generates light mode output, DARK always
+# generates dark mode output, AUTO_LIGHT automatically sets the mode according
+# to the user preference, uses light mode if no preference is set (the default),
+# AUTO_DARK automatically sets the mode according to the user preference, uses
+# dark mode if no preference is set and TOGGLE allows a user to switch between
+# light and dark mode via a button.
+# The default value is: AUTO_LIGHT.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE = AUTO_LIGHT
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a color-wheel, see
+# https://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use gray-scales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA = 80
+
+# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML
+# documentation will contain a main index with vertical navigation menus that
+# are dynamically created via JavaScript. If disabled, the navigation index will
+# consists of multiple levels of tabs that are statically embedded in every HTML
+# page. Disable this option to support browsers that do not have JavaScript,
+# like the Qt help browser.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_MENUS = YES
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS = NO
+
+# If the HTML_CODE_FOLDING tag is set to YES then classes and functions can be
+# dynamically folded and expanded in the generated HTML source code.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_CODE_FOLDING = YES
+
+# If the HTML_COPY_CLIPBOARD tag is set to YES then Doxygen will show an icon in
+# the top right corner of code and text fragments that allows the user to copy
+# its content to the clipboard. Note this only works if supported by the browser
+# and the web page is served via a secure context (see:
+# https://www.w3.org/TR/secure-contexts/), i.e. using the https: or file:
+# protocol.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COPY_CLIPBOARD = YES
+
+# Doxygen stores a couple of settings persistently in the browser (via e.g.
+# cookies). By default these settings apply to all HTML pages generated by
+# Doxygen across all projects. The HTML_PROJECT_COOKIE tag can be used to store
+# the settings under a project specific key, such that the user preferences will
+# be stored separately.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_PROJECT_COOKIE =
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see:
+# https://developer.apple.com/xcode/), introduced with OSX 10.5 (Leopard). To
+# create a documentation set, Doxygen will generate a Makefile in the HTML
+# output directory. Running make will produce the docset in that directory and
+# running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See https://developer.apple.com/library/archive/featuredarticles/Doxy
+# genXcode/_index.html for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME = "Doxygen generated docs"
+
+# This tag determines the URL of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDURL =
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then Doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# on Windows. In the beginning of 2021 Microsoft took the original page, with
+# a.o. the download links, offline the HTML help workshop was already many years
+# in maintenance mode). You can download the HTML help workshop from the web
+# archives at Installation executable (see:
+# http://web.archive.org/web/20160201063255/http://download.microsoft.com/downlo
+# ad/0/A/9/0A939EF6-E31C-430F-A3DF-DFAE7960D564/htmlhelp.exe).
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by Doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# Doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the main .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND = NO
+
+# The SITEMAP_URL tag is used to specify the full URL of the place where the
+# generated documentation will be placed on the server by the user during the
+# deployment of the documentation. The generated sitemap is called sitemap.xml
+# and placed on the directory specified by HTML_OUTPUT. In case no SITEMAP_URL
+# is specified no sitemap is generated. For information about the sitemap
+# protocol see https://www.sitemaps.org
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SITEMAP_URL =
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS =
+
+# The QHG_LOCATION tag can be used to specify the location (absolute path
+# including file name) of Qt's qhelpgenerator. If non-empty Doxygen will try to
+# run qhelpgenerator on the generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine tune the look of the index (see "Fine-tuning the output"). As an
+# example, the default style sheet generated by Doxygen has an example that
+# shows how to put an image at the root of the tree instead of the PROJECT_NAME.
+# Since the tree basically has the same information as the tab index, you could
+# consider setting DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW = NO
+
+# When both GENERATE_TREEVIEW and DISABLE_INDEX are set to YES, then the
+# FULL_SIDEBAR option determines if the side bar is limited to only the treeview
+# area (value NO) or if it should extend to the full height of the window (value
+# YES). Setting this to YES gives a layout similar to
+# https://docs.readthedocs.io with more room for contents, but less room for the
+# project logo, title, and description. If either GENERATE_TREEVIEW or
+# DISABLE_INDEX is set to NO, this option has no effect.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FULL_SIDEBAR = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# Doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE = 4
+
+# When the SHOW_ENUM_VALUES tag is set doxygen will show the specified
+# enumeration values besides the enumeration mnemonics.
+# The default value is: NO.
+
+SHOW_ENUM_VALUES = NO
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, Doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW = NO
+
+# If the OBFUSCATE_EMAILS tag is set to YES, Doxygen will obfuscate email
+# addresses.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+OBFUSCATE_EMAILS = YES
+
+# If the HTML_FORMULA_FORMAT option is set to svg, Doxygen will use the pdf2svg
+# tool (see https://github.com/dawbarton/pdf2svg) or inkscape (see
+# https://inkscape.org) to generate formulas as SVG images instead of PNGs for
+# the HTML output. These images will generally look nicer at scaled resolutions.
+# Possible values are: png (the default) and svg (looks nicer but requires the
+# pdf2svg or inkscape tool).
+# The default value is: png.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FORMULA_FORMAT = png
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# Doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE = 10
+
+# The FORMULA_MACROFILE can contain LaTeX \newcommand and \renewcommand commands
+# to create new LaTeX commands to be used in formulas as building blocks. See
+# the section "Including formulas" for details.
+
+FORMULA_MACROFILE =
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# https://www.mathjax.org) which uses client side JavaScript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX = NO
+
+# With MATHJAX_VERSION it is possible to specify the MathJax version to be used.
+# Note that the different versions of MathJax have different requirements with
+# regards to the different settings, so it is possible that also other MathJax
+# settings have to be changed when switching between the different MathJax
+# versions.
+# Possible values are: MathJax_2 and MathJax_3.
+# The default value is: MathJax_2.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_VERSION = MathJax_2
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. For more details about the output format see MathJax
+# version 2 (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) and MathJax version 3
+# (see:
+# http://docs.mathjax.org/en/latest/web/components/output.html).
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility. This is the name for Mathjax version 2, for MathJax version 3
+# this will be translated into chtml), NativeMML (i.e. MathML. Only supported
+# for MathJax 2. For MathJax version 3 chtml will be used instead.), chtml (This
+# is the name for Mathjax version 3, for MathJax version 2 this will be
+# translated into HTML-CSS) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from https://www.mathjax.org before deployment. The default value is:
+# - in case of MathJax version 2: https://cdn.jsdelivr.net/npm/mathjax@2
+# - in case of MathJax version 3: https://cdn.jsdelivr.net/npm/mathjax@3
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH =
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# for MathJax version 2 (see
+# https://docs.mathjax.org/en/v2.7-latest/tex.html#tex-and-latex-extensions):
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# For example for MathJax version 3 (see
+# http://docs.mathjax.org/en/latest/input/tex/extensions/index.html):
+# MATHJAX_EXTENSIONS = ams
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with JavaScript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE =
+
+# When the SEARCHENGINE tag is enabled Doxygen will generate a search box for
+# the HTML output. The underlying search engine uses JavaScript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the JavaScript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use + S
+# (what the is depends on the OS and browser, but it is typically
+# , /
-
![License](https://img.shields.io/github/license/Dannyj1/Zagreus?style=for-the-badge) ![Downloads](https://img.shields.io/github/downloads/Dannyj1/Zagreus/total?style=for-the-badge) ![GitHub commit activity](https://img.shields.io/github/commit-activity/t/Dannyj1/Zagreus?style=for-the-badge) ![GitHub commits since latest release (by date including pre-releases)](https://img.shields.io/github/commits-since/Dannyj1/Zagreus/latest?include_prereleases&style=for-the-badge)
+# Note
-# Zagreus Chess Engine
+This is a development branch for the **rewrite** from scratch of Zagreus. Although the engine functions, it's not near
+the performance where it should be and a lot of things are missing. The code related to the latest stable release can be
+accessed in the [master branch here](https://github.com/Dannyj1/Zagreus/tree/master). No changes will happen to the
+master branch until the rewrite is finished.
+
+Consider the information in this readme outdated for the rewrite.
+# Zagreus Chess Engine
Zagreus is a work in progress UCI Chess Engine. You can play against Zagreus on
Lichess: https://lichess.org/@/Zagreus_Engine. You will also be able to find it's elo rating on there. At the time of
writing this is around ~2100 ELO rapid.
@@ -28,13 +34,14 @@ stable version for yourself, you can use the tag. You can list all tags and sear
on GitHub.
# Features
+
- Bitboard board representation with Plain Magic Bitboards for sliding piece move generation
- Tapered Evaluation with:
- - Material
- - Piece-Square Tables
- - Several evaluation terms per piece type (e.g. passed pawn, king safety, etc.)
- - Penalty for undefended minor pieces
- - And more
+ - Material
+ - Piece-Square Tables
+ - Several evaluation terms per piece type (e.g. passed pawn, king safety, etc.)
+ - Penalty for undefended minor pieces
+ - And more
- Evaluation values automatically tuned using a gradient descent tuner with the Adam optimizer.
- Principal Variation Search with Alpha-Beta pruning
- Quiescence Search with delta pruning and SEE move ordering
@@ -44,6 +51,7 @@ on GitHub.
- And more! This list is constantly growing and changing, but it is difficult to keep track of all features and changes.
# UCI Options
+
Zagreus Engine has the following UCI options that can be changed:
- `MoveOverhead` - The amount of time that will be substracted from the internal timer for each move. This helps when
@@ -59,17 +67,21 @@ Zagreus uses CMake to build. On Windows you can use the [CMake-GUI](https://cmak
following commands:
Clone the repository:
+
```bash
git clone https://github.com/Dannyj1/Zagreus.git
```
If you want to use Clang/LLVM, set the compiler to clang++ (not required. If you don't run these commands, your default
compiler will be used which works fine in most cases):
+
```bash
export CC=/usr/bin/clang-
export CXX=/usr/bin/clang++-
```
+
Build:
+
```bash
cd
cmake -DCMAKE_BUILD_TYPE=Release .
@@ -77,10 +89,9 @@ cmake --build .
```
# Credits
+
Thanks to:
-- [zd3nik](https://github.com/zd3nik) for the [Senjo UCI Adapter](https://github.com/zd3nik/SenjoUCIAdapter), which I
- slightly modified
- [AndyGrant](https://github.com/AndyGrant) for the easy to use and open
source [OpenBench Testing Framework](https://github.com/AndyGrant/OpenBench), making testing my engine SO much easier
and allowing you to distribute test over multiple devices (I use a private instance of OpenBench)
@@ -93,7 +104,7 @@ Thanks to:
# License
-Copyright (C) 2023 Danny Jelsma
+Copyright (C) 2023-2025 Danny Jelsma
Zagreus is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published
@@ -107,6 +118,3 @@ GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with Zagreus. If not, see .
-
-This project uses the [Senjo UCI Adapter](https://github.com/zd3nik/SenjoUCIAdapter) by zd3nik which is licensed under
-the MIT license. All files from the Senjo UCI Adapter retain their original copyright and license notices.
diff --git a/senjo/BackgroundCommand.cpp b/senjo/BackgroundCommand.cpp
deleted file mode 100644
index 1de45c9d..00000000
--- a/senjo/BackgroundCommand.cpp
+++ /dev/null
@@ -1,277 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#include "BackgroundCommand.h"
-#include "Output.h"
-#include
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
- bool BackgroundCommand::parseAndExecute(Parameters ¶ms) {
- if (!parse(params)) {
- return false;
- }
-
- if (isRunning()) {
- Output() << "Another background command is still active, can't execute";
- return false;
- }
-
- if (!engine.isInitialized()) {
- engine.initialize();
- }
-
- return run();
- }
-
-//-----------------------------------------------------------------------------
- bool RegisterCommandHandle::parse(Parameters ¶ms) {
- later = false;
- code = "";
- name = "";
-
- params.popParam("later", later);
- params.popString("name", name, "code");
- params.popString("code", code);
-
- if (params.size()) {
- Output() << "Unexpected token: " << params.front();
- return false;
- }
-
- return true;
- }
-
-//-----------------------------------------------------------------------------
- void RegisterCommandHandle::doWork() {
- static const std::string registrationOK = "registration ok";
-
- Output(Output::NoPrefix) << "registration checking";
- if (engine.isRegistered()) {
- Output(Output::NoPrefix) << registrationOK;
- } else if (later) {
- engine.registerLater();
- Output(Output::NoPrefix) << registrationOK;
- } else if (engine.doRegistration(name, code)) {
- Output(Output::NoPrefix) << registrationOK;
- } else {
- Output(Output::NoPrefix) << "registration error";
- }
- }
-
-//-----------------------------------------------------------------------------
- bool GoCommandHandle::parse(Parameters ¶ms) {
- goParams = GoParams(); // reset all params to default values
-
- bool invalid = false;
- while (!invalid && params.size()) {
- if (params.firstParamIs("searchmoves")) {
- Output() << "searchmoves not implemented!"; // TODO
- break;
- }
- if (params.popParam("infinite", goParams.infinite) ||
- params.popParam("ponder", goParams.ponder) ||
- params.popNumber("depth", goParams.depth) ||
- params.popNumber("movestogo", goParams.movestogo) ||
- params.popNumber("binc", goParams.binc) ||
- params.popNumber("btime", goParams.btime) ||
- params.popNumber("movetime", goParams.movetime) ||
- params.popNumber("nodes", goParams.nodes) ||
- params.popNumber("winc", goParams.winc) ||
- params.popNumber("wtime", goParams.wtime)) {
- continue;
- }
- Output() << "Unexpected token: " << params.front();
- return false;
- }
-
- if (invalid) {
- Output() << "usage: " << usage();
- return false;
- }
-
- return true;
- }
-
-//-----------------------------------------------------------------------------
- void GoCommandHandle::doWork() {
- std::string ponderMove;
- std::string bestMove = engine.go(goParams, &ponderMove);
-
- if (bestMove.empty()) {
- bestMove = "none";
- ponderMove.clear();
- }
-
- if (ponderMove.size()) {
- Output(Output::NoPrefix) << "bestmove " << bestMove
- << " ponder " << ponderMove;
- } else {
- Output(Output::NoPrefix) << "bestmove " << bestMove;
- }
- }
-
-//-----------------------------------------------------------------------------
- const std::string PerftCommandHandle::_TEST_FILE = "epd/perftsuite.epd";
-
-//-----------------------------------------------------------------------------
- bool PerftCommandHandle::parse(Parameters ¶ms) {
- count = 0;
- skip = 0;
- maxDepth = 0;
- maxLeafs = 0;
- fileName = "";
-
- bool epd = false;
- bool invalid = false;
-
- while (params.size() && !invalid) {
- if (params.popParam("epd", epd) ||
- params.popNumber("count", count, invalid) ||
- params.popNumber("skip", skip, invalid) ||
- params.popNumber("depth", maxDepth, invalid) ||
- params.popNumber("leafs", maxLeafs, invalid) ||
- params.popString("file", fileName)) {
- continue;
- }
- Output() << "Unexpected token: " << params.front();
- return false;
- }
-
- if (invalid) {
- Output() << "usage: " << usage();
- return false;
- }
-
- if (epd && fileName.empty()) {
- fileName = _TEST_FILE;
- }
-
- return true;
- }
-
-//-----------------------------------------------------------------------------
- void PerftCommandHandle::doWork() {
- if (fileName.empty()) {
- engine.perft(maxDepth);
- return;
- }
-
- std::ifstream fs(fileName);
-
- const TimePoint start = now();
- uint64_t pcount = 0;
- bool done = false;
- int positions = 0;
- int line = 0;
-
- std::string fen;
- fen.reserve(16384);
-
- while (!done && std::getline(fs, fen)) {
- line++;
-
- size_t i = fen.find_first_not_of(" \t\r\n");
- if ((i == std::string::npos) || (fen[i] == '#')) {
- continue;
- }
-
- positions++;
- if ((skip > 0) && (positions <= skip)) {
- continue;
- }
-
- Output() << fileName << " line " << line << ' ' << fen;
- std::string remain;
- if (!engine.setPosition(fen, &remain)) {
- break;
- }
-
- // process "D" parameters (e.g. D5 4865609)
- Parameters params(remain);
- while (!done && params.size()) {
- std::string depthToken = trim(params.popString(), " ;");
- if (depthToken.empty() || (depthToken.at(0) != 'D')) {
- continue;
- }
-
- int16_t depth = toNumber(depthToken.substr(1));
- if (depth < 1) {
- Output() << "--- invalid depth: " << depthToken;
- break;
- }
-
- if (params.empty()) {
- Output() << "--- missing expected leaf count";
- break;
- }
-
- uint64_t leafs = params.popNumber();
- if (leafs < 1) {
- Output() << "--- invalid expected leaf count";
- break;
- }
-
- done |= !process(depth, leafs, pcount);
- }
-
- done |= ((count > 0) && (positions >= count));
- }
-
- double msecs = getMsecs(start, now());
- double kLeafs = (static_cast(pcount) / 1000);
-
- Output() << "Total Perft " << pcount << ' '
- << rate(kLeafs, msecs) << " KLeafs/sec";
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Perform [q]perft search, \p params format = 'D'
-//! \param[in] depth The depth to search to
-//! \param[in] expected_leaf_count The expected leaf count at \p depth
-//! \param[out] leaf_count The actual leaf count at \p depth
-//! \return false if leaf_count count does not match expected leaf count
-//-----------------------------------------------------------------------------
- bool PerftCommandHandle::process(const int16_t depth,
- const uint64_t expected_leaf_count,
- uint64_t &leaf_count) {
- if ((maxDepth > 0) && (depth > maxDepth)) {
- return true;
- }
-
- if ((maxLeafs > 0) && (expected_leaf_count > maxLeafs)) {
- return true;
- }
-
- Output() << "--- " << depth << " => " << expected_leaf_count;
- uint64_t perft_count = engine.perft(depth);
- leaf_count += perft_count;
-
- if (perft_count != expected_leaf_count) {
- Output() << "--- " << perft_count << " != " << expected_leaf_count;
- return false;
- }
-
- return true;
- }
-} // namespace senjo
diff --git a/senjo/BackgroundCommand.h b/senjo/BackgroundCommand.h
deleted file mode 100644
index 17616018..00000000
--- a/senjo/BackgroundCommand.h
+++ /dev/null
@@ -1,173 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_BACKGROUND_COMMAND_H
-#define SENJO_BACKGROUND_COMMAND_H
-
-#include "ChessEngine.h"
-#include "Parameters.h"
-#include "GoParams.h"
-#include "Thread.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
-//! \brief Base class for a command that should run on a background thread
-//-----------------------------------------------------------------------------
- class BackgroundCommand : public Thread {
- public:
- //--------------------------------------------------------------------------
- //! \brief Constructor
- //! \param[in] engine The chess engine to use while executing
- //--------------------------------------------------------------------------
- BackgroundCommand(ChessEngine &chessEngine)
- : engine(chessEngine) {}
-
- //--------------------------------------------------------------------------
- //! \brief Parse command parameters and execute on the given thread
- //! \param[in] params The command parameters
- //! \return true if parameters are valid and execution started
- //--------------------------------------------------------------------------
- virtual bool parseAndExecute(Parameters ¶ms);
-
- //--------------------------------------------------------------------------
- //! \brief Provide usage syntax for this command
- //! For example: "command_name [boolean_option_name] [option_name ]"
- //! \return Usage syntax string for this command
- //--------------------------------------------------------------------------
- virtual std::string usage() const = 0;
-
- //--------------------------------------------------------------------------
- //! \brief Provide a brief description of this command
- //! \return A brief description of this command
- //--------------------------------------------------------------------------
- virtual std::string description() const = 0;
-
- //--------------------------------------------------------------------------
- //! \brief Parse command parameters
- //! \param[in] params The command parameters
- //! \return true if the given parameters are valid
- //--------------------------------------------------------------------------
- virtual bool parse(Parameters ¶ms) = 0;
-
- protected:
- ChessEngine &engine;
- };
-
-//-----------------------------------------------------------------------------
-//! \brief Wrapper for the UCI "register" command
-//-----------------------------------------------------------------------------
- class RegisterCommandHandle : public BackgroundCommand {
- public:
- RegisterCommandHandle(ChessEngine &eng) : BackgroundCommand(eng) {}
-
- std::string usage() const {
- return "register [later] [name ] [code ]";
- }
-
- std::string description() const {
- return "Register the chess engine to enable full functionality.";
- }
-
- void stop() {}
-
- protected:
- bool parse(Parameters ¶ms);
-
- void doWork();
-
- private:
- bool later;
- std::string code;
- std::string name;
- };
-
-//-----------------------------------------------------------------------------
-//! \brief Wrapper for the UCI "go" command
-//-----------------------------------------------------------------------------
- class GoCommandHandle : public BackgroundCommand {
- public:
- GoCommandHandle(ChessEngine &eng) : BackgroundCommand(eng) {}
-
- std::string usage() const {
- return "go [infinite] [ponder] [depth ] [nodes ] "
- "[wtime ] [btime ] [winc ] [binc ] "
- "[movetime ] [movestogo ] [searchmoves ]";
- }
-
- std::string description() const {
- return "Find the best move for the current position.";
- }
-
- void stop() {
- engine.stopSearching();
- }
-
- protected:
- bool parse(Parameters ¶ms);
-
- void doWork();
-
- private:
- GoParams goParams;
- };
-
-//-----------------------------------------------------------------------------
-//! \brief Wrapper for the "perft" command (not a UCI command)
-//-----------------------------------------------------------------------------
- class PerftCommandHandle : public BackgroundCommand {
- public:
- PerftCommandHandle(ChessEngine &eng) : BackgroundCommand(eng) {}
-
- std::string usage() const {
- return "perft [unsorted] [depth ] [count ] [skip ] [leafs ] "
- "[epd] [file (default=" + _TEST_FILE + ")]";
- }
-
- std::string description() const {
- return "Execute performance test.";
- }
-
- void stop() {
- engine.stopSearching();
- }
-
- protected:
- bool parse(Parameters ¶ms);
-
- void doWork();
-
- private:
- bool process(const int16_t depth, const uint64_t expected_leaf_count,
- uint64_t &leaf_count);
-
- static const std::string _TEST_FILE;
-
- int count;
- int skip;
- int maxDepth;
- uint64_t maxLeafs;
- std::string fileName;
- };
-} // namespace senjo
-
-#endif // SENJO_BACKGROUND_COMMAND_H
diff --git a/senjo/CMakeLists.txt b/senjo/CMakeLists.txt
deleted file mode 100644
index a8b55207..00000000
--- a/senjo/CMakeLists.txt
+++ /dev/null
@@ -1,9 +0,0 @@
-cmake_minimum_required(VERSION 3.1)
-project(senjo CXX)
-
-file(GLOB OBJ_HDR *.h)
-file(GLOB OBJ_SRC *.cpp)
-
-include_directories(.)
-add_library(${PROJECT_NAME} STATIC ${OBJ_HDR} ${OBJ_SRC})
-
diff --git a/senjo/ChessEngine.cpp b/senjo/ChessEngine.cpp
deleted file mode 100644
index ce8ca801..00000000
--- a/senjo/ChessEngine.cpp
+++ /dev/null
@@ -1,74 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#include "ChessEngine.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
- const std::string ChessEngine::STARTPOS =
- "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
-
-//-----------------------------------------------------------------------------
- std::string ChessEngine::getEmailAddress() {
- return "";
- }
-
-//-----------------------------------------------------------------------------
- std::string ChessEngine::getCountryName() {
- return "";
- }
-
-//-----------------------------------------------------------------------------
- bool ChessEngine::isRegistered() {
- return true;
- }
-
-//-----------------------------------------------------------------------------
- void ChessEngine::registerLater() {
- }
-
-//-----------------------------------------------------------------------------
- bool ChessEngine::doRegistration(const std::string & /*name*/,
- const std::string & /*code*/) {
- return true;
- }
-
-//-----------------------------------------------------------------------------
- bool ChessEngine::isCopyProtected() {
- return false;
- }
-
-//-----------------------------------------------------------------------------
- bool ChessEngine::copyIsOK() {
- return true;
- }
-
-//-----------------------------------------------------------------------------
- void ChessEngine::resetEngineStats() {
- }
-
-//-----------------------------------------------------------------------------
- void ChessEngine::showEngineStats() {
- }
-
-} // namespace senjo
diff --git a/senjo/ChessEngine.h b/senjo/ChessEngine.h
deleted file mode 100644
index 92f29f73..00000000
--- a/senjo/ChessEngine.h
+++ /dev/null
@@ -1,279 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_CHESS_ENGINE_H
-#define SENJO_CHESS_ENGINE_H
-
-#include "EngineOption.h"
-#include "GoParams.h"
-#include "SearchStats.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
-//! \brief Base class for Senjo compatible chess engines
-//! Derive from this class to create a chess engine that may be used with
-//! the Senjo UCIAdapter.
-//-----------------------------------------------------------------------------
- class ChessEngine {
- public:
- virtual ~ChessEngine() {}
-
- //---------------------------------------------------------------------------
- //! \brief FEN string of standard chess start position
- //! See http://en.wikipedia.org/wiki/Forsyth%E2%80%93Edwards_Notation
- //---------------------------------------------------------------------------
- static const std::string STARTPOS;
-
- //---------------------------------------------------------------------------
- //! \brief Get the engine name
- //! \return The engine name
- //---------------------------------------------------------------------------
- virtual std::string getEngineName() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Get the engine version (e.g. "major.minor.build" e.g. "1.0.0")
- //! \return The engine version
- //---------------------------------------------------------------------------
- virtual std::string getEngineVersion() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Get the engine author name(s)
- //! \return The engine author name(s)
- //---------------------------------------------------------------------------
- virtual std::string getAuthorName() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Get email address(es) for use with this engine
- //! Return an empty string if you don't wish to report an email address.
- //! \return An email address(es) for use with this engine
- //---------------------------------------------------------------------------
- virtual std::string getEmailAddress() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Get the name of the country this engine originates from
- //! Return an empty string if you don't wish to report a country
- //! \return The name of the country this engine originates from
- //---------------------------------------------------------------------------
- virtual std::string getCountryName() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Get options supported by the engine, and their current values
- //! \return A list of the engine's options and their current values
- //---------------------------------------------------------------------------
- virtual std::list getOptions() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Set a particular option to a given value
- //! Option value may be empty, particularly if the option type is Button
- //! \param[in] optionName The option name
- //! \param[in] optionValue The new option value
- //! \return false if the option name or value is invalid
- //---------------------------------------------------------------------------
- virtual bool setEngineOption(const std::string &optionName,
- const std::string &optionValue) = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Initialize the engine
- //---------------------------------------------------------------------------
- virtual void initialize() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Is the engine initialized?
- //! \return true if the engine is initialized
- //---------------------------------------------------------------------------
- virtual bool isInitialized() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Set the board position according to a given FEN string
- //! The engine should use Output() to report errors in the FEN string.
- //! Only use position info from the given FEN string, don't process any moves
- //! or other data present in the FEN string.
- //! \param[in] fen The FEN string on input
- //! \param[out] remain If not NULL populated with tail portion of \p fen
- //! string that was not used to set the position.
- //! \return false if the FEN string does not contain a valid position
- //---------------------------------------------------------------------------
- virtual bool setPosition(const std::string &fen,
- std::string* remain = nullptr) = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Execute a single move on the current position
- //! Determine whether the given string is a valid move
- //! and if it is apply the move to the current position.
- //! Moves should be in coordinate notation (e.g. "e2e4", "g8f6", "e7f8q").
- //! \param[in] move A string containing move coordinate notation
- //! \return false if the given string isn't a valid move
- //---------------------------------------------------------------------------
- virtual bool makeMove(const std::string &move) = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Get a FEN string representation of the current board position
- //! \return A FEN string representation of the current board postiion
- //---------------------------------------------------------------------------
- virtual std::string getFEN() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Output a text representation of the current board position
- //---------------------------------------------------------------------------
- virtual void printBoard() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Is it white to move in the current position?
- //! \return true if it is white to move in the current position
- //---------------------------------------------------------------------------
- virtual bool whiteToMove() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Clear any engine data that can persist between searches
- //! Examples of search data are the transposition transpositionTable and killer moves.
- //---------------------------------------------------------------------------
- virtual void clearSearchData() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief The last ponder move was played
- //! The Go() method may return a ponder move which is the expected response
- //! to the bestmove returned by Go(). If pondering is enabled the UCI
- //! adapter may tell the engine to ponder this move, e.g. start searching
- //! for a reply to the ponder move. If, while the engine is pondering, the
- //! ponder move is played this method will be called. In general the engine
- //! should make what it has learned from its pondering available for the next
- //! Go() call.
- //---------------------------------------------------------------------------
- virtual void ponderHit() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Is the engine registered?
- //! \return true if the engine is registered
- //---------------------------------------------------------------------------
- virtual bool isRegistered() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Register the engine later
- //! The engine should still function, but may cripple itself in some fashion.
- //---------------------------------------------------------------------------
- virtual void registerLater() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Register the engine now
- //! If this fails the engine should still function, but may cripple itself
- //! in some fashion.
- //! \param[in] name The name to register the engine to
- //! \param[in] code The code to use for registration
- //! \return true if successful
- //---------------------------------------------------------------------------
- virtual bool doRegistration(const std::string &name,
- const std::string &code) = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Does this engine use copy protection?
- //! \return true if the engine uses copy protection
- //---------------------------------------------------------------------------
- virtual bool isCopyProtected() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Determine whether this is a legitimate copy of the engine
- //! This method will be called if IsCopyProtected() returns true. This is
- //! where your engine should try to determine whether it is a legitimate
- //! copy or not.
- //! \return true if the engine is a legitimate copy
- //---------------------------------------------------------------------------
- virtual bool copyIsOK() = 0;
-
- //--------------------------------------------------------------------------
- //! \brief Set the engine's debug mode on or off
- //! \param[in] flag true to enable debug mode, false to disable debug mode
- //---------------------------------------------------------------------------
- virtual void setDebug(const bool flag) = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Is debug mode enabled?
- //! \return true if debug mode is enabled
- //---------------------------------------------------------------------------
- virtual bool isDebugOn() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Is the engine currently executing the Go() method?
- //! It is not recommended to set this to true while Perft() is executing.
- //! \return true if the engine is searching
- //---------------------------------------------------------------------------
- virtual bool isSearching() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Tell the engine to stop searching
- //! Exit Perft()/Go() methods as quickly as possible.
- //---------------------------------------------------------------------------
- virtual void stopSearching() = 0;
-
- //--------------------------------------------------------------------------
- //! \brief Was stopSearching() called after the last go() or perft() call?
- //! \return true if stopSearching() called after the last go() or perft() call
- //--------------------------------------------------------------------------
- virtual bool stopRequested() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Block execution on the calling thread until the engine is
- //! finished searching. Return immediateky if no search in progress.
- //---------------------------------------------------------------------------
- virtual void waitForSearchFinish() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Do performance test on the current position
- //! \param[in] depth How many half-moves (plies) to search
- //! \return The number of leaf nodes visited at \p depth
- //---------------------------------------------------------------------------
- virtual uint64_t perft(const int16_t depth) = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Execute search on current position to find best move
- //! \param[in] params UCI "go" command parameters
- //! \param[out] ponder If not null set to the move engine should ponder next
- //! \return Best move in coordinate notation (e.g. "e2e4", "g8f6", "e7f8q")
- //---------------------------------------------------------------------------
- virtual std::string go(GoParams ¶ms,
- std::string* ponder = nullptr) = 0;
-
- //--------------------------------------------------------------------------
- //! \brief Get statistics about the last (or current) search
- //! \param[in] count The maximum number of lines to get stats for
- //! \return a SearchStats struct updated with the latest search stats
- //--------------------------------------------------------------------------
- virtual SearchStats getSearchStats() = 0;
-
- //--------------------------------------------------------------------------
- //! \brief Reset custom engine statistical counter totals
- //! \remark Override if you desire custom engine stats to be output when
- //! the "test" command is run.
- //--------------------------------------------------------------------------
- virtual void resetEngineStats() = 0;
-
- //--------------------------------------------------------------------------
- //! \brief Output engine stats collected since last resetEngineStats call
- //! \remark Override if you desire custom engine stats to be output when
- //! the "test" command is run.
- //--------------------------------------------------------------------------
- virtual void showEngineStats() = 0;
- };
-
-} // namespace senjo
-
-#endif // SENJO_CHESS_ENGINE_H
diff --git a/senjo/EngineOption.cpp b/senjo/EngineOption.cpp
deleted file mode 100644
index 4b8ab3a2..00000000
--- a/senjo/EngineOption.cpp
+++ /dev/null
@@ -1,157 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#include "EngineOption.h"
-
-namespace senjo {
-
- static const char* OPT_BUTTON_NAME = "button";
- static const char* OPT_CHECK_NAME = "check";
- static const char* OPT_COMBO_NAME = "combo";
- static const char* OPT_SPIN_NAME = "spin";
- static const char* OPT_STRING_NAME = "string";
- static const char* OPT_UNKNOWN_NAME = "unknown";
-
-//-----------------------------------------------------------------------------
- EngineOption::OptionType EngineOption::toOptionType(const std::string &name) {
- if (!iEqual(name, OPT_BUTTON_NAME)) {
- return Button;
- }
- if (!iEqual(name, OPT_CHECK_NAME)) {
- return Checkbox;
- }
- if (!iEqual(name, OPT_COMBO_NAME)) {
- return ComboBox;
- }
- if (!iEqual(name, OPT_SPIN_NAME)) {
- return Spin;
- }
- if (!iEqual(name, OPT_STRING_NAME)) {
- return String;
- }
- return Unknown;
- }
-
-//-----------------------------------------------------------------------------
- std::string EngineOption::getTypeName(const OptionType type) {
- switch (type) {
- case Button:
- return OPT_BUTTON_NAME;
- case Checkbox:
- return OPT_CHECK_NAME;
- case ComboBox:
- return OPT_COMBO_NAME;
- case Spin:
- return OPT_SPIN_NAME;
- case String:
- return OPT_STRING_NAME;
- default:
- break;
- }
- return OPT_UNKNOWN_NAME;
- }
-
-//-----------------------------------------------------------------------------
- EngineOption::EngineOption(const std::string &optName,
- const std::string &defaultValue,
- const OptionType optType,
- const int64_t minValue,
- const int64_t maxValue,
- const std::set &comboValues)
- : optType(optType),
- optName(optName),
- optValue(defaultValue),
- defaultValue(defaultValue),
- minValue(minValue),
- maxValue(maxValue),
- comboValues(comboValues) {}
-
-//-----------------------------------------------------------------------------
- int64_t EngineOption::getIntValue() const {
- return toNumber(optValue);
- }
-
-//-----------------------------------------------------------------------------
- int64_t EngineOption::getDefaultIntValue() const {
- return toNumber(defaultValue);
- }
-
-//-----------------------------------------------------------------------------
- std::set EngineOption::getIntComboValues() const {
- std::set values;
- for (auto value : comboValues) {
- int64_t n = toNumber(value, -1);
- if (n >= 0) {
- values.insert(n);
- }
- }
- return values;
- }
-
-//-----------------------------------------------------------------------------
- bool EngineOption::setValue(const std::string &value) {
- switch (optType) {
- case Checkbox:
- if (!iEqual(value, "true") && !iEqual(value, "false")) {
- return false;
- }
- break;
- case ComboBox:
- if (!comboValues.count(value)) {
- return false;
- }
- break;
- case Spin: {
- int64_t intval = toNumber(value, minValue - 1);
- if (intval < minValue || intval > maxValue) {
- return false;
- }
- break;
- }
- case String:
- break;
- default:
- return false;
- }
- optValue = value;
- return true;
- }
-
-//-----------------------------------------------------------------------------
- bool EngineOption::setValue(const int64_t value) {
- return setValue(std::to_string(value));
- }
-
-//-----------------------------------------------------------------------------
- void EngineOption::setDefaultValue(const int64_t value) {
- setDefaultValue(std::to_string(value));
- }
-
-//-----------------------------------------------------------------------------
- void EngineOption::setComboValues(const std::set &values) {
- comboValues.clear();
- for (auto value : values) {
- comboValues.insert(std::to_string(value));
- }
- }
-
-} // namespace senjo
diff --git a/senjo/EngineOption.h b/senjo/EngineOption.h
deleted file mode 100644
index 5a9451ca..00000000
--- a/senjo/EngineOption.h
+++ /dev/null
@@ -1,223 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_ENGINE_OPTION_H
-#define SENJO_ENGINE_OPTION_H
-
-#include "Platform.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
-//! \brief Simple representaion of a single chess engine option
-//! Provides details such as option type, name, default/min/max values.
-//-----------------------------------------------------------------------------
- class EngineOption {
- public:
- virtual ~EngineOption() {}
-
- enum OptionType {
- Unknown, ///< Unknown option type
- Button, ///< Option does not have a value
- Checkbox, ///< Option value must be "true" or "false"
- ComboBox, ///< Option value must be one of a predefined set
- Spin, ///< Option value must be an integer between min and max
- String ///< Option value must be a string
- };
-
- //--------------------------------------------------------------------------
- //! \brief Convert option type name to OptionType
- //! \param[in] name The option type name
- //! \return Unknown if \p name is not known
- //--------------------------------------------------------------------------
- static OptionType toOptionType(const std::string &name);
-
- //--------------------------------------------------------------------------
- //! \brief Get a string representation of a given option type
- //! \param[in] type The option type
- //! \return A string representation of \p type
- //--------------------------------------------------------------------------
- static std::string getTypeName(const OptionType type);
-
- //--------------------------------------------------------------------------
- //! \brief Constructor
- //! \param[in] name The option name (default = empty)
- //! \param[in] defaultValue The option default value (default = empty)
- //! \param[in] type The option type (default = String)
- //! \param[in] minValue The min value for Spin options (default = INT64_MIN)
- //! \param[in] maxValue The max value for Spin options (default = INT64_MAX)
- //! \param[in] combo Set of legal ComboBox values (default = empty)
- //--------------------------------------------------------------------------
- EngineOption(const std::string &name = std::string(),
- const std::string &defaultValue = std::string(),
- const OptionType type = String,
- const int64_t minValue = INT64_MIN,
- const int64_t maxValue = INT64_MAX,
- const std::set &combo = std::set());
-
- //--------------------------------------------------------------------------
- //! \brief Get the option type
- //! \return The option type
- //--------------------------------------------------------------------------
- OptionType getType() const { return optType; }
-
- //--------------------------------------------------------------------------
- //! \brief Get a string representation of the option type
- //! \return A string representation of the option type
- //--------------------------------------------------------------------------
- virtual std::string getTypeName() const { return getTypeName(optType); }
-
- //--------------------------------------------------------------------------
- //! \brief Get the option name
- //! \return The option name
- //--------------------------------------------------------------------------
- virtual std::string getName() const { return optName; }
-
- //--------------------------------------------------------------------------
- //! \brief Get the option's current value in string form
- //! \return The option's current value in string form
- //--------------------------------------------------------------------------
- virtual std::string getValue() const { return optValue; }
-
- //--------------------------------------------------------------------------
- //! \brief Get the option's current value in integer form
- //! \return The option's current value in integer form, 0 if not an integer
- //--------------------------------------------------------------------------
- virtual int64_t getIntValue() const;
-
- //--------------------------------------------------------------------------
- //! \brief Get the option's default value in string form
- //! \return The option's default value in string form
- //--------------------------------------------------------------------------
- virtual std::string getDefaultValue() const { return defaultValue; }
-
- //--------------------------------------------------------------------------
- //! \brief Get the option's default value in integer form
- //! \return The option's default value in integer form, 0 if not an integer
- //--------------------------------------------------------------------------
- virtual int64_t getDefaultIntValue() const;
-
- //--------------------------------------------------------------------------
- //! \brief Get the option's minimum value (applicable to Spin type only)
- //! \return The option's minimum value
- //--------------------------------------------------------------------------
- virtual int64_t getMinValue() const { return minValue; }
-
- //--------------------------------------------------------------------------
- //! \brief Get the option's maximum value (applicable to Spin type only)
- //! \return The option's maximum value
- //--------------------------------------------------------------------------
- virtual int64_t getMaxValue() const { return maxValue; }
-
- //--------------------------------------------------------------------------
- //! \brief Get set of legal values for ComboBox options in string form
- //! \return set of legal values for ComboBox options in string form
- //--------------------------------------------------------------------------
- virtual const std::set &getComboValues() const {
- return comboValues;
- }
-
- //--------------------------------------------------------------------------
- //! \brief Get set of legal values for ComboBox options in integer form
- //! \return set of legal values for ComboBox options in integer form
- //--------------------------------------------------------------------------
- virtual std::set getIntComboValues() const;
-
- //--------------------------------------------------------------------------
- //! \brief Set the option type
- //! \param[in] type The new option type
- //--------------------------------------------------------------------------
- virtual void setType(const OptionType type) { optType = type; }
-
- //--------------------------------------------------------------------------
- //! \brief Set the option name
- //! \param[in] name The new option name
- //--------------------------------------------------------------------------
- virtual void setName(const std::string &name) { optName = name; }
-
- //--------------------------------------------------------------------------
- //! \brief Set the option's current value
- //! \param[in] value The new option value
- //--------------------------------------------------------------------------
- virtual bool setValue(const std::string &value);
-
- //--------------------------------------------------------------------------
- //! \brief Set the option's current value
- //! \param[in] value The new option value
- //! \return true if \p value is valid, otherwise false
- //--------------------------------------------------------------------------
- virtual bool setValue(const int64_t value);
-
- //--------------------------------------------------------------------------
- //! \brief Set the option's default value
- //! \param[in] value The new default value
- //! \return true if \p value is valid, otherwise false
- //--------------------------------------------------------------------------
- virtual void setDefaultValue(const std::string &value) {
- defaultValue = value;
- }
-
- //--------------------------------------------------------------------------
- //! \brief Set the option's default value
- //! \param[in] value The new default value
- //--------------------------------------------------------------------------
- virtual void setDefaultValue(const int64_t value);
-
- //--------------------------------------------------------------------------
- //! \brief Set the option's minimum value (applicable to Spin type only)
- //! \param[in] min The new minimum value
- //--------------------------------------------------------------------------
- virtual void setMinValue(const int64_t min) { minValue = min; }
-
- //--------------------------------------------------------------------------
- //! \brief Set the option's maximum value (applicable to Spin type only)
- //! \param[in] max The new maximum value
- //--------------------------------------------------------------------------
- virtual void setMaxValue(const int64_t max) { maxValue = max; }
-
- //--------------------------------------------------------------------------
- //! \brief Set legal values for ComboBox options
- //! \param[in] values The set of legal values
- //--------------------------------------------------------------------------
- virtual void setComboValues(const std::set &values) {
- comboValues = values;
- }
-
- //--------------------------------------------------------------------------
- //! \brief Set legal values for ComboBox options
- //! \param[in] values The set of legal values
- //--------------------------------------------------------------------------
- virtual void setComboValues(const std::set &values);
-
- private:
- OptionType optType;
- std::string optName;
- std::string optValue;
- std::string defaultValue;
- int64_t minValue;
- int64_t maxValue;
- std::set comboValues;
- };
-
-} // namespace
-
-#endif // SENJO_ENGINE_OPTION_H
diff --git a/senjo/GoParams.h b/senjo/GoParams.h
deleted file mode 100644
index 2da7c56a..00000000
--- a/senjo/GoParams.h
+++ /dev/null
@@ -1,45 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_GO_PARAMS_H
-#define SENJO_GO_PARAMS_H
-
-#include "Platform.h"
-
-namespace senjo {
-
- struct GoParams {
- bool infinite = false; // SearchManager until the "stop" command
- bool ponder = false; // Start searching in pondering mode
- int16_t depth = 0; // Maximum number of half-moves (plies) to search
- int movestogo = 0; // Number of moves remaining until next time control
- uint64_t binc = 0; // BLACK increment per move in milliseconds
- uint64_t btime = 0; // Milliseconds remaining on black's clock
- uint64_t movetime = 0; // Maximum milliseconds to spend on this move
- uint64_t nodes = 0; // Maximum number of nodes to search
- uint64_t winc = 0; // WHITE increment per move in milliseconds
- uint64_t wtime = 0; // Milliseconds remaining on white's clock
- };
-
-} // namespace senjo
-
-#endif // SENJO_GO_PARAMS_H
diff --git a/senjo/Output.cpp b/senjo/Output.cpp
deleted file mode 100644
index cb8da25a..00000000
--- a/senjo/Output.cpp
+++ /dev/null
@@ -1,58 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#include "Output.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
-// static variables
-//-----------------------------------------------------------------------------
- std::mutex Output::_mutex;
- TimePoint Output::_lastOutput = now();
-
-//-----------------------------------------------------------------------------
- TimePoint Output::lastOutput() {
- return _lastOutput;
- }
-
-//-----------------------------------------------------------------------------
- Output::Output(const OutputPrefix prefix) {
- _mutex.lock();
- switch (prefix) {
- case InfoPrefix:
- std::cout << "info string ";
- break;
- case NoPrefix:
- break;
- }
- }
-
-//-----------------------------------------------------------------------------
- Output::~Output() {
- std::cout << '\n';
- std::cout.flush();
- _lastOutput = now();
- _mutex.unlock();
- }
-
-} // namespace senjo
diff --git a/senjo/Output.h b/senjo/Output.h
deleted file mode 100644
index 41a80c6e..00000000
--- a/senjo/Output.h
+++ /dev/null
@@ -1,134 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_OUTPUT_H
-#define SENJO_OUTPUT_H
-
-#include "Platform.h"
-#include
-#include
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
-//! \brief Thread safe stdout stream
-//! Instantiating this class will obtain a lock on a mtuex guarding stdout.
-//! The stdout mutex is released when the instantiated object is destroyed.
-//!
-//! \e Important: '\n' is automatically appended when the object is destroyed.
-//! \e Important: The UCI protocol requires that lines end with a single
-//! new-line character: '\n'. So you should *not* use std::endl, as this will
-//! output '\r\n' on windows systems and '\r' on some other systems.
-//!
-//! Example:
-//!
-//! Output() << "Hello, world!";
-//!
-//! Notice it is not necessary to add '\n' on the end.
-//!
-//! Example of multiple line outout:
-//!
-//! Output() << "Line 1";
-//! Output() << "Line 2";
-//!
-//! Notice it is not necessary to add '\n' on the end of either line.
-//! Notice it is possible that other threads could output something between
-//! "Line 1" and "Line 2".
-//!
-//! Example of multiple line outout without allowing another thread to output
-//! between each line:
-//!
-//! Output() << "Line 1\n"
-//! << "info string Line 2";
-//! or
-//! Output() << "Line 1\ninfo string Line 2";
-//! or
-//! Output() << "Line " << 1 << '\n' << "info string " << "Line " << 2;
-//! etc..
-//!
-//! Notice each case uses a single Output() instance.
-//! Notice it is not necessary to add '\n' after the last line.
-//! Notice it is necessary to explicitly prefix all but the first line with
-//! "info string ". If you know what you're doing concerning the UCI protocol
-//! you can omit "info string " where appropriate.
-//!
-//! To maintain exclusive access to stdout so that processing can be done
-//! between lines of output without allowing another thread to output between
-//! lines:
-//!
-//! {
-//! Output out;
-//! out << "line 1\n";
-//! ... do some processing ...
-//! out << "info string line 2";
-//! }
-//!
-//! Notice the code is enclosed in { } to clearly define the scope of 'out'.
-//! Notice it is not necessary to add '\n' after the last line.
-//! Notice it is necessary to explicitly prefix all but the first line with
-//! "info string ". If you know what you're doing concerning the UCI protocol
-//! you can omit "info string " where appropriate.
-//-----------------------------------------------------------------------------
- class Output {
- public:
- enum OutputPrefix {
- NoPrefix, ///< Don't prefix output with "info string "
- InfoPrefix ///< Prefix output with "info string "
- };
-
- //--------------------------------------------------------------------------
- //! \brief Constructor
- //! If \p param is InfoPrefix then output is prefixed with "info string ".
- //! \param[in] prefix NoPrefix or InfoPrefix (InfoPrefix is the default)
- //--------------------------------------------------------------------------
- Output(const OutputPrefix prefix = InfoPrefix);
-
- //--------------------------------------------------------------------------
- //! \brief Destructor
- //--------------------------------------------------------------------------
- virtual ~Output();
-
- //--------------------------------------------------------------------------
- //! \brief Get timestamp of the last time an Output class was destroyed
- //! \return Timestamp of last Output class destruction, 0 if none
- //--------------------------------------------------------------------------
- static TimePoint lastOutput();
-
- //--------------------------------------------------------------------------
- //! \brief Insertion operator
- //! All data types supported by std::cout are supported here.
- //! \return Reference to self.
- //--------------------------------------------------------------------------
- template
- Output &operator<<(const T &x) {
- std::cout << x;
- return *this;
- }
-
- private:
- static std::mutex _mutex;
- static TimePoint _lastOutput;
- };
-
-} // namespace senjo
-
-#endif // SENJO_OUTPUT_H
diff --git a/senjo/Parameters.cpp b/senjo/Parameters.cpp
deleted file mode 100644
index 586b091c..00000000
--- a/senjo/Parameters.cpp
+++ /dev/null
@@ -1,112 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#include "Parameters.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
- Parameters::Parameters(const std::string &commandLine) {
- parse(commandLine);
- }
-
-//-----------------------------------------------------------------------------
- void Parameters::parse(const std::string &str) {
- std::stringstream ss(str);
- std::string param;
- clear();
- while (ss >> param) {
- push_back(param);
- }
- }
-
-//-----------------------------------------------------------------------------
- std::string Parameters::toString() const {
- std::stringstream ss;
- bool first = true;
- for (std::string param : *this) {
- if (first) {
- first = false;
- } else {
- ss << ' ';
- }
- ss << param;
- }
- return ss.str();
- }
-
-//-----------------------------------------------------------------------------
- bool Parameters::firstParamIs(const std::string ¶mName) const {
- return size() && iEqual(paramName, front());
- }
-
-//-----------------------------------------------------------------------------
- bool Parameters::popParam(const std::string ¶mName) {
- if (firstParamIs(paramName)) {
- pop_front();
- return true;
- }
-
- return false;
- }
-
-//-----------------------------------------------------------------------------
- bool Parameters::popParam(const std::string ¶mName, bool &exists) {
- if (popParam(paramName)) {
- exists = true;
- return true;
- }
- return false;
- }
-
-//-----------------------------------------------------------------------------
- std::string Parameters::popString() {
- if (empty()) {
- return "";
- }
-
- std::string str = front();
- pop_front();
- return str;
- }
-
-//-----------------------------------------------------------------------------
- bool Parameters::popString(const std::string ¶mName, std::string &value,
- const std::string &next) {
- if (size() < 2 || !iEqual(paramName, front())) {
- return false;
- }
-
- pop_front();
- while (size() && (next.empty() || !iEqual(next, front()))) {
- if (value.size()) {
- value += " ";
- }
- value += front();
- pop_front();
- }
-
- return value.size() > 0;
- }
-
-} // namespace senjo
-
diff --git a/senjo/Parameters.h b/senjo/Parameters.h
deleted file mode 100644
index 43bf1bf4..00000000
--- a/senjo/Parameters.h
+++ /dev/null
@@ -1,144 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_PARAMETERS_H
-#define SENJO_PARAMETERS_H
-
-#include "Platform.h"
-
-namespace senjo {
-
- class Parameters : public std::list {
- public:
- Parameters() = default;
-
- Parameters(const std::string &commandLine);
-
- //---------------------------------------------------------------------------
- //! \brief Initialize this instance from the given string
- //---------------------------------------------------------------------------
- void parse(const std::string &str);
-
- //---------------------------------------------------------------------------
- //! \brief Join the parameters together into a single space delimited string
- //---------------------------------------------------------------------------
- std::string toString() const;
-
- //---------------------------------------------------------------------------
- //! \brief Test whether the specified paramName matches the first param
- //! \param[in] paramName The parameter name to check for
- //! \return true if the specified paramName matches the first param
- //---------------------------------------------------------------------------
- bool firstParamIs(const std::string ¶mName) const;
-
- //---------------------------------------------------------------------------
- //! \brief Pop the specified paramName
- //! \param[in] paramName The parameter name to pop
- //! \return true if the specified paramName was popped
- //---------------------------------------------------------------------------
- bool popParam(const std::string ¶mName);
-
- //---------------------------------------------------------------------------
- //! \brief Pop the specified paramName
- //! \param[in] paramName The parameter name to pop
- //! \param[out] exists Set to true if the specified paramName was popped
- //! \return true if the specified paramName was popped
- //---------------------------------------------------------------------------
- bool popParam(const std::string ¶mName, bool &exists);
-
- //-----------------------------------------------------------------------------
- //! \brief Pop the first string
- //! \return an empty string if the parameters list is empty
- //-----------------------------------------------------------------------------
- std::string popString();
-
- //-----------------------------------------------------------------------------
- //! \brief Pop the specified paramName and the following string value
- //! \param[in] paramName The name of the string parameter to pop
- //! \param[out] value Populated with the string value of \p paramName
- //! \param[in] next The next expected parameter name
- //! \return true If a non-empty value was assigned to \p value
- //-----------------------------------------------------------------------------
- bool popString(const std::string ¶mName, std::string &value,
- const std::string &next = "");
-
- //-----------------------------------------------------------------------------
- //! \brief Pop the first param as a number
- //! \return \defaultValue if the parameters list is empty
- //! or the first param could not be converted to the number type
- //-----------------------------------------------------------------------------
- template
- T popNumber(const T &defaultValue = 0) {
- if (empty()) {
- return defaultValue;
- }
-
- std::stringstream ss(front());
- T value;
- if (ss >> value) {
- pop_front();
- return value;
- }
-
- return defaultValue;
- }
-
- //-----------------------------------------------------------------------------
- //! \brief Pop the specified paramName and the following number value
- //! \param[in] paramName The name of the numeric parameter to pop
- //! \param[out] value Populated with the numeric value of \p paramName
- //! \param[out] invalid Set to true if paramName has a non-numeric value
- //! \return true if a number value was assigned to \p number
- //-----------------------------------------------------------------------------
- template
- bool popNumber(const std::string ¶mName, T &value, bool &invalid) {
- if (size() < 2 || !iEqual(paramName, front())) {
- return false;
- }
-
- pop_front();
- std::stringstream ss(front());
- if (ss >> value) {
- pop_front();
- return true;
- }
-
- invalid = true;
- return false;
- }
-
- //-----------------------------------------------------------------------------
- //! \brief Pop the specified paramName and the following number value
- //! \param[in] paramName The name of the numeric parameter to pop
- //! \param[out] value Populated with the numeric value of \p paramName
- //! \return true if a number value was assigned to \p number
- //-----------------------------------------------------------------------------
- template
- bool popNumber(const std::string ¶mName, T &value) {
- bool invalid;
- return popNumber(paramName, value, invalid);
- }
- };
-
-} // namespace senjo
-
-#endif // SENJO_PARAMETERS_H
diff --git a/senjo/Platform.h b/senjo/Platform.h
deleted file mode 100644
index 8376eec3..00000000
--- a/senjo/Platform.h
+++ /dev/null
@@ -1,140 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_PLATFORM_H
-#define SENJO_PLATFORM_H
-
-#ifdef WIN32
-
-#include
-
-#undef max
-#undef min
-#endif
-
-#include
-#include
-#include
-#include
-#include
-#include
-#include
-#include
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
- typedef std::chrono::system_clock::time_point TimePoint;
-
-//-----------------------------------------------------------------------------
- inline TimePoint now() {
- return std::chrono::system_clock::now();
- }
-
-//-----------------------------------------------------------------------------
- inline TimePoint maxTime() {
- return TimePoint::max();
- }
-
-//-----------------------------------------------------------------------------
- inline TimePoint addMsecs(const TimePoint &begin, const uint64_t msecs) {
- return (begin + std::chrono::milliseconds(msecs));
- }
-
-//-----------------------------------------------------------------------------
- inline uint64_t getMsecs(const TimePoint &begin, const TimePoint &end = now()) {
- auto duration = (end - begin);
- auto msecs = std::chrono::duration_cast(duration);
- return static_cast(msecs.count());
- }
-
-//-----------------------------------------------------------------------------
- template
- inline double average(const T total, const T count) {
- return (count != 0.0) ? (static_cast(total) / static_cast(count)) : 0;
- }
-
-//-----------------------------------------------------------------------------
- template
- inline double rate(const T count, const T msecs) {
- return (msecs != 0.0) ? ((static_cast(count) / static_cast(msecs)) * 1000) : 0;
- }
-
-//-----------------------------------------------------------------------------
- template
- inline double percent(const T top, const T bottom) {
- return bottom ? (100 * (static_cast(top) / static_cast(bottom))) : 0;
- }
-
-//-----------------------------------------------------------------------------
- template
- inline T toNumber(const std::string &str, const T defaultValue = 0) {
- T number;
- return (std::stringstream(str) >> number) ? number : defaultValue;
- }
-
-//-----------------------------------------------------------------------------
- inline std::string trimLeft(const std::string &str,
- const std::string &chars = " ") {
- size_t i = str.find_first_not_of(chars);
- return (i == std::string::npos) ? str : str.substr(i);
- }
-
-//-----------------------------------------------------------------------------
- inline std::string trimRight(const std::string &str,
- const std::string &chars = " ") {
- size_t i = str.size();
- while ((i > 0) && (chars.find_first_of(str[i - 1]) != std::string::npos)) {
- --i;
- }
- return str.substr(0, i);
- }
-
-//-----------------------------------------------------------------------------
- inline std::string trim(const std::string &str,
- const std::string &chars = " ") {
- return trimRight(trimLeft(str, chars), chars);
- }
-
-//-----------------------------------------------------------------------------
- inline bool iEqual(const std::string &a, const std::string &b) {
- return ((a.size() == b.size()) &&
- std::equal(a.begin(), a.end(), b.begin(), [](char c1, char c2) {
- return (c1 == c2) || (std::toupper(c1) == std::toupper(c2));
- }));
- }
-
-//-----------------------------------------------------------------------------
- inline bool isMove(const std::string &str) {
- return (str.size() >= 4) &&
- (str[0] >= 'a') && (str[0] <= 'h') &&
- (str[1] >= '1') && (str[1] <= '8') &&
- (str[2] >= 'a') && (str[2] <= 'h') &&
- (str[3] >= '1') && (str[3] <= '8') &&
- ((str.size() == 4) ||
- (str[4] == 'n') || (str[4] == 'b') ||
- (str[4] == 'r') || (str[4] == 'q'));
- }
-
-} // namespace senjo
-
-#endif // SENJO_PLATFORM_H
diff --git a/senjo/README.md b/senjo/README.md
deleted file mode 100644
index 55f860ea..00000000
--- a/senjo/README.md
+++ /dev/null
@@ -1,112 +0,0 @@
-Senjo
-=====
-
-Universal Chess Interface (UCI) adapter by Shawn Chidester .
-
-Just write your chess engine and let Senjo's UCIAdapter deal with the UCI protocol.
-See [Clubfoot](https://github.com/zd3nik/Clubfoot) for an example chess engine that uses Senjo.
-
-See the [senjo-light](https://github.com/zd3nik/SenjoUCIAdapter/tree/senjo-light) branch for a version that does not
-include a built-in `test` command.
-
-Description
------------
-
-Senjo is a UCI adapter for C++ chess engines. It handles the interaction between your chess engine and any UCI compliant
-user interface. All you have to do is implement a ChessEngine class that does the "thinking" parts, Senjo will deal with
-the rest.
-
-The Senjo UCI adapter comes with a few extra commands that are not part of the UCI specification. Here are some
-examples:
-
- * help
- * fen
- * print
- * perft
- * test
-
-In particular the *perft* and *test* commands are very handy for testing and tuning. A few EPD files are included in
-this repository for use with these commands. But of course you can use any EPD file(s) you prefer.
-
-How-To
-------
-
-To create a chess engine named "Trout" using the Senjo UCI adapter do the following:
-
- 1. Extend the "ChessEngine" class.
-
- // TroutEngine.h
- #include "senjo/ChessEngine.h"
-
- class TroutEngine : public senjo::ChessEngine {
- // implement required ChessEngine methods
- // see ChessEngine.h for documentation
- };
-
- 2. Wrap TroutEngine in a Senjo UCIAdapter and feed it one line of input from stdin at a time.
-
- // TroutMain.cpp
- #include "TroutEngine.h"
- #include "senjo/UCIAdapter.h"
- #include "senjo/Output.h"
-
- int main(int /*argc*/, char** /*argv*/) {
- try {
- TroutEngine engine;
- senjo::UCIAdapter adapter(engine);
-
- std::string line;
- line.reserve(16384);
-
- while (std::getline(std::coin, line)) {
- if (!adapter.doCommand(line)) {
- break;
- }
- }
-
- return 0;
- }
- catch (const std::exception& e) {
- senjo::Output() << "ERROR: " << e.what();
- return 1;
- }
- }
-
-
-Notes
------
-
-This example uses `std::getline` to obtain one line of input at a time from stdin. This is only an example. You may get
-input any way you prefer. All that is required is that you assign each line of input to a std::string, pass it to the
-senjo::UCIAdapter's doCommand() method, and exit the input loop if doCommand() returns false.
-
-The `senjo::Output` class (from Output.h) is very useful for debugging. Use it anywhere; it's thread safe and it
-prefixes your output with "string info " so it won't confuse UCI compliant user interfaces. See `Output.h` for more
-details.
-
-The senjo source directory contains a `CMakelists.txt` file, which is a cmake project file. If you're using cmake simply
-add the senjo directory to your project with `add_subirectory(senjo)`. If you're not using cmake simply remove he
-CMakeLists.txt file and include the senjo source files in your project in whatever way is most convenient for you.
-
-License
--------
-
-Copyright (c) 2015-2019 Shawn Chidester
-
-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.
diff --git a/senjo/SearchStats.h b/senjo/SearchStats.h
deleted file mode 100644
index 2ff3b874..00000000
--- a/senjo/SearchStats.h
+++ /dev/null
@@ -1,56 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_SEARCH_STATS_H
-#define SENJO_SEARCH_STATS_H
-
-#include "Platform.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
- struct SearchStats {
- int16_t depth = 0; // The current search depth
- int seldepth = 0; // The maximum selective depth reached on "move"
- uint64_t nodes = 0; // The number of nodes searched so far
- uint64_t qnodes = 0; // The number of quiescence nodes searched so far
- uint64_t msecs = 0; // The number of milliseconds spent searching so far
- int score = 0;
- std::string pv = "";
- };
-
-//-----------------------------------------------------------------------------
- inline std::ostream &operator<<(std::ostream &os, const SearchStats &stats) {
- os << "info depth " << stats.depth
- << " seldepth " << stats.seldepth
- << " score cp " << stats.score
- << " nodes " << stats.nodes + stats.qnodes
- << " time " << stats.msecs
- << " nps " << static_cast((stats.nodes + stats.qnodes) / std::max(stats.msecs / 1000.0, 1.0))
- << " pv " << stats.pv;
-
- return os;
- }
-
-} // namespace senjo
-
-#endif // SENJO_SEARCH_STATS_H
diff --git a/senjo/Thread.cpp b/senjo/Thread.cpp
deleted file mode 100644
index a85a658e..00000000
--- a/senjo/Thread.cpp
+++ /dev/null
@@ -1,75 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#include "Thread.h"
-#include "Output.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
- Thread::Thread(int id)
- : id(id) {}
-
-//-----------------------------------------------------------------------------
- Thread::~Thread() {
- waitForFinish();
- }
-
-//-----------------------------------------------------------------------------
- bool Thread::run() {
- std::lock_guard lock(mutex);
- if (thread && thread->joinable()) {
- return false;
- }
-
- thread.reset(new std::thread(staticRun, this));
- return true;
- }
-
-//-----------------------------------------------------------------------------
- bool Thread::isRunning() {
- std::lock_guard lock(mutex);
- return thread && thread->joinable();
- }
-
-//-----------------------------------------------------------------------------
- void Thread::waitForFinish() {
- std::lock_guard lock(mutex);
- if (thread && thread->joinable()) {
- thread->join();
- }
- }
-
-//-----------------------------------------------------------------------------
- void Thread::staticRun(Thread* thread) {
- if (thread) {
- try {
- thread->doWork();
- } catch (const std::exception &ex) {
- Output() << "ERROR: Thread(" << thread->getInfoPair() << ") " << ex.what();
- } catch (...) {
- Output() << "ERROR: Thread(" << thread->getInfoPair() << ") unhandled exception";
- }
- }
- }
-
-} // namespace senjo
diff --git a/senjo/Thread.h b/senjo/Thread.h
deleted file mode 100644
index 83ab99ad..00000000
--- a/senjo/Thread.h
+++ /dev/null
@@ -1,102 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_THREADING_H
-#define SENJO_THREADING_H
-
-#include "Platform.h"
-#include
-#include
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
-//! \brief Base class for a single background task.
-//-----------------------------------------------------------------------------
- class Thread {
- protected:
- std::shared_ptr thread;
- std::mutex mutex;
-
- //---------------------------------------------------------------------------
- //! \brief Constructor
- //---------------------------------------------------------------------------
- explicit Thread(int id = -1);
-
- //---------------------------------------------------------------------------
- //! This method is called once when the thread is run.
- //! When this method exits the thread is finished.
- //---------------------------------------------------------------------------
- virtual void doWork() = 0;
-
- public:
- //---------------------------------------------------------------------------
- // Delete copy operations
- //---------------------------------------------------------------------------
- Thread(const Thread &) = delete;
-
- Thread &operator=(const Thread &) = delete;
-
- //---------------------------------------------------------------------------
- //! \brief Destructor
- //---------------------------------------------------------------------------
- virtual ~Thread();
-
- //---------------------------------------------------------------------------
- //! \brief Get the id of this thread.
- //! \return the id of this thread
- //---------------------------------------------------------------------------
- int getInfoPair() const { return id; }
-
- //---------------------------------------------------------------------------
- //! \brief Run this thread.
- //! \return false if the thread is already running
- //---------------------------------------------------------------------------
- virtual bool run();
-
- //---------------------------------------------------------------------------
- //! \brief Tell this thread to exit the doWork() method as soon as possible.
- //! Should do nothing if the thread is already stopped.
- //---------------------------------------------------------------------------
- virtual void stop() = 0;
-
- //---------------------------------------------------------------------------
- //! \brief Is this thread running?
- //! \return true If this thread is running
- //---------------------------------------------------------------------------
- bool isRunning();
-
- //---------------------------------------------------------------------------
- //! \brief Wait for this thread to finish running.
- //! If this thread isn't running this method returns immediately.
- //---------------------------------------------------------------------------
- void waitForFinish();
-
- private:
- static void staticRun(Thread*);
-
- int id;
- };
-
-} // namespace senjo
-
-#endif // SENJO_THREADING_H
diff --git a/senjo/UCIAdapter.cpp b/senjo/UCIAdapter.cpp
deleted file mode 100644
index ef07f757..00000000
--- a/senjo/UCIAdapter.cpp
+++ /dev/null
@@ -1,667 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#include "UCIAdapter.h"
-#include "Output.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
- namespace token {
- static const std::string Debug("debug");
- static const std::string Exit("exit");
- static const std::string Fen("fen");
- static const std::string Go("go");
- static const std::string Help("help");
- static const std::string IsReady("isready");
- static const std::string Moves("moves");
- static const std::string Name("name");
- static const std::string New("new");
- static const std::string Opts("opts");
- static const std::string Perft("perft");
- static const std::string PonderHit("ponderhit");
- static const std::string Position("position");
- static const std::string Print("print");
- static const std::string Quit("quit");
- static const std::string Register("register");
- static const std::string SetOption("setoption");
- static const std::string StartPos("startpos");
- static const std::string Stop("stop");
- static const std::string Test("test");
- static const std::string Uci("uci");
- static const std::string UciNewGame("ucinewgame");
- static const std::string Value("value");
- }
-
-//-----------------------------------------------------------------------------
- UCIAdapter::UCIAdapter(ChessEngine &chessEngine)
- : engine(chessEngine) {}
-
-//-----------------------------------------------------------------------------
- UCIAdapter::~UCIAdapter() {
- if (lastCommand) {
- lastCommand->waitForFinish();
- }
- }
-
-//-----------------------------------------------------------------------------
- bool UCIAdapter::doCommand(const std::string &line) {
- Parameters params(line);
- if (params.empty()) {
- return true; // ignore empty lines
- }
-
- if (engine.isDebugOn()) {
- Output() << "received command: " << line;
- }
-
- std::string command = params.popString();
- if (iEqual(token::Go, command)) {
- doStopCommand();
- execute(std::shared_ptr(new GoCommandHandle(engine)), params);
- } else if (iEqual(token::Position, command)) {
- doStopCommand();
- doPositionCommand(line, params);
- } else if (iEqual(token::Stop, command)) {
- doStopCommand(params);
- } else if (iEqual(token::SetOption, command)) {
- doSetOptionCommand(params);
- } else if (iEqual(token::IsReady, command)) {
- doIsReadyCommand(params);
- } else if (iEqual(token::Uci, command)) {
- doUCICommand(params);
- } else if (iEqual(token::UciNewGame, command)) {
- doStopCommand();
- doUCINewGameCommand(params);
- } else if (iEqual(token::New, command)) {
- doStopCommand();
- doNewCommand(params);
- } else if (iEqual(token::Debug, command)) {
- doDebugCommand(params);
- } else if (iEqual(token::Register, command)) {
- doStopCommand(params);
- execute(std::shared_ptr(new RegisterCommandHandle(engine)), params);
- } else if (iEqual(token::PonderHit, command)) {
- doPonderHitCommand(params);
- } else if (iEqual(token::Fen, command)) {
- doFENCommand(params);
- } else if (iEqual(token::Print, command)) {
- doPrintCommand(params);
- } else if (iEqual(token::Perft, command)) {
- doStopCommand();
- execute(std::shared_ptr(new PerftCommandHandle(engine)), params);
- } else if (iEqual(token::Opts, command)) {
- doOptsCommand(params);
- } else if (iEqual(token::Help, command)) {
- doHelpCommand(params);
- } else if (iEqual(token::Exit, command) ||
- iEqual(token::Quit, command)) {
- if (doQuitCommand(params)) {
- return false;
- }
- } else if (isMove(command)) {
- doStopCommand();
- params.push_front(command);
- doMoveCommand(params);
- } else {
- Output() << "Unknown command: '" << command << "'";
- Output() << "Enter 'help' for a list of commands";
- }
- return true;
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Output list of available commands (not a UCI command)
-//-----------------------------------------------------------------------------
- void UCIAdapter::doHelpCommand(Parameters & /*params*/) {
- Output() << engine.getEngineName() << ' ' << engine.getEngineVersion()
- << " by " << engine.getAuthorName();
- Output() << "UCI commands:";
- Output() << " " << token::Debug;
- Output() << " " << token::Go;
- Output() << " " << token::IsReady;
- Output() << " " << token::Position;
- Output() << " " << token::Quit;
- Output() << " " << token::SetOption;
- Output() << " " << token::Stop;
- Output() << " " << token::Uci;
- Output() << " " << token::UciNewGame;
- Output() << "Additional commands:";
- Output() << " " << token::Exit;
- Output() << " " << token::Fen;
- Output() << " " << token::Help;
- Output() << " " << token::New;
- Output() << " " << token::Perft;
- Output() << " " << token::Print;
- Output() << "Also try ' help' for help on a specific command";
- Output() << "Or enter move(s) in coordinate notation, e.g. d2d4 g8f6";
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Execute the given background command thread
-//-----------------------------------------------------------------------------
- void UCIAdapter::execute(std::shared_ptr command,
- Parameters ¶ms) {
- if (!command) {
- return;
- }
-
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << command->usage();
- Output() << command->description();
- return;
- }
-
- if (lastCommand) {
- lastCommand->stop();
- lastCommand->waitForFinish();
- }
-
- if (command->parseAndExecute(params)) {
- lastCommand.swap(command);
- }
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the "fen" command (not a UCI command)
-//! Print the FEN string for the current board position
-//-----------------------------------------------------------------------------
- void UCIAdapter::doFENCommand(Parameters ¶ms) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::Fen;
- Output() << "Output FEN string of the current position.";
- return;
- }
-
- if (lastCommand) {
- lastCommand->stop();
- lastCommand->waitForFinish();
- }
-
- if (!engine.isInitialized()) {
- engine.initialize();
- }
-
- Output() << engine.getFEN();
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the "print" command (not a UCI command)
-//! Output an ascii representation of the current board position
-//-----------------------------------------------------------------------------
- void UCIAdapter::doPrintCommand(Parameters ¶ms) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::Print;
- Output() << "Output text representation of the current position.";
- return;
- }
-
- if (!engine.isInitialized()) {
- engine.initialize();
- }
-
- engine.printBoard();
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the "new" command (not a UCI command)
-//! Clear search data, set position, and apply moves (if any given).
-//-----------------------------------------------------------------------------
- void UCIAdapter::doNewCommand(Parameters ¶ms) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::New << " [" << token::StartPos << "|"
- << token::Fen << " ] [" << token::Moves
- << "] ";
- Output() << "Clear search data, set position, and apply .";
- Output() << "If no position is specified " << token::StartPos
- << " is assumed.";
- return;
- }
-
- doUCINewGameCommand();
-
- if (params.empty() ||
- params.popParam(token::StartPos) ||
- params.popParam(token::Moves)) {
- if (!engine.setPosition(ChessEngine::STARTPOS)) {
- return;
- }
- } else {
- // consume "fen" token if present
- params.popParam(token::Fen);
- std::string remain;
- if (!engine.setPosition(params.toString(), &remain)) {
- return;
- }
- params.parse(remain);
- }
-
- // consume "moves" token if present
- params.popParam(token::Moves);
-
- // apply moves (if any)
- while (params.size() && isMove(params.front())) {
- std::string move = params.popString();
- if (!engine.makeMove(move)) {
- Output() << "Invalid move: " << move;
- break;
- }
- }
-
- if (engine.isDebugOn()) {
- engine.printBoard();
- }
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the "opts" command (not a UCI command)
-//! Output current engine option values
-//-----------------------------------------------------------------------------
- void UCIAdapter::doOptsCommand(Parameters & /*params*/) {
- for (auto opt : engine.getOptions()) {
- switch (opt.getType()) {
- case EngineOption::Checkbox:
- case EngineOption::Spin:
- case EngineOption::String:
- Output() << opt.getTypeName() << ':' << opt.getName() << ' '
- << opt.getValue();
- break;
- case EngineOption::ComboBox: {
- const std::set &values = opt.getComboValues();
- Output out;
- out << opt.getTypeName() << ':' << opt.getName();
- for (auto value : values) {
- out << ' ' << value;
- }
- break;
- }
- default:
- break;
- }
- }
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Execute the given move(s) on the current position
-//-----------------------------------------------------------------------------
- void UCIAdapter::doMoveCommand(Parameters ¶ms) {
- if (!engine.isInitialized()) {
- engine.initialize();
- }
-
- if (lastCommand) {
- lastCommand->stop();
- lastCommand->waitForFinish();
- }
-
- lastPosition.clear();
- while (params.size()) {
- std::string move = params.popString();
- if (!isMove(move) || !engine.makeMove(move)) {
- Output() << "Invalid move: " << move;
- return;
- }
-
- if (engine.isDebugOn()) {
- engine.printBoard();
- }
- }
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "quit" command
-//! UCI specification:
-//! Quit the program as soon as possible.
-//! \return true if quit requested, otherwise false
-//-----------------------------------------------------------------------------
- bool UCIAdapter::doQuitCommand(Parameters ¶ms) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::Quit;
- Output() << "Stop engine and terminate program.";
- return false;
- }
-
- engine.stopSearching();
-
- if (lastCommand) {
- lastCommand->stop();
- lastCommand->waitForFinish();
- }
-
- return true;
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "debug" command
-//! UCI specification:
-//! Switch the debug mode of the engine on and off. In debug mode the engine
-//! should send additional infos to the GUI, e.g. with the "info string"
-//! command, to help debugging, e.g. the commands that the engine has
-//! received etc. This mode should be switched off by default and this
-//! command can be sent any time, also when the engine is thinking.
-//-----------------------------------------------------------------------------
- void UCIAdapter::doDebugCommand(Parameters ¶ms) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::Debug;
- Output() << "Toggle debug mode.";
- return;
- }
-
- engine.setDebug(!engine.isDebugOn());
- Output() << "debug " << (engine.isDebugOn() ? "on" : "off");
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "isready" command
-//! UCI specification:
-//! This is used to synchronize the engine with the GUI. When the GUI has
-//! sent a command or multiple commands that can take some time to complete,
-//! this command can be used to wait for the engine to be ready again or
-//! to ping the engine to find out if it is still alive. E.g. this should be
-//! sent after setting the path to the tablebases as this can take some time.
-//! This command is also required once before the engine is asked to do any
-//! search to wait for the engine to finish initializing. This command must
-//! always be answered with "readyok" and can be sent also when the engine
-//! is calculating in which case the engine should also immediately answer
-//! with "readyok" without stopping the search.
-//-----------------------------------------------------------------------------
- void UCIAdapter::doIsReadyCommand(Parameters ¶ms) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::IsReady;
- Output() << "Output readyok when engine is ready to receive input.";
- return;
- }
-
- if (!engine.isInitialized()) {
- engine.initialize();
- }
-
- if (lastCommand) {
- // don't set stop flag
- lastCommand->waitForFinish();
- }
-
- Output(Output::NoPrefix) << "readyok";
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "stop" command
-//! UCI specification:
-//! Stop calculating as soon as possible, don't forget the "bestmove" and
-//! possibly the "ponder" token when finishing the search.
-//-----------------------------------------------------------------------------
- void UCIAdapter::doStopCommand(Parameters params) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::Stop;
- Output() << "Stop engine if it is calculating.";
- return;
- }
-
- engine.stopSearching();
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "uci" command
-//! UCI specification:
-//! Tell engine to use the uci (universal chess interface), this will be sent
-//! once as a first command after program boot to tell the engine to switch
-//! to uci mode. After receiving the uci command the engine must identify
-//! itself with the "id" command and send the "option" commands to tell the
-//! GUI which engine settings the engine supports if any. After that the
-//! engine should send "uciok" to acknowledge the uci mode. If no uciok is
-//! sent within a certain time period, the engine task will be killed by the
-//! GUI.
-//-----------------------------------------------------------------------------
- void UCIAdapter::doUCICommand(Parameters ¶ms) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::Uci;
- Output() << "Output engine info and options followed by uciok.";
- return;
- }
-
- Output(Output::NoPrefix) << "id name " << engine.getEngineName()
- << ' ' << engine.getEngineVersion();
-
- const std::string author = engine.getAuthorName();
- if (author.size()) {
- Output(Output::NoPrefix) << "id author " << author;
- }
-
- const std::string email = engine.getEmailAddress();
- if (email.size()) {
- Output(Output::NoPrefix) << "id email " << email;
- }
-
- const std::string country = engine.getCountryName();
- if (country.size()) {
- Output(Output::NoPrefix) << "id country " << country;
- }
-
- for (auto opt : engine.getOptions()) {
- Output out(Output::NoPrefix);
- out << "option name " << opt.getName() << " type " << opt.getTypeName();
- if (opt.getDefaultValue().size()) {
- out << " default " << opt.getDefaultValue();
- }
- if (opt.getMinValue() > INT64_MIN) {
- out << " min " << opt.getMinValue();
- }
- if (opt.getMaxValue() < INT64_MAX) {
- out << " max " << opt.getMaxValue();
- }
- for (auto val : opt.getComboValues()) {
- out << " var " << val;
- }
- }
-
- Output(Output::NoPrefix) << "uciok";
-
- if (engine.isCopyProtected()) {
- Output(Output::NoPrefix) << "copyprotection checking";
- if (engine.copyIsOK()) {
- Output(Output::NoPrefix) << "copyprotection ok";
- } else {
- Output(Output::NoPrefix) << "copyprotection error";
- }
- }
-
- if (!engine.isRegistered()) {
- Output(Output::NoPrefix) << "registration error";
- }
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "ucinewgame" command
-//! UCI specification:
-//! This is sent to the engine when the next search (started with "position"
-//! and "go") will be from a different game. This can be a new game the
-//! engine should play or a new game it should analyse but also the next
-//! position from a testsuite with positions only. If the GUI hasn't sent a
-//! "ucinewgame" before the first "position" command, the engine shouldn't
-//! expect any further ucinewgame commands as the GUI is probably not
-//! supporting the ucinewgame command. So the engine should not rely on this
-//! command even though all new GUIs should support it. As the engine's
-//! reaction to "ucinewgame" can take some time the GUI should always send
-//! "isready" after "ucinewgame" to wait for the engine to finish its
-//! operation.
-//-----------------------------------------------------------------------------
- void UCIAdapter::doUCINewGameCommand(Parameters params) {
- if (params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::UciNewGame;
- Output() << "Clear all search data.";
- return;
- }
-
- if (!engine.isInitialized()) {
- engine.initialize();
- }
-
- if (lastCommand) {
- lastCommand->stop();
- lastCommand->waitForFinish();
- }
-
- lastPosition.clear();
- engine.clearSearchData();
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "position" command
-//! UCI specification:
-//! Set up the position described in fenstring on the internal board and
-//! play the moves on the internal chess board. If the game was played from
-//! the start position the string "startpos" will be sent.
-//! Note: no "new" command is needed. However, if this position is from a
-//! different game than the last position sent to the engine, the GUI should
-//! have sent a "ucinewgame" inbetween.
-//-----------------------------------------------------------------------------
- void UCIAdapter::doPositionCommand(const std::string &fenstring,
- Parameters ¶ms) {
- if (params.empty() || params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::Position << " {" << token::StartPos << "|"
- << token::Fen << " } []";
- Output() << "Set a new position and apply (if given).";
- return;
- }
-
- if (!engine.isInitialized()) {
- engine.initialize();
- lastPosition.clear();
- }
-
- if (lastCommand) {
- lastCommand->stop();
- lastCommand->waitForFinish();
- }
-
- if (lastPosition.size() &&
- lastPosition == fenstring.substr(0, lastPosition.size())) {
- // continue from current position
- params.parse(fenstring.substr(lastPosition.size() + 1));
- } else {
- if (params.firstParamIs(token::StartPos)) {
- if (!engine.setPosition(ChessEngine::STARTPOS)) {
- return;
- }
- } else {
- // consume "fen" token if present
- params.popParam(token::Fen);
- std::string remain;
- if (!engine.setPosition(params.toString(), &remain)) {
- return;
- }
- params.parse(remain);
- }
- }
-
- // remember this position command for next time
- lastPosition = fenstring;
-
- // consume "moves" token if present
- params.popParam(token::StartPos);
- params.popParam(token::Moves);
-
- // apply moves (if any)
- while (params.size() && isMove(params.front())) {
- std::string move = params.popString();
- if (!engine.makeMove(move)) {
- Output() << "Invalid move: " << move;
- lastPosition.clear();
- break;
- }
- }
-
- if (engine.isDebugOn()) {
- engine.printBoard();
- }
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "setoption" command
-//! UCI specification:
-//! This is sent to the engine when the user wants to change the internal
-//! parameters of the engine. For the "button" type no value is needed.
-//! One string will be sent for each parameter and this will only be sent
-//! when the engine is waiting. The name and value of the option in
-//! should not be case sensitive and can inlude spaces. The substrings
-//! "value" and "name" should be avoided in and to allow unambiguous
-//! parsing, for example do not use = "draw value".
-//! Here are some strings for the example below:
-//! "setoption name Nullmove value true\n"
-//! "setoption name Selectivity value 3\n"
-//! "setoption name Style value Risky\n"
-//! "setoption name Clear Hash\n"
-//! "setoption name NalimovPath value c:\chess\tb\4;c:\chess\tb\5\n"
-//-----------------------------------------------------------------------------
- void UCIAdapter::doSetOptionCommand(Parameters ¶ms) {
- if (params.empty() || params.firstParamIs(token::Help)) {
- Output() << "usage: " << token::SetOption << ' ' << token::Name
- << " [" << token::Value << " ]";
- Output() << "Set the value of the specified option name.";
- Output() << "If no value specified the option's default value is used,";
- Output() << "or the option will be triggered if it's a button option.";
- return;
- }
-
- std::string name;
- std::string value;
-
- if (!params.firstParamIs(token::Name)) {
- Output() << "Missing name token";
- return;
- }
-
- if (!params.popString(token::Name, name, token::Value)) {
- Output() << "Missing name value";
- return;
- }
-
- if (params.firstParamIs(token::Value)) {
- if (!params.popString(token::Value, value)) {
- Output() << "Missing value";
- return;
- }
- }
-
- if (params.size()) {
- Output() << "Unexpected token: " << params.front();
- return;
- }
-
- if (!engine.setEngineOption(name, value)) {
- Output() << "Unknown option name '" << name
- << "' or invalid option value '" << value << "'";
- }
- }
-
-//-----------------------------------------------------------------------------
-//! \brief Do the UCI "ponderhit" command
-//! UCI specification:
-//! The user has played the expected move. This will be sent if the engine
-//! was told to ponder on the same move the user has played. The engine
-//! should continue searching but switch from pondering to normal search.
-//-----------------------------------------------------------------------------
- void UCIAdapter::doPonderHitCommand(Parameters & /*params*/) {
- engine.ponderHit();
- }
-
-} // namespace senjo
diff --git a/senjo/UCIAdapter.h b/senjo/UCIAdapter.h
deleted file mode 100644
index af021601..00000000
--- a/senjo/UCIAdapter.h
+++ /dev/null
@@ -1,88 +0,0 @@
-//-----------------------------------------------------------------------------
-// Copyright (c) 2015-2019 Shawn Chidester
-//
-// 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.
-//-----------------------------------------------------------------------------
-
-#ifndef SENJO_UCI_ADAPTER_H
-#define SENJO_UCI_ADAPTER_H
-
-#include "ChessEngine.h"
-#include "Parameters.h"
-#include "BackgroundCommand.h"
-
-namespace senjo {
-
-//-----------------------------------------------------------------------------
-//! \brief Convenience class to handle UCI communication for a ChessEngine
-//-----------------------------------------------------------------------------
- class UCIAdapter {
- public:
- UCIAdapter(ChessEngine &engine);
-
- ~UCIAdapter();
-
- //--------------------------------------------------------------------------
- //! \brief Execute the given one-line command
- //! \param[in] cmd The command to execute
- //! \return false when the program should exit, true to continue processing
- //--------------------------------------------------------------------------
- bool doCommand(const std::string &command);
-
- private:
- void doHelpCommand(Parameters ¶ms);
-
- void doFENCommand(Parameters ¶ms);
-
- void doMoveCommand(Parameters ¶ms);
-
- void doNewCommand(Parameters ¶ms);
-
- void doOptsCommand(Parameters ¶ms);
-
- void doPrintCommand(Parameters ¶ms);
-
- bool doQuitCommand(Parameters ¶ms);
-
- void doDebugCommand(Parameters ¶ms);
-
- void doIsReadyCommand(Parameters ¶ms);
-
- void doPonderHitCommand(Parameters ¶ms);
-
- void doSetOptionCommand(Parameters ¶ms);
-
- void doStopCommand(Parameters params = {});
-
- void doUCICommand(Parameters ¶ms);
-
- void doUCINewGameCommand(Parameters params = {});
-
- void doPositionCommand(const std::string &line, Parameters ¶ms);
-
- void execute(std::shared_ptr command, Parameters ¶ms);
-
- ChessEngine &engine;
- std::string lastPosition;
- std::shared_ptr lastCommand;
- };
-
-} // namespace senjo
-
-#endif // SENJO_UCI_ADAPTER_H
diff --git a/src/bitboard.cpp b/src/bitboard.cpp
index fd294f5f..f64fdf55 100644
--- a/src/bitboard.cpp
+++ b/src/bitboard.cpp
@@ -1,8 +1,8 @@
/*
- This file is part of Zagreus.
+This file is part of Zagreus.
Zagreus is a UCI chess engine
- Copyright (C) 2023 Danny Jelsma
+ Copyright (C) 2023-2025 Danny Jelsma
Zagreus is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published
@@ -19,873 +19,141 @@
*/
#include "bitboard.h"
-
-#include
-
-#include "../senjo/Output.h"
-#include "bitwise.h"
+#include
#include "magics.h"
-#include "movegen.h"
-#include "pst.h"
-#include "utils.h"
namespace Zagreus {
-uint64_t Bitboard::getOccupiedBoard() const { return occupiedBB; }
-
-uint64_t Bitboard::getEmptyBoard() const { return ~occupiedBB; }
-
-PieceColor Bitboard::getMovingColor() const { return movingColor; }
-
-void Bitboard::setMovingColor(PieceColor movingColor) { this->movingColor = movingColor; }
-
-PieceType Bitboard::getPieceOnSquare(int8_t square) {
- return pieceSquareMapping[square];
-}
-
-uint64_t Bitboard::getQueenAttacks(int8_t square) {
- return getBishopAttacks(square) | getRookAttacks(square);
-}
-
-uint64_t Bitboard::getQueenAttacks(int8_t square, uint64_t occupancy) {
- return getBishopAttacks(square, occupancy) | getRookAttacks(square, occupancy);
-}
-
-uint64_t Bitboard::getBishopAttacks(int8_t square) {
- uint64_t occupancy = getOccupiedBoard();
- occupancy &= getBishopMask(square);
- occupancy *= getBishopMagic(square);
- occupancy >>= 64 - BBits[square];
-
- return getBishopMagicAttacks(square, occupancy);
-}
-
-uint64_t Bitboard::getBishopAttacks(int8_t square, uint64_t occupancy) {
- occupancy &= getBishopMask(square);
- occupancy *= getBishopMagic(square);
- occupancy >>= 64 - BBits[square];
-
- return getBishopMagicAttacks(square, occupancy);
-}
-
-uint64_t Bitboard::getRookAttacks(int8_t square) {
- uint64_t occupancy = getOccupiedBoard();
- occupancy &= getRookMask(square);
- occupancy *= getRookMagic(square);
- occupancy >>= 64 - RBits[square];
-
- return getRookMagicAttacks(square, occupancy);
-}
-
-uint64_t Bitboard::getRookAttacks(int8_t square, uint64_t occupancy) {
- occupancy &= getRookMask(square);
- occupancy *= getRookMagic(square);
- occupancy >>= 64 - RBits[square];
-
- return getRookMagicAttacks(square, occupancy);
-}
-
-void Bitboard::setPiece(int8_t square, PieceType piece) {
- pieceBB[piece] |= 1ULL << square;
- occupiedBB |= 1ULL << square;
- colorBB[piece % 2] |= 1ULL << square;
- pieceSquareMapping[square] = piece;
- zobristHash ^= getPieceZobristConstant(piece, square);
- materialCount[piece] += 1;
- pstValues[piece % 2] += getMidgamePstValue(piece, square);
- pstValues[piece % 2 + 2] += getEndgamePstValue(piece, square);
-}
-
-void Bitboard::removePiece(int8_t square, PieceType piece) {
- pieceBB[piece] &= ~(1ULL << square);
- occupiedBB &= ~(1ULL << square);
- colorBB[piece % 2] &= ~(1ULL << square);
- pieceSquareMapping[square] = EMPTY;
- zobristHash ^= getPieceZobristConstant(piece, square);
- materialCount[piece] -= 1;
- pstValues[piece % 2] -= getMidgamePstValue(piece, square);
- pstValues[piece % 2 + 2] -= getEndgamePstValue(piece, square);
-}
-
-void Bitboard::makeMove(Move& move) {
- PieceType capturedPiece = getPieceOnSquare(move.to);
-
- undoStack[ply].capturedPiece = capturedPiece;
- undoStack[ply].halfMoveClock = halfMoveClock;
- undoStack[ply].enPassantSquare = enPassantSquare;
- undoStack[ply].castlingRights = castlingRights;
- undoStack[ply].moveType = REGULAR;
- undoStack[ply].zobristHash = zobristHash;
- undoStack[ply].previousMove = previousMove;
-
- halfMoveClock += 1;
-
- if (capturedPiece != EMPTY) {
- halfMoveClock = 0;
- removePiece(move.to, capturedPiece);
- }
-
- if (move.piece == WHITE_PAWN || move.piece == BLACK_PAWN) {
- halfMoveClock = 0;
- }
-
- removePiece(move.from, move.piece);
-
- if (enPassantSquare != NO_SQUARE) {
- zobristHash ^= getEnPassantZobristConstant(enPassantSquare % 8);
- }
-
- if (move.piece == WHITE_PAWN || move.piece == BLACK_PAWN) {
- halfMoveClock = 0;
-
- if (move.to - move.from == 16) {
- enPassantSquare = move.to - 8;
- } else if (move.to - move.from == -16) {
- enPassantSquare = move.to + 8;
- } else if ((std::abs(move.to - move.from) == 7 || std::abs(move.to - move.from) == 9) &&
- move.to == enPassantSquare) {
- int8_t enPassantCaptureSquare = move.to - (movingColor == WHITE ? 8 : -8);
- removePiece(enPassantCaptureSquare, getPieceOnSquare(enPassantCaptureSquare));
- undoStack[ply].moveType = EN_PASSANT;
- enPassantSquare = NO_SQUARE;
- } else {
- enPassantSquare = NO_SQUARE;
- }
- } else {
- enPassantSquare = NO_SQUARE;
- }
-
- if (enPassantSquare != NO_SQUARE) {
- zobristHash ^= getEnPassantZobristConstant(enPassantSquare % 8);
- }
-
- if (move.piece == WHITE_KING || move.piece == BLACK_KING) {
- if (std::abs(move.to - move.from) == 2) {
- if (move.to == G1) {
- removePiece(H1, WHITE_ROOK);
- setPiece(F1, WHITE_ROOK);
- } else if (move.to == C1) {
- removePiece(A1, WHITE_ROOK);
- setPiece(D1, WHITE_ROOK);
- } else if (move.to == G8) {
- removePiece(H8, BLACK_ROOK);
- setPiece(F8, BLACK_ROOK);
- } else if (move.to == C8) {
- removePiece(A8, BLACK_ROOK);
- setPiece(D8, BLACK_ROOK);
- }
-
- undoStack[ply].moveType = CASTLING;
- }
-
- if (move.piece == WHITE_KING) {
- if (castlingRights & WHITE_KINGSIDE) {
- zobristHash ^= getCastleZobristConstant(ZOBRIST_WHITE_KINGSIDE_INDEX);
- castlingRights &= ~WHITE_KINGSIDE;
- }
- if (castlingRights & WHITE_QUEENSIDE) {
- zobristHash ^= getCastleZobristConstant(ZOBRIST_WHITE_QUEENSIDE_INDEX);
- castlingRights &= ~WHITE_QUEENSIDE;
- }
- } else {
- if (castlingRights & BLACK_KINGSIDE) {
- zobristHash ^= getCastleZobristConstant(ZOBRIST_BLACK_KINGSIDE_INDEX);
- castlingRights &= ~BLACK_KINGSIDE;
- }
-
- if (castlingRights & BLACK_QUEENSIDE) {
- zobristHash ^= getCastleZobristConstant(ZOBRIST_BLACK_QUEENSIDE_INDEX);
- castlingRights &= ~BLACK_QUEENSIDE;
- }
- }
- }
-
- if (move.piece == WHITE_ROOK) {
- if (move.from == A1 && (castlingRights & WHITE_QUEENSIDE)) {
- zobristHash ^= getCastleZobristConstant(ZOBRIST_WHITE_QUEENSIDE_INDEX);
- castlingRights &= ~WHITE_QUEENSIDE;
- } else if (move.from == H1 && (castlingRights & WHITE_KINGSIDE)) {
- zobristHash ^= getCastleZobristConstant(ZOBRIST_WHITE_KINGSIDE_INDEX);
- castlingRights &= ~WHITE_KINGSIDE;
- }
- } else if (move.piece == BLACK_ROOK) {
- if (move.from == A8 && (castlingRights & BLACK_QUEENSIDE)) {
- zobristHash ^= getCastleZobristConstant(ZOBRIST_BLACK_QUEENSIDE_INDEX);
- castlingRights &= ~BLACK_QUEENSIDE;
- } else if (move.from == H8 && (castlingRights & BLACK_KINGSIDE)) {
- zobristHash ^= getCastleZobristConstant(ZOBRIST_BLACK_KINGSIDE_INDEX);
- castlingRights &= ~BLACK_KINGSIDE;
- }
- }
-
- if (move.promotionPiece != EMPTY) {
- setPiece(move.to, move.promotionPiece);
- } else {
- setPiece(move.to, move.piece);
- }
-
- if (movingColor == BLACK) {
- fullmoveClock += 1;
- }
-
- movingColor = getOppositeColor(movingColor);
- zobristHash ^= getMovingColorZobristConstant();
- ply += 1;
- moveHistory[ply] = getZobristHash();
- previousMove = move;
-}
-
-int Bitboard::getHalfMoveClock() {
- return halfMoveClock;
-}
+// Lookup tables for attack patterns
+static std::array, COLORS> pawnAttacksTable{};
+static std::array knightAttacksTable{};
+static std::array kingAttacksTable{};
-void Bitboard::unmakeMove(Move& move) {
- moveHistory[ply] = 0;
- UndoData undoData = undoStack[ply - 1];
+static std::array, SQUARES> betweenLookupTable{};
- if (move.promotionPiece != EMPTY) {
- removePiece(move.to, move.promotionPiece);
- } else {
- removePiece(move.to, move.piece);
- }
-
- if (undoData.capturedPiece != EMPTY) {
- setPiece(move.to, undoData.capturedPiece);
- }
-
- setPiece(move.from, move.piece);
-
- if (undoData.moveType == EN_PASSANT) {
- int8_t enPassantCaptureSquare = move.to - (getOppositeColor(movingColor) == WHITE ? 8 : -8);
- setPiece(enPassantCaptureSquare,
- getOppositeColor(movingColor) == WHITE ? BLACK_PAWN : WHITE_PAWN);
- }
-
- if (undoData.moveType == CASTLING) {
- if (move.to == G1) {
- removePiece(F1, WHITE_ROOK);
- setPiece(H1, WHITE_ROOK);
- } else if (move.to == C1) {
- removePiece(D1, WHITE_ROOK);
- setPiece(A1, WHITE_ROOK);
- } else if (move.to == G8) {
- removePiece(F8, BLACK_ROOK);
- setPiece(H8, BLACK_ROOK);
- } else if (move.to == C8) {
- removePiece(D8, BLACK_ROOK);
- setPiece(A8, BLACK_ROOK);
- }
- }
-
- ply -= 1;
- halfMoveClock = undoData.halfMoveClock;
- enPassantSquare = undoData.enPassantSquare;
- castlingRights = undoData.castlingRights;
- movingColor = getOppositeColor(movingColor);
- zobristHash = undoData.zobristHash;
- previousMove = undoData.previousMove;
-
- if (movingColor == BLACK) {
- fullmoveClock -= 1;
- }
-}
-
-void Bitboard::makeNullMove() {
- undoStack[ply].capturedPiece = EMPTY;
- undoStack[ply].halfMoveClock = halfMoveClock;
- undoStack[ply].enPassantSquare = enPassantSquare;
- undoStack[ply].castlingRights = castlingRights;
- undoStack[ply].moveType = REGULAR;
- undoStack[ply].zobristHash = zobristHash;
- undoStack[ply].previousMove = previousMove;
-
- if (enPassantSquare != NO_SQUARE) {
- zobristHash ^= getEnPassantZobristConstant(enPassantSquare % 8);
- enPassantSquare = NO_SQUARE;
- }
-
- movingColor = getOppositeColor(movingColor);
- zobristHash ^= getMovingColorZobristConstant();
- previousMove = {NO_SQUARE, NO_SQUARE, EMPTY, 0, EMPTY, 0};
- ply += 1;
-}
-
-void Bitboard::unmakeNullMove() {
- ply -= 1;
- UndoData undoData = undoStack[ply];
-
- enPassantSquare = undoData.enPassantSquare;
- castlingRights = undoData.castlingRights;
- movingColor = getOppositeColor(movingColor);
- zobristHash = undoData.zobristHash;
- previousMove = undoData.previousMove;
-}
-
-const Move& Bitboard::getPreviousMove() const { return previousMove; }
-
-bool Bitboard::hasMinorOrMajorPieces() {
- return hasMinorOrMajorPieces() || hasMinorOrMajorPieces();
-}
-
-int Bitboard::getAmountOfMinorOrMajorPieces() {
- return getAmountOfMinorOrMajorPieces() + getAmountOfMinorOrMajorPieces();
-}
-
-void Bitboard::print() {
- std::cout << " ---------------------------------";
-
- for (int index = 0; index < 64; index++) {
- if (index % 8 == 0) {
- std::cout << std::endl << index / 8 + 1 << " | ";
- }
-
- std::cout << getCharacterForPieceType(pieceSquareMapping[index]) << " | ";
- }
-
- std::cout << std::endl << " ---------------------------------" << std::endl;
- std::cout << " a b c d e f g h " << std::endl;
-}
-
-void Bitboard::printAvailableMoves(MoveList* moves) {
- std::cout << " ---------------------------------";
-
- for (int index = 0; index < 64; index++) {
- if (index % 8 == 0) {
- std::cout << std::endl << index / 8 + 1 << " | ";
- }
-
- bool didPrint = false;
-
- for (int i = 0; i < moves->size; i++) {
- Move move = moves->moves[i];
-
- if (move.to == index) {
- std::cout << 'X' << " | ";
- didPrint = true;
- break;
- }
- }
-
- if (!didPrint) {
- std::cout << getCharacterForPieceType(pieceSquareMapping[index]) << " | ";
- }
- }
-
- std::cout << std::endl << " ---------------------------------" << std::endl;
- std::cout << " a b c d e f g h " << std::endl;
-}
-
-bool Bitboard::setFromFen(const std::string& fen) {
- int index = A8;
- int spaces = 0;
-
- for (PieceType& type : pieceSquareMapping) {
- type = EMPTY;
- }
-
- for (uint64_t& bb : pieceBB) {
- bb = 0;
- }
-
- for (uint64_t& bb : colorBB) {
- bb = 0;
- }
-
- for (uint64_t& hash : moveHistory) {
- hash = 0;
- }
-
- for (UndoData& undo : undoStack) {
- undo = {};
- }
-
- for (int& count : materialCount) {
- count = 0;
- }
-
- occupiedBB = 0;
- movingColor = NONE;
- ply = 0;
- halfMoveClock = 0;
- fullmoveClock = 1;
- enPassantSquare = NO_SQUARE;
- castlingRights = 0;
- zobristHash = 0;
- pstValues[0] = 0;
- pstValues[1] = 0;
- pstValues[2] = 0;
- pstValues[3] = 0;
-
- for (char character : fen) {
- if (character == ' ') {
- spaces++;
- continue;
- }
-
- if (character == ',') {
- break;
- }
-
- if (spaces == 0) {
- if (character == '/') {
- index -= 16;
- continue;
- }
-
- if (character >= '1' && character <= '8') {
- index += character - '0';
- continue;
- }
-
- if (character >= 'A' && character <= 'z') {
- setPieceFromFENChar(character, index);
- index++;
- } else {
- senjo::Output(senjo::Output::InfoPrefix) << "Invalid piece character!";
- return false;
- }
- }
-
- if (spaces == 1) {
- if (tolower(character) == 'w') {
- movingColor = WHITE;
- } else if (tolower(character) == 'b') {
- movingColor = BLACK;
- zobristHash ^= getMovingColorZobristConstant();
- } else {
- senjo::Output(senjo::Output::InfoPrefix) << "Invalid color to move!";
- return false;
- }
- }
-
- if (spaces == 2) {
- if (character == '-') {
- continue;
- } else if (character == 'K') {
- castlingRights |= WHITE_KINGSIDE;
- zobristHash ^= getCastleZobristConstant(ZOBRIST_WHITE_KINGSIDE_INDEX);
- continue;
- } else if (character == 'Q') {
- castlingRights |= WHITE_QUEENSIDE;
- zobristHash ^= getCastleZobristConstant(ZOBRIST_WHITE_QUEENSIDE_INDEX);
- continue;
- } else if (character == 'k') {
- castlingRights |= BLACK_KINGSIDE;
- zobristHash ^= getCastleZobristConstant(ZOBRIST_BLACK_KINGSIDE_INDEX);
- continue;
- } else if (character == 'q') {
- castlingRights |= BLACK_QUEENSIDE;
- zobristHash ^= getCastleZobristConstant(ZOBRIST_BLACK_QUEENSIDE_INDEX);
- continue;
- }
-
- senjo::Output(senjo::Output::InfoPrefix) << "Invalid castling rights!";
- return false;
- }
-
- if (spaces == 3) {
- if (character == '-') {
- continue;
- }
-
- if (tolower(character) < 'a' || tolower(character) > 'h') {
- continue;
- }
-
- int8_t file = tolower(character) - 'a';
- // NOLINT(cppcoreguidelines-narrowing-conversions)
- int8_t rank = getOppositeColor(movingColor) == WHITE ? 2 : 5;
-
- if (file < 0 || file > 7) {
- senjo::Output(senjo::Output::InfoPrefix) << "Invalid en passant file!";
- return false;
- }
-
- enPassantSquare = rank * 8 + file;
- zobristHash ^= getEnPassantZobristConstant(enPassantSquare % 8);
-
- index += 2;
- }
-
- if (spaces == 4) {
- halfMoveClock = character - '0';
- }
-
- if (spaces == 5) {
- fullmoveClock = character - '0';
- }
- }
-
- moveHistory[ply] = getZobristHash();
- return true;
-}
-
-bool Bitboard::setFromFenTuner(const std::string& fen) {
- int index = A8;
- int spaces = 0;
-
- for (PieceType& type : pieceSquareMapping) {
- type = EMPTY;
- }
-
- for (uint64_t& bb : pieceBB) {
- bb = 0;
- }
-
- for (uint64_t& bb : colorBB) {
- bb = 0;
- }
-
- for (uint64_t& hash : moveHistory) {
- hash = 0;
- }
-
- for (UndoData& undo : undoStack) {
- undo = {};
- }
-
- for (int& count : materialCount) {
- count = 0;
- }
-
- occupiedBB = 0;
- movingColor = NONE;
- ply = 0;
- halfMoveClock = 0;
- fullmoveClock = 1;
- enPassantSquare = NO_SQUARE;
- castlingRights = 0;
- zobristHash = 0;
- pstValues[0] = 0;
- pstValues[1] = 0;
- pstValues[2] = 0;
- pstValues[3] = 0;
-
- for (char character : fen) {
- if (character == ' ') {
- spaces++;
- continue;
- }
-
- if (character == ',') {
- break;
- }
-
- if (spaces == 0) {
- if (character == '/') {
- index -= 16;
- continue;
- }
-
- if (character >= '1' && character <= '8') {
- index += character - '0';
- continue;
- }
-
- if (character >= 'A' && character <= 'z') {
- setPieceFromFENChar(character, index);
- index++;
- } else {
- senjo::Output(senjo::Output::InfoPrefix) << "Invalid piece character!";
- return false;
- }
- }
-
- if (spaces == 1) {
- if (tolower(character) == 'w') {
- movingColor = WHITE;
- } else if (tolower(character) == 'b') {
- movingColor = BLACK;
- } else {
- senjo::Output(senjo::Output::InfoPrefix) << "Invalid color to move!";
- return false;
- }
- }
-
- if (spaces == 2) {
- if (character == '-') {
- continue;
- } else if (character == 'K') {
- castlingRights |= WHITE_KINGSIDE;
- continue;
- } else if (character == 'Q') {
- castlingRights |= WHITE_QUEENSIDE;
- continue;
- } else if (character == 'k') {
- castlingRights |= BLACK_KINGSIDE;
- continue;
- } else if (character == 'q') {
- castlingRights |= BLACK_QUEENSIDE;
- continue;
- }
-
- senjo::Output(senjo::Output::InfoPrefix) << "Invalid castling rights!";
- return false;
- }
-
- if (spaces == 3) {
- if (character == '-') {
- continue;
- }
-
- if (tolower(character) < 'a' || tolower(character) > 'h') {
- continue;
- }
-
- int8_t file = tolower(character) - 'a';
- // NOLINT(cppcoreguidelines-narrowing-conversions)
- int8_t rank = getOppositeColor(movingColor) == WHITE ? 2 : 5;
-
- if (file < 0 || file > 7) {
- senjo::Output(senjo::Output::InfoPrefix) << "Invalid en passant file!";
- return false;
- }
-
- enPassantSquare = rank * 8 + file;
- index += 2;
- }
-
- if (spaces == 4) {
- halfMoveClock = character - '0';
- }
+/**
+ * \brief Initializes the attack lookup tables for pawns, knights, and kings.
+ */
+void initializeAttackLookupTables() {
+ for (uint8_t square = 0; square < SQUARES; ++square) {
+ const uint64_t bb = squareToBitboard(square);
- if (spaces == 5) {
- fullmoveClock = character - '0';
- }
+ pawnAttacksTable[WHITE][square] = calculateWhitePawnAttacks(bb);
+ pawnAttacksTable[BLACK][square] = calculateBlackPawnAttacks(bb);
+ knightAttacksTable[square] = calculateKnightAttacks(bb);
+ kingAttacksTable[square] = calculateKingAttacks(bb);
}
-
- return true;
}
-bool Bitboard::isDraw() {
- if (halfMoveClock >= 100) {
- return true;
- }
-
- if (isInsufficientMaterial()) {
- return true;
- }
-
- // Check if the same position has occurred 3 times using the movehistory array
- int samePositionCount = 0;
- uint64_t boardHash = getZobristHash();
+void initializeBetweenLookupTable() {
+ for (int from = 0; from < 64; from++) {
+ for (int to = 0; to < 64; to++) {
+ uint64_t m1 = -1ULL;
+ uint64_t a2a7 = 0x0001010101010100ULL;
+ uint64_t b2g7 = 0x0040201008040200ULL;
+ uint64_t h1b7 = 0x0002040810204080ULL;
+ uint64_t btwn, line, rank, file;
- for (int i = ply; i >= 0; i--) {
- if (moveHistory[i] == boardHash) {
- samePositionCount++;
- }
+ btwn = m1 << from ^ m1 << to;
+ file = (to & 7) - (from & 7);
+ rank = ((to | 7) - from) >> 3;
+ line = (file & 7) - 1 & a2a7;
+ line += 2 * (((rank & 7) - 1) >> 58);
+ line += (rank - file & 15) - 1 & b2g7;
+ line += (rank + file & 15) - 1 & h1b7;
+ line *= btwn & -btwn;
- if (samePositionCount >= 3) {
- return true;
+ betweenLookupTable[from][to] = line & btwn;
}
}
-
- return false;
}
-uint64_t Bitboard::getZobristHash() const { return zobristHash; }
-
-void Bitboard::setZobristHash(uint64_t zobristHash) { Bitboard::zobristHash = zobristHash; }
-
-bool Bitboard::isInsufficientMaterial() {
- uint64_t kingBB = getPieceBoard(WHITE_KING) | getPieceBoard(BLACK_KING);
- uint64_t piecesBB = getOccupiedBoard();
- uint64_t piecesWithoutKings = piecesBB & ~kingBB;
- uint64_t sufficientPieces = getPieceBoard(WHITE_QUEEN) | getPieceBoard(BLACK_QUEEN) |
- getPieceBoard(WHITE_ROOK) | getPieceBoard(BLACK_ROOK) |
- getPieceBoard(WHITE_PAWN) | getPieceBoard(BLACK_PAWN);
-
- // If there are queens, rooks or pawns on the board, it can't be a draw
- if (sufficientPieces) {
- return false;
- }
-
- int pieceCountWithoutKings = popcnt(piecesWithoutKings);
-
- // If there is only one minor piece on the board, it's a draw. Covers KBvK, KNvK and KvK
- if (pieceCountWithoutKings == 1 || pieceCountWithoutKings == 0) {
- return true;
- }
-
- return false;
-}
-
-void Bitboard::setPieceFromFENChar(char character, int index) {
- // Uppercase = WHITE, lowercase = black
- switch (character) {
- case 'P':
- setPiece(index, WHITE_PAWN);
- break;
- case 'p':
- setPiece(index, BLACK_PAWN);
- break;
- case 'N':
- setPiece(index, WHITE_KNIGHT);
- break;
- case 'n':
- setPiece(index, BLACK_KNIGHT);
- break;
- case 'B':
- setPiece(index, WHITE_BISHOP);
- break;
- case 'b':
- setPiece(index, BLACK_BISHOP);
- break;
- case 'R':
- setPiece(index, WHITE_ROOK);
- break;
- case 'r':
- setPiece(index, BLACK_ROOK);
- break;
- case 'Q':
- setPiece(index, WHITE_QUEEN);
- break;
- case 'q':
- setPiece(index, BLACK_QUEEN);
- break;
- case 'K':
- setPiece(index, WHITE_KING);
- break;
- case 'k':
- setPiece(index, BLACK_KING);
- break;
- }
-}
-
-uint64_t Bitboard::getSquareAttacks(int8_t square) {
- uint64_t queenBB = getPieceBoard(WHITE_QUEEN) | getPieceBoard(BLACK_QUEEN);
- uint64_t straightSlidingPieces = getPieceBoard(WHITE_ROOK) | getPieceBoard(BLACK_ROOK) |
- queenBB;
- uint64_t diagonalSlidingPieces =
- getPieceBoard(WHITE_BISHOP) | getPieceBoard(BLACK_BISHOP) | queenBB;
-
- uint64_t pawnAttacks = getPawnAttacks(square) & getPieceBoard(WHITE_PAWN);
- pawnAttacks |= getPawnAttacks(square) & getPieceBoard(BLACK_PAWN);
- uint64_t rookAttacks = getRookAttacks(square) & straightSlidingPieces;
- uint64_t bishopAttacks = getBishopAttacks(square) & diagonalSlidingPieces;
- uint64_t knightAttacks =
- getKnightAttacks(square) & (getPieceBoard(WHITE_KNIGHT) | getPieceBoard(BLACK_KNIGHT));
- uint64_t kingAttacks =
- getKingAttacks(square) & (getPieceBoard(WHITE_KING) | getPieceBoard(BLACK_KING));
-
- return pawnAttacks | rookAttacks | bishopAttacks | knightAttacks | kingAttacks;
-}
-
-uint8_t Bitboard::getCastlingRights() const { return castlingRights; }
-
-void Bitboard::setCastlingRights(uint8_t castlingRights) {
- Bitboard::castlingRights = castlingRights;
+/**
+ * \brief Retrieves the pawn attacks for a given square and color.
+ * \tparam color The color of the pawn (WHITE or BLACK).
+ * \param square The square index (0-63).
+ * \return A bitboard representing the attack pattern.
+ */
+template
+uint64_t getPawnAttacks(const uint8_t square) {
+ assert(square < SQUARES);
+ return pawnAttacksTable[color][square];
}
-int8_t Bitboard::getEnPassantSquare() const { return enPassantSquare; }
+// Explicit template instantiation for WHITE and BLACK pawns
+template uint64_t getPawnAttacks(uint8_t square);
+template uint64_t getPawnAttacks(uint8_t square);
-void Bitboard::setEnPassantSquare(int8_t enPassantSquare) {
- Bitboard::enPassantSquare = enPassantSquare;
+/**
+ * \brief Retrieves the knight attacks for a given square.
+ * \param square The square index (0-63).
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t getKnightAttacks(const uint8_t square) {
+ assert(square < SQUARES);
+ return knightAttacksTable[square];
}
-uint64_t Bitboard::getFile(int8_t square) {
- return getRayAttack(square, NORTH) | getRayAttack(square, SOUTH) | 1ULL << square;
+/**
+ * \brief Retrieves the king attacks for a given square.
+ * \param square The square index (0-63).
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t getKingAttacks(const uint8_t square) {
+ assert(square < SQUARES);
+ return kingAttacksTable[square];
}
-bool Bitboard::makeStrMove(const std::string& strMove) {
- int8_t fromSquare = getSquareFromString(strMove.substr(0, 2));
- int8_t toSquare = getSquareFromString(strMove.substr(2, 2));
- PieceType promotionPiece = EMPTY;
-
- if (strMove.length() == 5) {
- if (strMove.ends_with("q")) {
- promotionPiece = getMovingColor() == WHITE ? WHITE_QUEEN : BLACK_QUEEN;
- } else if (strMove.ends_with("r")) {
- promotionPiece = getMovingColor() == WHITE ? WHITE_ROOK : BLACK_ROOK;
- } else if (strMove.ends_with("b")) {
- promotionPiece = getMovingColor() == WHITE ? WHITE_BISHOP : BLACK_BISHOP;
- } else if (strMove.ends_with("n")) {
- promotionPiece = getMovingColor() == WHITE ? WHITE_KNIGHT : BLACK_KNIGHT;
- }
- }
-
- PieceType movingPiece = getPieceOnSquare(fromSquare);
- PieceType capturedPiece = getPieceOnSquare(toSquare);
- int captureScore = -1;
-
- if (capturedPiece != EMPTY) {
- captureScore = mvvlva(movingPiece, capturedPiece);
- }
+/**
+ * \brief Retrieves the bishop attacks for a given square and occupied squares.
+ * \param square The square index (0-63).
+ * \param occupied A bitboard representing the occupied squares.
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t getBishopAttacks(const uint8_t square, uint64_t occupied) {
+ assert(square < SQUARES);
+ occupied &= getBishopMask(square);
+ occupied *= getBishopMagic(square);
+ occupied >>= 64 - BBits[square];
- Move move = {fromSquare, toSquare, movingPiece, captureScore, promotionPiece};
- makeMove(move);
- return true;
+ return getBishopMagicAttacks(square, occupied);
}
-Line Bitboard::getPvLine() { return pvLine; }
+/**
+ * \brief Retrieves the rook attacks for a given square and occupied squares.
+ * \param square The square index (0-63).
+ * \param occupied A bitboard representing the occupied squares.
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t getRookAttacks(const uint8_t square, uint64_t occupied) {
+ assert(square < SQUARES);
+ occupied &= getRookMask(square);
+ occupied *= getRookMagic(square);
+ occupied >>= 64 - RBits[square];
-void Bitboard::setPvLine(Line& pvLine) {
- Bitboard::pvLine = pvLine;
+ return getRookMagicAttacks(square, occupied);
}
-uint16_t Bitboard::getPly() const { return ply; }
-
-void Bitboard::setPly(uint16_t ply) { this->ply = ply; }
-
-bool Bitboard::isOpenFile(int8_t square) {
- uint64_t fileMask = getFile(square);
- uint64_t occupied = getPieceBoard(WHITE_PAWN) | getPieceBoard(BLACK_PAWN);
-
- return fileMask == (fileMask & ~occupied);
+/**
+ * \brief Retrieves the queen attacks for a given square and occupied squares.
+ * \param square The square index (0-63).
+ * \param occupied A bitboard representing the occupied squares.
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t queenAttacks(const uint8_t square, const uint64_t occupied) {
+ assert(square < SQUARES);
+ return getBishopAttacks(square, occupied) | getRookAttacks(square, occupied);
}
-int Bitboard::getWhiteMidgamePst() const { return pstValues[0]; }
-
-int Bitboard::getWhiteEndgamePst() const { return pstValues[2]; }
-
-int Bitboard::getBlackMidgamePst() const { return pstValues[1]; }
-
-int Bitboard::getBlackEndgamePst() const { return pstValues[3]; }
-
-uint64_t Bitboard::getPieceBoard(PieceType pieceType) { return pieceBB[pieceType]; }
-
-template
-bool Bitboard::isWinner() {
- if (color == WHITE) {
- if (!isKingInCheck()) {
- return false;
- }
- } else {
- if (!isKingInCheck()) {
- return false;
- }
- }
-
- MoveListPool* moveListPool = MoveListPool::getInstance();
- MoveList* moveList = moveListPool->getMoveList();
- generateMoves(*this, moveList);
-
- for (int i = 0; i < moveList->size; i++) {
- Move move = moveList->moves[i];
-
- makeMove(move);
-
- if (color == WHITE) {
- if (isKingInCheck()) {
- unmakeMove(move);
- continue;
- }
- } else {
- if (isKingInCheck()) {
- unmakeMove(move);
- continue;
- }
- }
-
- unmakeMove(move);
- moveListPool->releaseMoveList(moveList);
- return false;
- }
-
- moveListPool->releaseMoveList(moveList);
- return true;
+/**
+ * \brief Gets a bitboard of all squares between two squares.
+ * \param fromSquare The starting square.
+ * \param toSquare The ending square.
+ *
+ * \return The bitboard of squares between the two squares.
+ */
+uint64_t getSquaresBetween(const Square fromSquare, const Square toSquare) {
+ assert(fromSquare < SQUARES && toSquare < SQUARES);
+ return betweenLookupTable[fromSquare][toSquare];
}
-
-template bool Bitboard::isWinner();
-template bool Bitboard::isWinner();
} // namespace Zagreus
\ No newline at end of file
diff --git a/src/bitboard.h b/src/bitboard.h
index 43bcd2f8..e539f67a 100644
--- a/src/bitboard.h
+++ b/src/bitboard.h
@@ -1,438 +1,466 @@
/*
This file is part of Zagreus.
-
+
Zagreus is a UCI chess engine
- Copyright (C) 2023 Danny Jelsma
-
+ Copyright (C) 2023-2025 Danny Jelsma
+
Zagreus is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published
by the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
-
+
Zagreus is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
-
+
You should have received a copy of the GNU Affero General Public License
along with Zagreus. If not, see .
*/
-#pragma clang diagnostic push
-#pragma clang diagnostic ignored "-Wdeprecated-enum-enum-conversion"
#pragma once
-#include
-
#include
#include
-#include
#include "bitwise.h"
-#include "movelist_pool.h"
+#include "constants.h"
#include "types.h"
-#include "utils.h"
namespace Zagreus {
-class Bitboard {
-private:
- uint64_t pieceBB[12]{};
- PieceType pieceSquareMapping[64]{};
- uint64_t colorBB[2]{};
- uint64_t occupiedBB{0ULL};
-
- PieceColor movingColor = NONE;
- uint16_t ply = 0;
- uint8_t halfMoveClock = 0;
- uint8_t fullmoveClock = 1;
- int8_t enPassantSquare = NO_SQUARE;
- uint8_t castlingRights = 0b00001111;
-
- uint64_t zobristHash = 0ULL;
-
- UndoData undoStack[MAX_PLY]{};
- uint64_t moveHistory[MAX_PLY]{};
- Line pvLine{};
-
- int pstValues[4]{};
-
- Move previousMove{};
- int materialCount[12]{};
-
-public:
- uint64_t getPieceBoard(PieceType pieceType);
-
- template
- uint64_t getColorBoard() {
- return colorBB[color];
- }
-
- template
- uint64_t getPawnDoublePush(uint64_t pawns) {
- const uint64_t singlePush = getPawnSinglePush(pawns);
-
- if (color == WHITE) {
- return singlePush | (nortOne(singlePush) & getEmptyBoard() & RANK_4);
- }
-
- if (color == BLACK) {
- return singlePush | (soutOne(singlePush) & getEmptyBoard() & RANK_5);
- }
-
- return 0;
- }
-
- template
- uint64_t getPawnSinglePush(uint64_t pawns) {
- if (color == WHITE) {
- return nortOne(pawns) & getEmptyBoard();
- }
-
- if (color == BLACK) {
- return soutOne(pawns) & getEmptyBoard();
- }
-
- return 0;
- }
-
- uint64_t getOccupiedBoard() const;
-
- uint64_t getEmptyBoard() const;
-
- PieceType getPieceOnSquare(int8_t square);
-
- uint64_t getQueenAttacks(int8_t square);
-
- uint64_t getQueenAttacks(int8_t square, uint64_t occupancy);
-
- uint64_t getBishopAttacks(int8_t square);
-
- static uint64_t getBishopAttacks(int8_t square, uint64_t occupancy);
-
- uint64_t getRookAttacks(int8_t square);
-
- static uint64_t getRookAttacks(int8_t square, uint64_t occupancy);
-
- void setPiece(int8_t square, PieceType piece);
-
- void removePiece(int8_t square, PieceType piece);
-
- template
- int getMaterialCount() {
- return materialCount[piece];
- }
-
- void makeMove(Move& move);
- int getHalfMoveClock();
-
- void unmakeMove(Move& move);
- void print();
-
- void printAvailableMoves(MoveList* moves);
-
- bool setFromFen(const std::string& fen);
-
- bool setFromFenTuner(const std::string& fen);
-
- bool isDraw();
-
- template
- bool isWinner();
-
- void setPieceFromFENChar(char character, int index);
-
- PieceColor getMovingColor() const;
-
- void setMovingColor(PieceColor movingColor);
-
- uint64_t getSquareAttacks(int8_t square);
-
- template
- uint64_t getSquareAttackersByColor(int8_t square) {
- if (color == WHITE) {
- uint64_t queenBB = getPieceBoard(WHITE_QUEEN);
- uint64_t rookBB = getPieceBoard(WHITE_ROOK);
- uint64_t bishopBB = getPieceBoard(WHITE_BISHOP);
-
- uint64_t pawnAttacks = getPawnAttacks(square) & getPieceBoard(WHITE_PAWN);
- uint64_t bishopAttacks = getBishopAttacks(square) & bishopBB;
- uint64_t knightAttacks = getKnightAttacks(square) & getPieceBoard(WHITE_KNIGHT);
- uint64_t kingAttacks = getKingAttacks(square) & getPieceBoard(WHITE_KING);
- uint64_t rookAttacks = getRookAttacks(square) & rookBB;
- uint64_t queenAttacks = getQueenAttacks(square) & queenBB;
-
- return pawnAttacks | bishopAttacks | knightAttacks | rookAttacks | queenAttacks |
- kingAttacks;
- } else {
- uint64_t queenBB = getPieceBoard(BLACK_QUEEN);
- uint64_t rookBB = getPieceBoard(BLACK_ROOK);
- uint64_t bishopBB = getPieceBoard(BLACK_BISHOP);
-
- uint64_t pawnAttacks = getPawnAttacks(square) & getPieceBoard(BLACK_PAWN);
- uint64_t bishopAttacks = getBishopAttacks(square) & bishopBB;
- uint64_t knightAttacks = getKnightAttacks(square) & getPieceBoard(BLACK_KNIGHT);
- uint64_t rookAttacks = getRookAttacks(square) & rookBB;
- uint64_t queenAttacks = getQueenAttacks(square) & queenBB;
- uint64_t kingAttacks = getKingAttacks(square) & getPieceBoard(BLACK_KING);
-
- return pawnAttacks | bishopAttacks | knightAttacks | rookAttacks | queenAttacks |
- kingAttacks;
- }
- }
-
- template
- bool isSquareAttackedByColor(int8_t square) {
- return getSquareAttackersByColor(square) != 0;
- }
-
- template
- bool isKingInCheck() {
- constexpr PieceColor OPPOSITE_COLOR = color == WHITE ? BLACK : WHITE;
- uint64_t kingBB = getPieceBoard(color == WHITE ? WHITE_KING : BLACK_KING);
- int8_t kingLocation = bitscanForward(kingBB);
-
- return isSquareAttackedByColor(kingLocation);
- }
-
- int8_t getEnPassantSquare() const;
-
- void setEnPassantSquare(int8_t enPassantSquare);
-
- uint8_t getCastlingRights() const;
-
- void setCastlingRights(uint8_t castlingRights);
-
- bool isInsufficientMaterial();
-
- uint64_t getZobristHash() const;
-
- void setZobristHash(uint64_t zobristHash);
-
- bool makeStrMove(const std::string& strMove);
-
- Line getPvLine();
-
- void setPvLine(Line& pvLine);
-
- uint16_t getPly() const;
-
- void setPly(uint16_t ply);
-
- bool isOpenFile(int8_t square);
-
- template
- bool isSemiOpenFile(int8_t square) {
- uint64_t fileMask = getFile(square);
- if (color == WHITE) {
- uint64_t ownOccupied = getPieceBoard(WHITE_PAWN);
- uint64_t opponentOccupied = getPieceBoard(BLACK_PAWN);
-
- return fileMask == (fileMask & ~ownOccupied) && fileMask != (
- fileMask & ~opponentOccupied);
- } else {
- uint64_t ownOccupied = getPieceBoard(BLACK_PAWN);
- uint64_t opponentOccupied = getPieceBoard(WHITE_PAWN);
-
- return fileMask == (fileMask & ~ownOccupied) && fileMask != (
- fileMask & ~opponentOccupied);
- }
- }
-
- // Also returns true when it is an open file
- template
- bool isSemiOpenFileLenient(int8_t square) {
- uint64_t fileMask = getFile(square);
-
- if (color == WHITE) {
- uint64_t ownOccupied = getPieceBoard(WHITE_PAWN);
- return fileMask == (fileMask & ~ownOccupied);
- } else {
- uint64_t ownOccupied = getPieceBoard(BLACK_PAWN);
- return fileMask == (fileMask & ~ownOccupied);
- }
- }
-
- template
- int seeCapture(int8_t fromSquare, int8_t toSquare) {
- constexpr PieceColor OPPOSITE_COLOR = attackingColor == WHITE ? BLACK : WHITE;
- PieceType movingPiece = pieceSquareMapping[fromSquare];
- PieceType capturedPieceType = pieceSquareMapping[toSquare];
- int captureScore = mvvlva(movingPiece, capturedPieceType);
- Move move{fromSquare, toSquare, movingPiece, captureScore};
-
- makeMove(move);
- int score = getPieceWeight(capturedPieceType) - see(toSquare);
- unmakeMove(move);
-
- return score;
- }
-
- template
- int8_t getSmallestAttackerSquare(int8_t square) {
- uint64_t attacks = getSquareAttackersByColor(square);
- int8_t smallestAttackerSquare = NO_SQUARE;
- int smallestAttackerWeight = 999999999;
-
- while (attacks) {
- int attackerSquare = popLsb(attacks);
- PieceType pieceType = pieceSquareMapping[attackerSquare];
- int weight = getPieceWeight(pieceType);
-
- if (weight < smallestAttackerWeight) {
- smallestAttackerWeight = weight;
- smallestAttackerSquare = attackerSquare;
- }
- }
-
- return smallestAttackerSquare;
- }
-
- template
- int see(int8_t square) {
- constexpr PieceColor OPPOSITE_COLOR = attackingColor == WHITE ? BLACK : WHITE;
- int score = 0;
- int8_t smallestAttackerSquare = getSmallestAttackerSquare(square);
-
- if (smallestAttackerSquare != NO_SQUARE) {
- PieceType movingPiece = pieceSquareMapping[smallestAttackerSquare];
- PieceType capturedPieceType = pieceSquareMapping[square];
- int captureScore = mvvlva(movingPiece, capturedPieceType);
- Move move{smallestAttackerSquare, square, movingPiece, captureScore};
- makeMove(move);
- score = std::max(0, getPieceWeight(capturedPieceType) - see(square));
- unmakeMove(move);
- }
-
- return score;
- }
-
- // See, but after a move has already been made. We just check if the opponent can win material.
- // This method is basically seeCapture where the move has already been made. It is used to analyze a move already made to see if it appears to be safe.
- template
- int seeOpponent(int8_t square) {
- // moved color is the color that just moved
- constexpr PieceColor OPPOSITE_COLOR = movedColor == WHITE ? BLACK : WHITE;
- int score = NO_CAPTURE_SCORE;
- int8_t smallestAttackerSquare = getSmallestAttackerSquare(square);
-
- if (smallestAttackerSquare != NO_SQUARE) {
- PieceType movingPiece = pieceSquareMapping[smallestAttackerSquare];
- PieceType capturedPieceType = pieceSquareMapping[square];
- int captureScore = mvvlva(movingPiece, capturedPieceType);
- Move move{smallestAttackerSquare, square, movingPiece, captureScore};
- makeMove(move);
- score = getPieceWeight(capturedPieceType) - see(square);
- unmakeMove(move);
- }
-
- return score;
- }
-
- [[nodiscard]] const Move& getPreviousMove() const;
+/**
+ * \brief Initializes the attack lookup tables for pawns, knights, and kings.
+ */
+void initializeAttackLookupTables();
- uint64_t getFile(int8_t square);
+/**
+ * \brief Initializes the between lookup table.
+ */
+void initializeBetweenLookupTable();
- template
- uint64_t getPawnsOnSameFile(int8_t square) {
- return pieceBB[WHITE_PAWN + color] & getFile(square);
+/**
+ * \brief Shifts the bitboard north by one rank.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftNorth(const uint64_t bb) {
+ return bb << 8;
+}
+
+/**
+ * \brief Shifts the bitboard south by one rank.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftSouth(const uint64_t bb) {
+ return bb >> 8;
+}
+
+/**
+ * \brief Shifts the bitboard east by one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftEast(const uint64_t bb) {
+ return (bb << 1) & NOT_A_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard west by one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftWest(const uint64_t bb) {
+ return (bb >> 1) & NOT_H_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard north-east by one rank and one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftNorthEast(const uint64_t bb) {
+ return (bb << 9) & NOT_A_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard north-west by one rank and one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftNorthWest(const uint64_t bb) {
+ return (bb << 7) & NOT_H_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard south-east by one rank and one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftSouthEast(const uint64_t bb) {
+ return (bb >> 7) & NOT_A_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard south-west by one rank and one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftSouthWest(const uint64_t bb) {
+ return (bb >> 9) & NOT_H_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard north-north-east by two ranks and one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftNorthNorthEast(const uint64_t bb) {
+ return (bb << 17) & NOT_A_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard north-east-east by one rank and two files.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftNorthEastEast(const uint64_t bb) {
+ return (bb << 10) & NOT_AB_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard south-east-east by one rank and two files.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftSouthEastEast(const uint64_t bb) {
+ return (bb >> 6) & NOT_AB_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard south-south-east by two ranks and one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftSouthSouthEast(const uint64_t bb) {
+ return (bb >> 15) & NOT_A_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard north-north-west by two ranks and one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftNorthNorthWest(const uint64_t bb) {
+ return (bb << 15) & NOT_H_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard north-west-west by one rank and two files.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftNorthWestWest(const uint64_t bb) {
+ return (bb << 6) & NOT_GH_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard south-west-west by one rank and two files.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftSouthWestWest(const uint64_t bb) {
+ return (bb >> 10) & NOT_GH_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard south-south-west by two ranks and one file.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+inline uint64_t shiftSouthSouthWest(const uint64_t bb) {
+ return (bb >> 17) & NOT_H_FILE;
+}
+
+/**
+ * \brief Shifts the bitboard in the specified direction.
+ * \tparam direction The direction to shift.
+ * \param bb The bitboard to shift.
+ * \return The shifted bitboard.
+ */
+template
+constexpr uint64_t shift(const uint64_t bb) {
+ switch (direction) {
+ case NORTH:
+ return shiftNorth(bb);
+ case SOUTH:
+ return shiftSouth(bb);
+ case EAST:
+ return shiftEast(bb);
+ case WEST:
+ return shiftWest(bb);
+ case NORTH_EAST:
+ return shiftNorthEast(bb);
+ case NORTH_WEST:
+ return shiftNorthWest(bb);
+ case SOUTH_EAST:
+ return shiftSouthEast(bb);
+ case SOUTH_WEST:
+ return shiftSouthWest(bb);
+ case NORTH_NORTH_EAST:
+ return shiftNorthNorthEast(bb);
+ case NORTH_EAST_EAST:
+ return shiftNorthEastEast(bb);
+ case SOUTH_EAST_EAST:
+ return shiftSouthEastEast(bb);
+ case SOUTH_SOUTH_EAST:
+ return shiftSouthSouthEast(bb);
+ case SOUTH_SOUTH_WEST:
+ return shiftSouthSouthWest(bb);
+ case SOUTH_WEST_WEST:
+ return shiftSouthWestWest(bb);
+ default:
+ assert(false);
+ return bb;
}
+}
- template
- bool isIsolatedPawn(int8_t square) {
- uint64_t neighborMask = 0;
-
- if (square % 8 != 0) {
- neighborMask |= getFile(square - 1);
- }
-
- if (square % 8 != 7) {
- neighborMask |= getFile(square + 1);
- }
+/**
+ * \brief Calculates the single push for white pawns.
+ * \param bb The bitboard representing the pawns.
+ * \param empty The bitboard representing the empty squares.
+ * \return The bitboard representing the single push.
+ */
+inline uint64_t whitePawnSinglePush(const uint64_t bb, const uint64_t empty) {
+ return shiftNorth(bb) & empty;
+}
+
+/**
+ * \brief Calculates the double push for white pawns.
+ * \param bb The bitboard representing the pawns.
+ * \param empty The bitboard representing the empty squares.
+ * \return The bitboard representing the double push.
+ */
+inline uint64_t whitePawnDoublePush(const uint64_t bb, const uint64_t empty) {
+ const uint64_t singlePush = whitePawnSinglePush(bb, empty);
+ return shiftNorth(singlePush) & empty & RANK_4;
+}
+
+/**
+ * \brief Calculates the west attacks for white pawns.
+ * \param bb The bitboard representing the pawns.
+ * \return The bitboard representing the west attacks.
+ */
+inline uint64_t whitePawnWestAttacks(const uint64_t bb) {
+ return shiftNorthWest(bb);
+}
+
+/**
+ * \brief Calculates the east attacks for white pawns.
+ * \param bb The bitboard representing the pawns.
+ * \return The bitboard representing the east attacks.
+ */
+inline uint64_t whitePawnEastAttacks(const uint64_t bb) {
+ return shiftNorthEast(bb);
+}
+
+/**
+ * \brief Calculates the attacks for white pawns.
+ * \param bb The bitboard representing the pawns.
+ * \return The bitboard representing the attacks.
+ */
+inline uint64_t calculateWhitePawnAttacks(const uint64_t bb) {
+ return whitePawnWestAttacks(bb) | whitePawnEastAttacks(bb);
+}
+
+/**
+ * \brief Calculates the pushable pawns for white.
+ * \param bb The bitboard representing the pawns.
+ * \param empty The bitboard representing the empty squares.
+ * \return The bitboard representing the pushable pawns.
+ */
+inline uint64_t whitePushablePawns(const uint64_t bb, const uint64_t empty) {
+ return shiftSouth(empty) & bb;
+}
+
+/**
+ * \brief Calculates the double pushable pawns for white.
+ * \param bb The bitboard representing the pawns.
+ * \param empty The bitboard representing the empty squares.
+ * \return The bitboard representing the double pushable pawns.
+ */
+inline uint64_t whiteDoublePushablePawns(const uint64_t bb, const uint64_t empty) {
+ const uint64_t emptyRank3 = shiftSouth(empty & RANK_4) & empty;
+ return whitePushablePawns(bb, emptyRank3);
+}
+
+/**
+ * \brief Calculates the single push for black pawns.
+ * \param bb The bitboard representing the pawns.
+ * \param empty The bitboard representing the empty squares.
+ * \return The bitboard representing the single push.
+ */
+inline uint64_t blackPawnSinglePush(const uint64_t bb, const uint64_t empty) {
+ return shiftSouth(bb) & empty;
+}
+
+/**
+ * \brief Calculates the double push for black pawns.
+ * \param bb The bitboard representing the pawns.
+ * \param empty The bitboard representing the empty squares.
+ * \return The bitboard representing the double push.
+ */
+inline uint64_t blackPawnDoublePush(const uint64_t bb, const uint64_t empty) {
+ const uint64_t singlePush = blackPawnSinglePush(bb, empty);
+ return shiftSouth(singlePush) & empty & RANK_5;
+}
+
+/**
+ * \brief Calculates the west attacks for black pawns.
+ * \param bb The bitboard representing the pawns.
+ * \return The bitboard representing the west attacks.
+ */
+inline uint64_t blackPawnWestAttacks(const uint64_t bb) {
+ return shiftSouthWest(bb);
+}
+
+/**
+ * \brief Calculates the east attacks for black pawns.
+ * \param bb The bitboard representing the pawns.
+ * \return The bitboard representing the east attacks.
+ */
+inline uint64_t blackPawnEastAttacks(const uint64_t bb) {
+ return shiftSouthEast(bb);
+}
+
+/**
+ * \brief Calculates the attacks for black pawns.
+ * \param bb The bitboard representing the pawns.
+ * \return The bitboard representing the attacks.
+ */
+inline uint64_t calculateBlackPawnAttacks(const uint64_t bb) {
+ return blackPawnWestAttacks(bb) | blackPawnEastAttacks(bb);
+}
+
+/**
+ * \brief Calculates the pushable pawns for black.
+ * \param bb The bitboard representing the pawns.
+ * \param empty The bitboard representing the empty squares.
+ * \return The bitboard representing the pushable pawns.
+ */
+inline uint64_t blackPushablePawns(const uint64_t bb, const uint64_t empty) {
+ return shiftNorth(empty) & bb;
+}
+
+/**
+ * \brief Calculates the double pushable pawns for black.
+ * \param bb The bitboard representing the pawns.
+ * \param empty The bitboard representing the empty squares.
+ * \return The bitboard representing the double pushable pawns.
+ */
+inline uint64_t blackDoublePushablePawns(const uint64_t bb, const uint64_t empty) {
+ const uint64_t emptyRank6 = shiftNorth(empty & RANK_5) & empty;
+ return blackPushablePawns(bb, emptyRank6);
+}
+
+/**
+ * \brief Calculates the attacks for knights.
+ * \param bb The bitboard representing the knights.
+ * \return The bitboard representing the attacks.
+ */
+inline uint64_t calculateKnightAttacks(const uint64_t bb) {
+ return shiftNorthNorthEast(bb) | shiftNorthEastEast(bb) | shiftSouthEastEast(bb) |
+ shiftSouthSouthEast(bb) | shiftSouthSouthWest(bb) | shiftSouthWestWest(bb) |
+ shiftNorthWestWest(bb) | shiftNorthNorthWest(bb);
+}
+
+/**
+ * \brief Retrieves the pawn attacks for a given square and color.
+ * \tparam color The color of the pawn (WHITE or BLACK).
+ * \param square The square index (0-63).
+ * \return A bitboard representing the attack pattern.
+ */
+template
+uint64_t getPawnAttacks(uint8_t square);
- if (color == WHITE) {
- return !(neighborMask & getPieceBoard(WHITE_PAWN));
- } else {
- return !(neighborMask & getPieceBoard(BLACK_PAWN));
- }
- }
+/**
+ * \brief Retrieves the knight attacks for a given square.
+ * \param square The square index (0-63).
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t getKnightAttacks(uint8_t square);
- template
- bool isPassedPawn(int8_t square) {
- Direction direction = color == WHITE ? NORTH : SOUTH;
- uint64_t neighborMask = getRayAttack(square, direction);
- uint64_t pawnBB = getPieceBoard(color == WHITE ? WHITE_PAWN : BLACK_PAWN);
-
- if (neighborMask & pawnBB) {
- return false;
- }
-
- if (square % 8 != 0) {
- // neighboring file
- neighborMask |= getRayAttack(square - 1, direction);
- }
-
- if (square % 8 != 7) {
- neighborMask |= getRayAttack(square + 1, direction);
- }
-
- if (color == WHITE) {
- return !(neighborMask & getPieceBoard(BLACK_PAWN));
- } else {
- return !(neighborMask & getPieceBoard(WHITE_PAWN));
- }
- }
+/**
+ * \brief Retrieves the king attacks for a given square.
+ * \param square The square index (0-63).
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t getKingAttacks(uint8_t square);
- bool hasMinorOrMajorPieces();
-
- template
- bool hasMinorOrMajorPieces() {
- if (color == WHITE) {
- return getColorBoard() & ~(
- getPieceBoard(WHITE_PAWN) | getPieceBoard(WHITE_KING));
- } else {
- return getColorBoard() & ~(
- getPieceBoard(BLACK_PAWN) | getPieceBoard(BLACK_KING));
- }
- }
+/**
+ * \brief Retrieves the bishop attacks for a given square and occupied squares.
+ * \param square The square index (0-63).
+ * \param occupied A bitboard representing the occupied squares.
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t getBishopAttacks(uint8_t square, uint64_t occupied);
- template
- int getAmountOfMinorOrMajorPieces() {
- if (color == WHITE) {
- return popcnt(getColorBoard() &
- ~(getPieceBoard(WHITE_PAWN) | getPieceBoard(WHITE_KING)));
- } else {
- return popcnt(getColorBoard() &
- ~(getPieceBoard(BLACK_PAWN) | getPieceBoard(BLACK_KING)));
- }
- }
+/**
+ * \brief Retrieves the rook attacks for a given square and occupied squares.
+ * \param square The square index (0-63).
+ * \param occupied A bitboard representing the occupied squares.
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t getRookAttacks(uint8_t square, uint64_t occupied);
- template
- int getAmountOfPawns() {
- return popcnt(getColorBoard() & getPieceBoard(color == WHITE
- ? WHITE_PAWN
- : BLACK_PAWN));
- }
+/**
+ * \brief Retrieves the queen attacks for a given square and occupied squares.
+ * \param square The square index (0-63).
+ * \param occupied A bitboard representing the occupied squares.
+ * \return A bitboard representing the attack pattern.
+ */
+uint64_t queenAttacks(uint8_t square, uint64_t occupied);
- template
- int getAmountOfPieces() {
- return popcnt(getColorBoard());
+/**
+ * \brief Calculates the attacks for kings.
+ * \param bb The bitboard representing the kings.
+ * \return The bitboard representing the attacks.
+ */
+inline uint64_t calculateKingAttacks(uint64_t bb) {
+ const uint64_t attacks = shiftEast(bb) | shiftWest(bb);
+ bb |= attacks;
+ return attacks | shiftNorth(bb) | shiftSouth(bb);
+}
+
+/**
+ * \brief Converts a square index to a bitboard.
+ * \param square The square index (0-63).
+ * \return The bitboard representing the square.
+ */
+inline uint64_t squareToBitboard(const uint8_t square) {
+ return 1ULL << square;
+}
+
+/**
+ * \brief Converts a bitboard to a square index.
+ * \param bb The bitboard to convert.
+ * \return The square index.
+ */
+inline Square bitboardToSquare(const uint64_t bb) {
+ if (bb == 0) {
+ return A1;
}
- void makeNullMove();
-
- void unmakeNullMove();
-
- [[nodiscard]] int getWhiteMidgamePst() const;
-
- [[nodiscard]] int getWhiteEndgamePst() const;
+ return static_cast(bitscanForward(bb));
+}
- [[nodiscard]] int getBlackMidgamePst() const;
-
- [[nodiscard]] int getBlackEndgamePst() const;
-
- int getAmountOfMinorOrMajorPieces();
-};
+/**
+ * \brief Gets a bitboard of all squares between two squares.
+ * \param fromSquare The starting square.
+ * \param toSquare The ending square.
+ *
+ * \return The bitboard of squares between the two squares.
+ */
+uint64_t getSquaresBetween(Square fromSquare, Square toSquare);
} // namespace Zagreus
-
-#pragma clang diagnostic pop
\ No newline at end of file
diff --git a/src/bitwise.cpp b/src/bitwise.cpp
deleted file mode 100644
index 2c948bd2..00000000
--- a/src/bitwise.cpp
+++ /dev/null
@@ -1,338 +0,0 @@
-/*
- This file is part of Zagreus.
-
- Zagreus is a UCI chess engine
- Copyright (C) 2023 Danny Jelsma
-
- Zagreus is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published
- by the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- Zagreus is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with Zagreus. If not, see .
- */
-
-#include "bitwise.h"
-
-#include
-#include
-#include
-
-namespace Zagreus {
-static uint64_t kingAttacks[64]{};
-static uint64_t knightAttacks[64]{};
-static uint64_t pawnAttacks[2][64]{};
-static uint64_t rayAttacks[8][64]{};
-static uint64_t betweenTable[64][64]{};
-
-static uint64_t zobristPieceConstants[PIECE_TYPES][SQUARES]{};
-static uint64_t zobristMovingColorConstant{};
-static uint64_t zobristCastleConstants[4]{};
-static uint64_t zobristEnPassantConstants[8]{};
-
-uint64_t soutOne(uint64_t b) { return b >> 8ULL; }
-
-uint64_t nortOne(uint64_t b) { return b << 8ULL; }
-
-uint64_t eastOne(uint64_t b) { return b << 1ULL & NOT_A_FILE; }
-
-uint64_t noEaOne(uint64_t b) { return b << 9ULL & NOT_A_FILE; }
-
-uint64_t soEaOne(uint64_t b) { return b >> 7ULL & NOT_A_FILE; }
-
-uint64_t westOne(uint64_t b) { return b >> 1ULL & NOT_H_FILE; }
-
-uint64_t soWeOne(uint64_t b) { return b >> 9ULL & NOT_H_FILE; }
-
-uint64_t noWeOne(uint64_t b) { return b << 7ULL & NOT_H_FILE; }
-
-uint64_t noNoEa(uint64_t b) { return b << 17ULL & NOT_A_FILE; }
-
-uint64_t noEaEa(uint64_t b) { return b << 10ULL & NOT_AB_FILE; }
-
-uint64_t soEaEa(uint64_t b) { return b >> 6ULL & NOT_AB_FILE; }
-
-uint64_t soSoEa(uint64_t b) { return b >> 15ULL & NOT_A_FILE; }
-
-uint64_t noNoWe(uint64_t b) { return b << 15ULL & NOT_H_FILE; }
-
-uint64_t noWeWe(uint64_t b) { return b << 6ULL & NOT_GH_FILE; }
-
-uint64_t nortFill(uint64_t gen) {
- gen |= gen << 8;
- gen |= gen << 16;
- gen |= gen << 32;
-
- return gen;
-}
-
-uint64_t soutFill(uint64_t gen) {
- gen |= gen >> 8;
- gen |= gen >> 16;
- gen |= gen >> 32;
-
- return gen;
-}
-
-uint64_t whiteFrontSpans(uint64_t pawns) { return nortOne(nortFill(pawns)); }
-
-uint64_t whiteRearSpans(uint64_t pawns) { return soutOne(soutFill(pawns)); }
-
-uint64_t blackRearSpans(uint64_t pawns) { return nortOne(nortFill(pawns)); }
-
-uint64_t blackFrontSpans(uint64_t pawns) { return soutOne(soutFill(pawns)); }
-
-uint64_t soutOccl(uint64_t pieceBB, uint64_t empty) {
- pieceBB |= empty & pieceBB >> 8ULL;
- empty &= empty >> 8ULL;
- pieceBB |= empty & pieceBB >> 16ULL;
- empty &= empty >> 16ULL;
- pieceBB |= empty & pieceBB >> 32ULL;
- return soutOne(pieceBB);
-}
-
-uint64_t nortOccl(uint64_t pieceBB, uint64_t empty) {
- pieceBB |= empty & pieceBB << 8ULL;
- empty &= empty << 8ULL;
- pieceBB |= empty & pieceBB << 16ULL;
- empty &= empty << 16ULL;
- pieceBB |= empty & pieceBB << 32ULL;
- return nortOne(pieceBB);
-}
-
-uint64_t eastOccl(uint64_t pieceBB, uint64_t empty) {
- empty &= NOT_A_FILE;
- pieceBB |= empty & pieceBB << 1ULL;
- empty &= empty << 1ULL;
- pieceBB |= empty & pieceBB << 2ULL;
- empty &= empty << 2ULL;
- pieceBB |= empty & pieceBB << 4ULL;
- return eastOne(pieceBB);
-}
-
-uint64_t noEaOccl(uint64_t pieceBB, uint64_t empty) {
- empty &= NOT_A_FILE;
- pieceBB |= empty & pieceBB << 9ULL;
- empty &= empty << 9ULL;
- pieceBB |= empty & pieceBB << 18ULL;
- empty &= empty << 18ULL;
- pieceBB |= empty & pieceBB << 36ULL;
- return noEaOne(pieceBB);
-}
-
-uint64_t soEaOccl(uint64_t pieceBB, uint64_t empty) {
- empty &= NOT_A_FILE;
- pieceBB |= empty & pieceBB >> 7ULL;
- empty &= empty >> 7ULL;
- pieceBB |= empty & pieceBB >> 14ULL;
- empty &= empty >> 14ULL;
- pieceBB |= empty & pieceBB >> 28ULL;
- return soEaOne(pieceBB);
-}
-
-uint64_t westOccl(uint64_t pieceBB, uint64_t empty) {
- empty &= NOT_H_FILE;
- pieceBB |= empty & pieceBB >> 1ULL;
- empty &= empty >> 1ULL;
- pieceBB |= empty & pieceBB >> 2ULL;
- empty &= empty >> 2ULL;
- pieceBB |= empty & pieceBB >> 4ULL;
- return westOne(pieceBB);
-}
-
-uint64_t soWeOccl(uint64_t pieceBB, uint64_t empty) {
- empty &= NOT_H_FILE;
- pieceBB |= empty & pieceBB >> 9ULL;
- empty &= empty >> 9ULL;
- pieceBB |= empty & pieceBB >> 18ULL;
- empty &= empty >> 18ULL;
- pieceBB |= empty & pieceBB >> 36ULL;
- return soWeOne(pieceBB);
-}
-
-uint64_t noWeOccl(uint64_t pieceBB, uint64_t empty) {
- empty &= NOT_H_FILE;
- pieceBB |= empty & pieceBB << 7ULL;
- empty &= empty << 7ULL;
- pieceBB |= empty & pieceBB << 14ULL;
- empty &= empty << 14ULL;
- pieceBB |= empty & pieceBB << 28ULL;
- return noWeOne(pieceBB);
-}
-
-template
-uint64_t calculatePawnEastAttacks(uint64_t pawns) {
- if (color == WHITE) {
- return noEaOne(pawns);
- }
- return soEaOne(pawns);
-}
-
-template
-uint64_t calculatePawnWestAttacks(uint64_t pawns) {
- if (color == WHITE) {
- return noWeOne(pawns);
- }
- return soWeOne(pawns);
-}
-
-uint64_t calculateKnightAttacks(uint64_t knights) {
- uint64_t l1 = knights >> 1ULL & NOT_H_FILE;
- uint64_t l2 = knights >> 2ULL & NOT_GH_FILE;
- uint64_t r1 = knights << 1ULL & NOT_A_FILE;
- uint64_t r2 = knights << 2ULL & NOT_AB_FILE;
- uint64_t h1 = l1 | r1;
- uint64_t h2 = l2 | r2;
- return h1 << 16ULL | h1 >> 16ULL | h2 << 8ULL | h2 >> 8ULL;
-}
-
-uint64_t calculateKingAttacks(uint64_t kingSet) {
- uint64_t attacks = eastOne(kingSet) | westOne(kingSet);
- kingSet |= attacks;
- attacks |= nortOne(kingSet) | soutOne(kingSet);
-
- return attacks;
-}
-
-void initializeBitboardConstants() {
- std::mt19937_64 gen(0x6C7CCC580A348E7BULL);
- std::uniform_int_distribution dis(1ULL, UINT64_MAX);
- std::vector generatedZobristConstants(ZOBRIST_CONSTANT_SIZE);
-
- for (int pieceType = 0; pieceType < PIECE_TYPES; pieceType++) {
- for (int square = 0; square < SQUARES; square++) {
- uint64_t zobristConstant = dis(gen);
- zobristPieceConstants[pieceType][square] = zobristConstant;
-
- // if constant already generated, generate a new one
- if (std::ranges::find(generatedZobristConstants, zobristConstant) !=
- generatedZobristConstants.end()) {
- zobristConstant = dis(gen);
- }
-
- generatedZobristConstants.push_back(zobristConstant);
- }
- }
-
- zobristMovingColorConstant = dis(gen);
-
- for (int i = 0; i < 4; i++) {
- zobristCastleConstants[i] = dis(gen);
- }
-
- for (int i = 0; i < 8; i++) {
- zobristEnPassantConstants[i] = dis(gen);
- }
-
- uint64_t sqBB = 1ULL;
- for (int8_t sq = 0; sq < 64; sq++, sqBB <<= 1ULL) {
- kingAttacks[sq] = calculateKingAttacks(sqBB) & ~sqBB;
- }
-
- sqBB = 1ULL;
- for (int8_t sq = 0; sq < 64; sq++, sqBB <<= 1ULL) {
- knightAttacks[sq] = calculateKnightAttacks(sqBB) & ~sqBB;
- }
-
- sqBB = 1ULL;
- for (int8_t sq = 0; sq < 64; sq++, sqBB <<= 1ULL) {
- pawnAttacks[WHITE][sq] = calculatePawnAttacks(sqBB) & ~sqBB;
- pawnAttacks[BLACK][sq] = calculatePawnAttacks(sqBB) & ~sqBB;
- }
-
- initializeBetweenLookup();
- initializeRayAttacks();
-}
-
-void initializeBetweenLookup() {
- for (int from = 0; from < 64; from++) {
- for (int to = 0; to < 64; to++) {
- uint64_t m1 = -1ULL;
- uint64_t a2a7 = 0x0001010101010100ULL;
- uint64_t b2g7 = 0x0040201008040200ULL;
- uint64_t h1b7 = 0x0002040810204080ULL;
- uint64_t btwn, line, rank, file;
-
- btwn = m1 << from ^ m1 << to;
- file = (to & 7) - (from & 7);
- rank = ((to | 7) - from) >> 3;
- line = (file & 7) - 1 & a2a7; /* a2a7 if same file */
- line += 2 * (((rank & 7) - 1) >> 58); /* b1g1 if same rank */
- line += (rank - file & 15) - 1 & b2g7; /* b2g7 if same diagonal */
- line += (rank + file & 15) - 1 & h1b7; /* h1b7 if same antidiag */
- line *= btwn & -btwn; /* mul acts like shift by smaller square */
-
- betweenTable[from][to] = line & btwn; /* return the bits on that line in-between */
- }
- }
-}
-
-void initializeRayAttacks() {
- uint64_t sqBB = 1ULL;
-
- for (int sq = 0; sq < 64; sq++, sqBB <<= 1ULL) {
- rayAttacks[NORTH][sq] = nortOccl(sqBB, ~0ULL) & ~sqBB;
- rayAttacks[SOUTH][sq] = soutOccl(sqBB, ~0ULL) & ~sqBB;
- rayAttacks[EAST][sq] = eastOccl(sqBB, ~0ULL) & ~sqBB;
- rayAttacks[WEST][sq] = westOccl(sqBB, ~0ULL) & ~sqBB;
- rayAttacks[NORTH_EAST][sq] = noEaOccl(sqBB, ~0ULL) & ~sqBB;
- rayAttacks[NORTH_WEST][sq] = noWeOccl(sqBB, ~0ULL) & ~sqBB;
- rayAttacks[SOUTH_EAST][sq] = soEaOccl(sqBB, ~0ULL) & ~sqBB;
- rayAttacks[SOUTH_WEST][sq] = soWeOccl(sqBB, ~0ULL) & ~sqBB;
- }
-}
-
-uint64_t getRayAttack(int8_t square, Direction direction) {
- return rayAttacks[direction][square];
-}
-
-uint64_t getKingAttacks(int8_t square) {
- return kingAttacks[square];
-}
-
-uint64_t getKnightAttacks(int8_t square) {
- return knightAttacks[square];
-}
-
-uint64_t getBetweenSquares(int8_t from, int8_t to) {
- return betweenTable[from][to];
-}
-
-uint64_t getPieceZobristConstant(PieceType pieceType, int8_t square) {
- return zobristPieceConstants[pieceType][square];
-}
-
-uint64_t getMovingColorZobristConstant() {
- return zobristMovingColorConstant;
-}
-
-uint64_t getCastleZobristConstant(uint8_t index) {
- return zobristCastleConstants[index];
-}
-
-uint64_t getEnPassantZobristConstant(uint8_t file) {
- return zobristEnPassantConstants[file];
-}
-
-template
-uint64_t calculatePawnAttacks(uint64_t bb) {
- return calculatePawnEastAttacks(bb) | calculatePawnWestAttacks(bb);
-}
-
-template uint64_t calculatePawnAttacks(uint64_t);
-template uint64_t calculatePawnAttacks(uint64_t);
-
-template
-uint64_t getPawnAttacks(int8_t square) {
- return pawnAttacks[color][square];
-}
-
-template uint64_t getPawnAttacks(int8_t square);
-template uint64_t getPawnAttacks(int8_t square);
-} // namespace Zagreus
\ No newline at end of file
diff --git a/src/bitwise.h b/src/bitwise.h
index 5858379b..20b299ef 100644
--- a/src/bitwise.h
+++ b/src/bitwise.h
@@ -2,7 +2,7 @@
This file is part of Zagreus.
Zagreus is a UCI chess engine
- Copyright (C) 2023 Danny Jelsma
+ Copyright (C) 2023-2025 Danny Jelsma
Zagreus is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published
@@ -19,107 +19,70 @@
*/
#pragma once
-
+#include
#include
#include "types.h"
namespace Zagreus {
-uint64_t soutOne(uint64_t b);
-
-uint64_t nortOne(uint64_t b);
-
-uint64_t eastOne(uint64_t b);
-
-uint64_t noEaOne(uint64_t b);
-
-uint64_t soEaOne(uint64_t b);
-
-uint64_t westOne(uint64_t b);
-
-uint64_t soWeOne(uint64_t b);
-
-uint64_t noWeOne(uint64_t b);
-
-uint64_t noNoEa(uint64_t b);
-
-uint64_t noEaEa(uint64_t b);
-
-uint64_t soEaEa(uint64_t b);
-
-uint64_t soSoEa(uint64_t b);
-
-uint64_t noNoWe(uint64_t b);
-
-uint64_t noWeWe(uint64_t b);
-
-uint64_t soWeWe(uint64_t b);
-
-uint64_t soSoWe(uint64_t b);
-
-uint64_t soutOccl(uint64_t pieceBB, uint64_t empty);
-
-uint64_t nortOccl(uint64_t pieceBB, uint64_t empty);
-
-uint64_t eastOccl(uint64_t pieceBB, uint64_t empty);
-
-uint64_t noEaOccl(uint64_t pieceBB, uint64_t empty);
-
-uint64_t soEaOccl(uint64_t pieceBB, uint64_t empty);
-
-uint64_t westOccl(uint64_t rooks, uint64_t empty);
-
-uint64_t soWeOccl(uint64_t bishops, uint64_t empty);
-
-uint64_t noWeOccl(uint64_t bishops, uint64_t empty);
-uint64_t nortFill(uint64_t gen);
-
-uint64_t soutFill(uint64_t gen);
-
-uint64_t whiteFrontSpans(uint64_t pawns);
-
-uint64_t whiteRearSpans(uint64_t pawns);
-
-uint64_t blackRearSpans(uint64_t pawns);
-
-uint64_t blackFrontSpans(uint64_t pawns);
-
-template
-uint64_t calculatePawnEastAttacks(uint64_t pawns);
-
-template
-uint64_t calculatePawnWestAttacks(uint64_t pawns);
-
-uint64_t calculateKnightAttacks(uint64_t knights);
-
-uint64_t calculateKingAttacks(uint64_t kingSet);
-
-void initializeBetweenLookup();
-
-void initializeRayAttacks();
-
-void initializeBitboardConstants();
-
-uint64_t getKingAttacks(int8_t square);
-
-uint64_t getKnightAttacks(int8_t square);
-
-uint64_t getRayAttack(int8_t square, Direction direction);
-
-uint64_t getBetweenSquares(int8_t from, int8_t to);
-
-uint64_t getPieceZobristConstant(PieceType pieceType, int8_t square);
-
-uint64_t getMovingColorZobristConstant();
-
-uint64_t getCastleZobristConstant(uint8_t index);
-
-uint64_t getEnPassantZobristConstant(uint8_t file);
+/**
+ * \brief Counts the number of set bits (population count) in a bitboard.
+ * \param bb The bitboard to count the set bits in.
+ * \return The number of set bits.
+ */
+inline uint64_t popcnt(uint64_t bb) {
+#ifdef _MSC_VER
+ return __popcnt64(bb);
+#else
+ return __builtin_popcountll(bb);
+#endif
+}
+
+/**
+ * \brief Finds the index of the least significant set bit (LSB) in a bitboard.
+ * \param bb The bitboard to scan.
+ * \return The index of the least significant set bit.
+ */
+inline int bitscanForward(uint64_t bb) {
+ assert(bb != 0);
+#ifdef _MSC_VER
+ unsigned long index;
+ _BitScanForward64(&index, bb);
+ return (int) index;
+#else
+ return __builtin_ctzll(bb);
+#endif
+}
+
+/**
+ * \brief Finds the index of the most significant set bit (MSB) in a bitboard.
+ * \param bb The bitboard to scan.
+ * \return The index of the most significant set bit.
+ */
+inline int bitscanReverse(const uint64_t bb) {
+ assert(bb != 0);
+#ifdef _MSC_VER
+ unsigned long index;
+ _BitScanReverse64(&index, bb);
+ return (int) index;
+#else
+ return 63 - __builtin_clzll(bb);
+#endif
+}
+
+/**
+ * \brief Pops the least significant set bit (LSB) from a bitboard and returns its index. This modifies the bitboard.
+ * \param bb The bitboard to modify.
+ * \return The index of the popped least significant set bit.
+ */
+inline int popLsb(uint64_t& bb) {
+ assert(bb != 0);
+ const int lsb = bitscanForward(bb);
+ assert(lsb >= 0 && lsb < 64);
-template
-uint64_t getPawnAttacks(int8_t square);
+ bb &= bb - 1;
+ return lsb;
+}
-template
-uint64_t calculatePawnAttacks(uint64_t bb);
-} // namespace Zagreus
\ No newline at end of file
+} // namespace Zagreus::Bitwise
\ No newline at end of file
diff --git a/src/board.cpp b/src/board.cpp
new file mode 100644
index 00000000..5c65f5f9
--- /dev/null
+++ b/src/board.cpp
@@ -0,0 +1,875 @@
+/*
+ This file is part of Zagreus.
+
+ Zagreus is a UCI chess engine
+ Copyright (C) 2023-2025 Danny Jelsma
+
+ Zagreus is free software: you can redistribute it and/or modify
+ it under the terms of the GNU Affero General Public License as published
+ by the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ Zagreus is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU Affero General Public License for more details.
+
+ You should have received a copy of the GNU Affero General Public License
+ along with Zagreus. If not, see .
+ */
+
+#include "board.h"
+#include
+#include
+#include
+#include "bitwise.h"
+#include "eval.h"
+#include "pcg_random.hpp"
+
+namespace Zagreus {
+static uint64_t zobristConstants[781]{};
+
+/**
+ * \brief Initializes the Zobrist constants.
+ */
+void initZobristConstants() {
+ pcg64_oneseq_once_insecure rng;
+
+ rng.seed(0x661778f67199663dULL);
+
+ for (uint64_t& zobrist : zobristConstants) {
+ zobrist = rng();
+
+ while (zobrist == 0) {
+ zobrist = rng();
+ }
+ }
+}
+
+/**
+ * \brief Gets the Zobrist constant for a given index.
+ */
+constexpr uint64_t getZobristConstant(const int index) {
+ assert(index >= 0 && index < 781);
+ assert(zobristConstants[index] != 0);
+ return zobristConstants[index];
+}
+
+/**
+ * \brief Checks if the current position is legal for the given color.
+ * \tparam movedColor The color of the player who just moved.
+ * \return True if the position is legal, false otherwise.
+ */
+template
+bool Board::isPositionLegal() const {
+ constexpr PieceColor opponentColor = !movedColor;
+ constexpr Piece king = movedColor == WHITE ? WHITE_KING : BLACK_KING;
+ const uint64_t kingBB = getPieceBoard();
+ const Square kingSquare = bitboardToSquare(kingBB);
+ const Move lastMove = getLastMove();
+ const MoveType lastMoveType = getMoveType(lastMove);
+
+ if (lastMoveType == CASTLING) {
+ const Square fromSquare = getFromSquare(lastMove);
+ const Square toSquare = getToSquare(lastMove);
+ const uint64_t fromSquareAttacks = getSquareAttackersByColor(fromSquare);
+
+ if (fromSquareAttacks) {
+ // King was in check before castling
+ return false;
+ }
+
+ uint64_t castlingPath = 0;
+
+ if (toSquare == G1) {
+ castlingPath = WHITE_KINGSIDE_CASTLE_PATH;
+ } else if (toSquare == C1) {
+ castlingPath = WHITE_QUEENSIDE_CASTLE_PATH;
+ } else if (toSquare == G8) {
+ castlingPath = BLACK_KINGSIDE_CASTLE_PATH;
+ } else if (toSquare == C8) {
+ castlingPath = BLACK_QUEENSIDE_CASTLE_PATH;
+ }
+
+ while (castlingPath) {
+ const Square square = static_cast(popLsb(castlingPath));
+ const uint64_t attackers = getSquareAttackersByColor(square);
+
+ if (attackers) {
+ return false;
+ }
+ }
+ }
+
+ return !getSquareAttackersByColor(kingSquare);
+}
+
+template bool Board::isPositionLegal() const;
+template bool Board::isPositionLegal() const;
+
+/**
+ * \brief Checks if castling is possible for the given side. It checks every rule, except for attacks on the castling path or if the king is in check
+ * \tparam side The side to check for castling (WHITE_KINGSIDE, WHITE_QUEENSIDE, BLACK_KINGSIDE, BLACK_QUEENSIDE).
+ * \return True if castling is possible, false otherwise.
+ */
+template
+bool Board::canCastle() const {
+ assert(side != WHITE_CASTLING && side != BLACK_CASTLING);
+
+ if (!(castlingRights & side)) {
+ return false;
+ }
+
+ uint64_t castlingPath = 0;
+
+ if constexpr (side == WHITE_KINGSIDE) {
+ castlingPath = WHITE_KINGSIDE_CASTLE_UNOCCUPIED;
+ } else if constexpr (side == WHITE_QUEENSIDE) {
+ castlingPath = WHITE_QUEENSIDE_CASTLE_UNOCCUPIED;
+ } else if constexpr (side == BLACK_KINGSIDE) {
+ castlingPath = BLACK_KINGSIDE_CASTLE_UNOCCUPIED;
+ } else if constexpr (side == BLACK_QUEENSIDE) {
+ castlingPath = BLACK_QUEENSIDE_CASTLE_UNOCCUPIED;
+ }
+
+ if (occupied & castlingPath) {
+ return false;
+ }
+
+ return true;
+}
+
+template bool Board::canCastle() const;
+template bool Board::canCastle() const;
+template bool Board::canCastle() const;
+template bool Board::canCastle() const;
+
+/**
+ * \brief Retrieves the attackers of a given square.
+ * \param square The square index (0-63).
+ * \return A bitboard representing the attackers.
+ */
+uint64_t Board::getSquareAttackers(const Square square) const {
+ assert(square < SQUARES);
+ const uint64_t knights = getPieceBoard() | getPieceBoard();
+ const uint64_t kings = getPieceBoard() | getPieceBoard();
+ uint64_t bishopsQueens = getPieceBoard() | getPieceBoard();
+ uint64_t rooksQueens = getPieceBoard() | getPieceBoard();
+ rooksQueens |= getPieceBoard() | getPieceBoard();
+ bishopsQueens |= getPieceBoard() | getPieceBoard();
+
+ return (getPawnAttacks(square) & getPieceBoard())
+ | (getPawnAttacks(square) & getPieceBoard())
+ | (getKnightAttacks(square) & knights)
+ | (getKingAttacks(square) & kings)
+ | (getBishopAttacks(square, occupied) & bishopsQueens)
+ | (getRookAttacks(square, occupied) & rooksQueens);
+}
+
+/**
+ * \brief Resets the board to the initial state.
+ */
+void Board::reset() {
+ this->board = {};
+ this->bitboards = {};
+ this->colorBoards = {};
+ this->history = {};
+ this->sideToMove = WHITE;
+ this->occupied = 0;
+ this->zobristHash = 0;
+ this->ply = 0;
+ this->fullmoveClock = 1;
+ this->halfMoveClock = 0;
+ this->castlingRights = 0;
+ this->enPassantSquare = 255;
+ this->previousPvLine = PvLine{0};
+
+ std::ranges::fill(board, EMPTY);
+ std::ranges::fill(bitboards, 0);
+ std::ranges::fill(colorBoards, 0);
+ std::ranges::fill(history, BoardState{});
+}
+
+/**
+ * \brief Prints the current state of the board to the console.
+ */
+void Board::print() const {
+ std::cout << " ---------------------------------";
+
+ for (int index = 0; index < 64; index++) {
+ if (index % 8 == 0) {
+ std::cout << std::endl << index / 8 + 1 << " | ";
+ }
+
+ std::cout << getCharacterForPieceType(board[index]) << " | ";
+ }
+
+ std::cout << std::endl << " ---------------------------------" << std::endl;
+ std::cout << " a b c d e f g h " << std::endl;
+}
+
+bool Board::isDraw() const {
+ const uint64_t occupied = getOccupiedBitboard();
+
+ if (halfMoveClock >= 100) {
+ return true;
+ }
+
+ const uint64_t zobristHash = getZobristHash();
+
+ // 3-fold repetition
+ for (int i = ply - 2; i >= 0; i -= 2) {
+ if (history[i].zobristHash == zobristHash) {
+ return true;
+ }
+ }
+
+ const uint64_t sufficientMaterial = getPieceBoard() | getPieceBoard()
+ | getPieceBoard() | getPieceBoard()
+ | getPieceBoard() | getPieceBoard();
+
+ if (sufficientMaterial) {
+ // Can never be a draw with queens, rooks or pawns
+ return false;
+ }
+
+ // Only kings left
+ if (popcnt(occupied) == 2) {
+ return true;
+ }
+
+ // Check for KBvK, KNvK
+ if (popcnt(occupied) == 3) {
+ if (getPieceBoard() || getPieceBoard() || getPieceBoard() ||
+ getPieceBoard<
+ BLACK_KNIGHT>()) {
+ return true;
+ }
+ }
+
+ // Check for KBvKB where bishops are on the same color
+ if (popcnt(occupied) == 4) {
+ if (getPieceBoard() && getPieceBoard()) {
+ if ((getPieceBoard() & DARK_SQUARES) == (getPieceBoard() & DARK_SQUARES)) {
+ return true;
+ }
+
+ if ((getPieceBoard() & LIGHT_SQUARES) == (getPieceBoard