Add transform minimize_binpack for minimizing existing .binpack datasets. (#4447 )

Takes advantage of the sample skipping rules that are used during training (capture, check, or VALUE_NONE). Adds positions to keep continuity, which improves compression.
Tools transform option for filtering data for training nn-335a9b2d8a80.nnue (#4324 )
2026-05-20 08:37:44 +00:00 · 2023-04-25 19:21:29 +02:00 · 2023-02-05 14:21:48 +01:00 · 2022-12-12 22:55:39 +01:00 · 2022-06-03 06:36:46 +02:00 · 2022-05-30 21:03:44 +02:00
138 changed files with 30660 additions and 17813 deletions
@@ -1,44 +0,0 @@
 AccessModifierOffset: -1
 AlignAfterOpenBracket: Align
 AlignConsecutiveAssignments: Consecutive
 AlignConsecutiveDeclarations: Consecutive
 AlignEscapedNewlines: DontAlign
 AlignOperands: AlignAfterOperator
 AlignTrailingComments: true
 AllowAllParametersOfDeclarationOnNextLine: true
 AllowShortCaseLabelsOnASingleLine: false
 AllowShortEnumsOnASingleLine: false
 AllowShortIfStatementsOnASingleLine: false
 AlwaysBreakTemplateDeclarations: Yes
 BasedOnStyle: WebKit
 BitFieldColonSpacing: After
 BinPackParameters: false
 BreakBeforeBinaryOperators: NonAssignment
 BreakBeforeBraces: Custom
 BraceWrapping:
  AfterFunction: false 
  AfterClass: false
  AfterControlStatement: true
  BeforeElse: true
 BreakBeforeTernaryOperators: true
 BreakConstructorInitializers: AfterColon
 BreakStringLiterals: false
 ColumnLimit: 100
 ContinuationIndentWidth: 2
 Cpp11BracedListStyle: true
 IndentGotoLabels: false
 IndentPPDirectives: BeforeHash
 IndentWidth: 4
 MaxEmptyLinesToKeep: 2
 NamespaceIndentation: None
 PackConstructorInitializers: Never
 ReflowComments: false
 SortIncludes: false
 SortUsingDeclarations: false
 SpaceAfterCStyleCast: true
 SpaceAfterTemplateKeyword: false
 SpaceBeforeCaseColon: true
 SpaceBeforeCpp11BracedList: false
 SpaceBeforeInheritanceColon: false
 SpaceInEmptyBlock: false
 SpacesBeforeTrailingComments: 2
@@ -1,7 +0,0 @@
 # .git-blame-ignore-revs
 # Ignore commit which added clang-format
 2d0237db3f0e596fb06e3ffbadba84dcc4e018f6
 # Post commit formatting fixes
 0fca5605fa2e5e7240fde5e1aae50952b2612231
 08ed4c90db31959521b7ef3186c026edd1e90307
@@ -1,65 +0,0 @@
 name: Report issue
 description: Create a report to help us fix issues with the engine
 body:
 - type: textarea
  attributes:
    label: Describe the issue
    description: A clear and concise description of what you're experiencing.
  validations:
    required: true
 - type: textarea
  attributes:
    label: Expected behavior
    description: A clear and concise description of what you expected to happen.
  validations:
    required: true
 - type: textarea
  attributes:
    label: Steps to reproduce
    description: |
      Steps to reproduce the behavior.
      You can also use this section to paste the command line output.
    placeholder: |
      ```
      position startpos moves g2g4 e7e5 f2f3
      go mate 1
      info string NNUE evaluation using nn-6877cd24400e.nnue enabled
      info depth 1 seldepth 1 multipv 1 score mate 1 nodes 33 nps 11000 tbhits 0 time 3 pv d8h4
      bestmove d8h4
      ```
  validations:
    required: true
 - type: textarea
  attributes:
    label: Anything else?
    description: |
      Anything that will give us more context about the issue you are encountering.
      You can also use this section to propose ideas on how to solve the issue. 
  validations:
    required: false
 - type: dropdown
  attributes:
    label: Operating system
    options:
      - All
      - Windows
      - Linux
      - MacOS
      - Android
      - Other or N/A
  validations:
    required: true
 - type: input
  attributes:
    label: Stockfish version
    description: |
      This can be found by running the engine.
      You can also use the commit ID.
    placeholder: Stockfish 15 / e6e324e
  validations:
    required: true
@@ -1,8 +0,0 @@
 blank_issues_enabled: false
 contact_links:
  - name: Discord server
    url: https://discord.gg/GWDRS3kU6R
    about: Feel free to ask for support or have a chat with us on our Discord server!
  - name: Discussions, Q&A, ideas, show us something...
    url: https://github.com/official-stockfish/Stockfish/discussions/new
    about: Do you have an idea for Stockfish? Do you want to show something that you made? Please open a discussion about it!
@@ -1,51 +0,0 @@
 {
  "config": [
    {
      "name": "Android NDK aarch64",
      "os": "ubuntu-22.04",
      "simple_name": "android",
      "compiler": "aarch64-linux-android21-clang++",
      "emu": "qemu-aarch64",
      "comp": "ndk",
      "shell": "bash",
      "archive_ext": "tar"
    },
    {
      "name": "Android NDK arm",
      "os": "ubuntu-22.04",
      "simple_name": "android",
      "compiler": "armv7a-linux-androideabi21-clang++",
      "emu": "qemu-arm",
      "comp": "ndk",
      "shell": "bash",
      "archive_ext": "tar"
    }
  ],
  "binaries": ["armv8-dotprod", "armv8", "armv7", "armv7-neon"],
  "exclude": [
    {
      "binaries": "armv8-dotprod",
      "config": {
        "compiler": "armv7a-linux-androideabi21-clang++"
      }
    },
    {
      "binaries": "armv8",
      "config": {
        "compiler": "armv7a-linux-androideabi21-clang++"
      }
    },
    {
      "binaries": "armv7",
      "config": {
        "compiler": "aarch64-linux-android21-clang++"
      }
    },
    {
      "binaries": "armv7-neon",
      "config": {
        "compiler": "aarch64-linux-android21-clang++"
      }
    }
  ]
 }
@@ -1,22 +0,0 @@
 [
    # Mappings for libcxx's internal headers
    { include: [ "<__fwd/fstream.h>", private, "<iosfwd>", public ] },
    { include: [ "<__fwd/ios.h>", private, "<iosfwd>", public ] },
    { include: [ "<__fwd/istream.h>", private, "<iosfwd>", public ] },
    { include: [ "<__fwd/ostream.h>", private, "<iosfwd>", public ] },
    { include: [ "<__fwd/sstream.h>", private, "<iosfwd>", public ] },
    { include: [ "<__fwd/streambuf.h>", private, "<iosfwd>", public ] },
    { include: [ "<__fwd/string_view.h>", private, "<string_view>", public ] },
    { include: [ "<__system_error/errc.h>", private, "<system_error>", public ] },
    # Mappings for includes between public headers
    { include: [ "<ios>", public, "<iostream>", public ] },
    { include: [ "<streambuf>", public, "<iostream>", public ] },
    { include: [ "<istream>", public, "<iostream>", public ] },
    { include: [ "<ostream>", public, "<iostream>", public ] },
    { include: [ "<iosfwd>", public, "<iostream>", public ] },
    # Missing mappings in include-what-you-use's libcxx.imp
    { include: ["@<__condition_variable/.*>", private, "<condition_variable>", public ] },
    { include: ["@<__mutex/.*>", private, "<mutex>", public ] },
 ]
@@ -1,160 +0,0 @@
 {
  "config": [
    {
      "name": "Ubuntu 22.04 GCC",
      "os": "ubuntu-22.04",
      "simple_name": "ubuntu",
      "compiler": "g++",
      "comp": "gcc",
      "shell": "bash",
      "archive_ext": "tar",
      "sde": "/home/runner/work/Stockfish/Stockfish/.output/sde-temp-files/sde-external-9.27.0-2023-09-13-lin/sde -future --"
    },
    {
      "name": "MacOS 13 Apple Clang",
      "os": "macos-13",
      "simple_name": "macos",
      "compiler": "clang++",
      "comp": "clang",
      "shell": "bash",
      "archive_ext": "tar"
    },
    {
      "name": "MacOS 14 Apple Clang M1",
      "os": "macos-14",
      "simple_name": "macos-m1",
      "compiler": "clang++",
      "comp": "clang",
      "shell": "bash",
      "archive_ext": "tar"
    },
    {
      "name": "Windows 2022 Mingw-w64 GCC x86_64",
      "os": "windows-2022",
      "simple_name": "windows",
      "compiler": "g++",
      "comp": "mingw",
      "msys_sys": "mingw64",
      "msys_env": "x86_64-gcc",
      "shell": "msys2 {0}",
      "ext": ".exe",
      "sde": "/d/a/Stockfish/Stockfish/.output/sde-temp-files/sde-external-9.27.0-2023-09-13-win/sde.exe -future --",
      "archive_ext": "zip"
    }
  ],
  "binaries": [
    "x86-64",
    "x86-64-sse41-popcnt",
    "x86-64-avx2",
    "x86-64-bmi2",
    "x86-64-avxvnni",
    "x86-64-avx512",
    "x86-64-vnni256",
    "x86-64-vnni512",
    "apple-silicon"
  ],
  "exclude": [
    {
      "binaries": "x86-64",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-sse41-popcnt",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-avx2",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-bmi2",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-avxvnni",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-avxvnni",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-avx512",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-vnni256",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-vnni512",
      "config": {
        "os": "macos-14"
      }
    },
    {
      "binaries": "x86-64-avxvnni",
      "config": {
        "ubuntu-22.04": null
      }
    },
    {
      "binaries": "x86-64-avxvnni",
      "config": {
        "os": "macos-13"
      }
    },
    {
      "binaries": "x86-64-avx512",
      "config": {
        "os": "macos-13"
      }
    },
    {
      "binaries": "x86-64-vnni256",
      "config": {
        "os": "macos-13"
      }
    },
    {
      "binaries": "x86-64-vnni512",
      "config": {
        "os": "macos-13"
      }
    },
    {
      "binaries": "apple-silicon",
      "config": {
        "os": "windows-2022"
      }
    },
    {
      "binaries": "apple-silicon",
      "config": {
        "os": "macos-13"
      }
    },
    {
      "binaries": "apple-silicon",
      "config": {
        "os": "ubuntu-22.04"
      }
    }
  ]
 }
@@ -1,98 +0,0 @@
 name: Compilation
 on:
  workflow_call:
    inputs:
      matrix:
        type: string
        required: true
 jobs:
  Compilation:
    name: ${{ matrix.config.name }} ${{ matrix.binaries }}
    runs-on: ${{ matrix.config.os }}
    env:
      COMPCXX: ${{ matrix.config.compiler }}
      COMP: ${{ matrix.config.comp }}
      EMU: ${{ matrix.config.emu }}
      EXT: ${{ matrix.config.ext }}
      BINARY: ${{ matrix.binaries }}
    strategy:
      fail-fast: false
      matrix: ${{ fromJson(inputs.matrix) }}
    defaults:
      run:
        working-directory: src
        shell: ${{ matrix.config.shell }}
    steps:
      - uses: actions/checkout@v4
        with:
          fetch-depth: 0
          persist-credentials: false
      - name: Download required linux packages
        if: runner.os == 'Linux'
        run: |
          sudo apt update
          sudo apt install qemu-user
      - name: Install NDK
        if: runner.os == 'Linux'
        run: |
          if [ $COMP == ndk ]; then
            NDKV="21.4.7075529"
            ANDROID_ROOT=/usr/local/lib/android
            ANDROID_SDK_ROOT=$ANDROID_ROOT/sdk
            SDKMANAGER=$ANDROID_SDK_ROOT/cmdline-tools/latest/bin/sdkmanager
            echo "y" | $SDKMANAGER "ndk;$NDKV"
            ANDROID_NDK_ROOT=$ANDROID_SDK_ROOT/ndk/$NDKV
            ANDROID_NDK_BIN=$ANDROID_NDK_ROOT/toolchains/llvm/prebuilt/linux-x86_64/bin
            echo "ANDROID_NDK_BIN=$ANDROID_NDK_BIN" >> $GITHUB_ENV
          fi
      - name: Extract the bench number from the commit history
        run: |
          for hash in $(git rev-list -100 HEAD); do
            benchref=$(git show -s $hash | tac | grep -m 1 -o -x '[[:space:]]*\b[Bb]ench[ :]\+[1-9][0-9]\{5,7\}\b[[:space:]]*' | sed 's/[^0-9]//g') && break || true
          done
          [[ -n "$benchref" ]] && echo "benchref=$benchref" >> $GITHUB_ENV && echo "From commit: $hash" && echo "Reference bench: $benchref" || echo "No bench found"
      - name: Download the used network from the fishtest framework
        run: make net
      - name: Check compiler
        run: |
          if [ $COMP == ndk ]; then
            export PATH=${{ env.ANDROID_NDK_BIN }}:$PATH
          fi
          $COMPCXX -v
      - name: Test help target
        run: make help
      - name: Check git
        run: git --version
      # Compile profile guided builds
      - name: Compile ${{ matrix.binaries }} build
        run: |
          if [ $COMP == ndk ]; then
            export PATH=${{ env.ANDROID_NDK_BIN }}:$PATH
            export LDFLAGS="-static -Wno-unused-command-line-argument"
          fi
          make clean
          make -j4 profile-build ARCH=$BINARY COMP=$COMP WINE_PATH=$EMU
          make strip ARCH=$BINARY COMP=$COMP
          WINE_PATH=$EMU ../tests/signature.sh $benchref
          mv ./stockfish$EXT ../stockfish-android-$BINARY$EXT
      - name: Remove non src files
        run: git clean -fx
      - name: Upload artifact for (pre)-release
        uses: actions/upload-artifact@v4
        with:
          name: ${{ matrix.config.simple_name }} ${{ matrix.binaries }}
          path: |
            .
            !.git
            !.output
@@ -1,57 +0,0 @@
 # This workflow will run clang-format and comment on the PR.
 # Because of security reasons, it is crucial that this workflow
 # executes no shell script nor runs make.
 # Read this before editing: https://securitylab.github.com/research/github-actions-preventing-pwn-requests/
 name: Clang-Format
 on:
  pull_request_target:
    branches:
      - "master"
    paths:
      - "**.cpp"
      - "**.h"
 permissions:
  pull-requests: write
 jobs:
  Clang-Format:
    name: Clang-Format
    runs-on: ubuntu-22.04
    steps:
      - uses: actions/checkout@v4
        with:
          ref: ${{ github.event.pull_request.head.sha }}
      - name: Run clang-format style check
        uses: jidicula/clang-format-action@f62da5e3d3a2d88ff364771d9d938773a618ab5e # @v4.11.0
        id: clang-format
        continue-on-error: true
        with:
          clang-format-version: "18"
          exclude-regex: "incbin"
      - name: Comment on PR
        if: steps.clang-format.outcome == 'failure'
        uses: thollander/actions-comment-pull-request@fabd468d3a1a0b97feee5f6b9e499eab0dd903f6 # @v2.5.0
        with:
          message: |
            clang-format 18 needs to be run on this PR.
            If you do not have clang-format installed, the maintainer will run it when merging.
            For the exact version please see https://packages.ubuntu.com/noble/clang-format-18.
            _(execution **${{ github.run_id }}** / attempt **${{ github.run_attempt }}**)_
          comment_tag: execution
          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
      - name: Comment on PR
        if: steps.clang-format.outcome != 'failure'
        uses: thollander/actions-comment-pull-request@fabd468d3a1a0b97feee5f6b9e499eab0dd903f6 # @v2.5.0
        with:
          message: |
            _(execution **${{ github.run_id }}** / attempt **${{ github.run_attempt }}**)_
          create_if_not_exists: false
          comment_tag: execution
          mode: delete
          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
@@ -1,55 +0,0 @@
 name: "CodeQL"
 on:
  push:
    branches: ["master"]
  pull_request:
    # The branches below must be a subset of the branches above
    branches: ["master"]
  schedule:
    - cron: "17 18 * * 1"
 jobs:
  analyze:
    name: Analyze
    runs-on: ubuntu-latest
    permissions:
      actions: read
      contents: read
      security-events: write
    strategy:
      fail-fast: false
      matrix:
        language: ["cpp"]
        # CodeQL supports [ 'cpp', 'csharp', 'go', 'java', 'javascript', 'python', 'ruby' ]
        # Use only 'java' to analyze code written in Java, Kotlin, or both
        # Use only 'javascript' to analyze code written in JavaScript, TypeScript or both
        # Learn more about CodeQL language support at https://aka.ms/codeql-docs/language-support
    steps:
      - name: Checkout repository
        uses: actions/checkout@v4
        with:
          persist-credentials: false
      # Initializes the CodeQL tools for scanning.
      - name: Initialize CodeQL
        uses: github/codeql-action/init@v3
        with:
          languages: ${{ matrix.language }}
          # If you wish to specify custom queries, you can do so here or in a config file.
          # By default, queries listed here will override any specified in a config file.
          # Prefix the list here with "+" to use these queries and those in the config file.
          # For more details on CodeQL's query packs, refer to: https://docs.github.com/en/code-security/code-scanning/automatically-scanning-your-code-for-vulnerabilities-and-errors/configuring-code-scanning#using-queries-in-ql-packs
          # queries: security-extended,security-and-quality
      - name: Build
        working-directory: src
        run: make -j build ARCH=x86-64-modern
      - name: Perform CodeQL Analysis
        uses: github/codeql-action/analyze@v3
        with:
          category: "/language:${{matrix.language}}"
@@ -1,94 +0,0 @@
 name: Compilation
 on:
  workflow_call:
    inputs:
      matrix:
        type: string
        required: true
 jobs:
  Compilation:
    name: ${{ matrix.config.name }} ${{ matrix.binaries }}
    runs-on: ${{ matrix.config.os }}
    env:
      COMPCXX: ${{ matrix.config.compiler }}
      COMP: ${{ matrix.config.comp }}
      EXT: ${{ matrix.config.ext }}
      NAME: ${{ matrix.config.simple_name }}
      BINARY: ${{ matrix.binaries }}
      SDE: ${{ matrix.config.sde }}
    strategy:
      fail-fast: false
      matrix: ${{ fromJson(inputs.matrix) }}
    defaults:
      run:
        working-directory: src
        shell: ${{ matrix.config.shell }}
    steps:
      - uses: actions/checkout@v4
        with:
          persist-credentials: false
      - name: Install fixed GCC on Linux
        if: runner.os == 'Linux'
        uses: egor-tensin/setup-gcc@eaa888eb19115a521fa72b65cd94fe1f25bbcaac # @v1.3
        with:
          version: 11
      - name: Setup msys and install required packages
        if: runner.os == 'Windows'
        uses: msys2/setup-msys2@v2
        with:
          msystem: ${{ matrix.config.msys_sys }}
          install: mingw-w64-${{ matrix.config.msys_env }} make git zip
      - name: Download SDE package
        if: runner.os == 'Linux' || runner.os == 'Windows'
        uses: petarpetrovt/setup-sde@91a1a03434384e064706634125a15f7446d2aafb # @v2.3
        with:
          environmentVariableName: SDE_DIR
          sdeVersion: 9.27.0
      - name: Download the used network from the fishtest framework
        run: make net
      - name: Check compiler
        run: $COMPCXX -v
      - name: Test help target
        run: make help
      - name: Check git
        run: git --version
      - name: Check compiler
        run: $COMPCXX -v
      - name: Show g++ cpu info
        if: runner.os != 'macOS'
        run: g++ -Q -march=native --help=target
      - name: Show clang++ cpu info
        if: runner.os == 'macOS'
        run: clang++ -E - -march=native -###
      # x86-64 with newer extensions tests
      - name: Compile ${{ matrix.config.binaries }} build
        run: |
          make clean
          make -j4 profile-build ARCH=$BINARY COMP=$COMP WINE_PATH="$SDE"
          make strip ARCH=$BINARY COMP=$COMP
          WINE_PATH="$SDE" ../tests/signature.sh $benchref
          mv ./stockfish$EXT ../stockfish-$NAME-$BINARY$EXT
      - name: Remove non src files
        run: git clean -fx
      - name: Upload artifact for (pre)-release
        uses: actions/upload-artifact@v4
        with:
          name: ${{ matrix.config.simple_name }} ${{ matrix.binaries }}
          path: |
             .
             !.git
             !.output
@@ -1,43 +0,0 @@
 # This workflow will play games with a debug enabled SF using the PR
 name: Games
 on:
  workflow_call:
 jobs:
  Matetrack:
    name: Games
    runs-on: ubuntu-22.04
    steps:
      - name: Checkout SF repo 
        uses: actions/checkout@v4
        with:
          ref: ${{ github.event.pull_request.head.sha }}
          path: Stockfish
          persist-credentials: false
      - name: build debug enabled version of SF
        working-directory: Stockfish/src
        run: make -j build debug=yes
      - name: Checkout fastchess repo
        uses: actions/checkout@v4
        with:
          repository: Disservin/fastchess
          path: fastchess
          ref: 894616028492ae6114835195f14a899f6fa237d3
          persist-credentials: false
      - name: fastchess build
        working-directory: fastchess
        run: make -j
      - name: Run games
        working-directory: fastchess
        run: |
          ./fastchess -rounds 4 -games 2 -repeat -concurrency 4 -openings file=app/tests/data/openings.epd format=epd order=random -srand $RANDOM\
               -engine name=sf1 cmd=/home/runner/work/Stockfish/Stockfish/Stockfish/src/stockfish\
               -engine name=sf2 cmd=/home/runner/work/Stockfish/Stockfish/Stockfish/src/stockfish\
               -ratinginterval 1 -report penta=true -each proto=uci tc=4+0.04 -log file=fast.log | tee fast.out
          cat fast.log
          ! grep "Assertion" fast.log > /dev/null
          ! grep "disconnect" fast.out > /dev/null
@@ -1,49 +0,0 @@
 name: IWYU
 on:
  workflow_call:
 jobs:
  Analyzers:
    name: Check includes
    runs-on: ubuntu-22.04
    defaults:
      run:
        working-directory: Stockfish/src
        shell: bash
    steps:
      - name: Checkout Stockfish
        uses: actions/checkout@v4
        with:
          path: Stockfish
          persist-credentials: false
      - name: Checkout include-what-you-use
        uses: actions/checkout@v4
        with:
          repository: include-what-you-use/include-what-you-use
          ref: f25caa280dc3277c4086ec345ad279a2463fea0f
          path: include-what-you-use
          persist-credentials: false
      - name: Download required linux packages
        run: |
          sudo add-apt-repository 'deb http://apt.llvm.org/jammy/ llvm-toolchain-jammy-17 main'
          wget -O - https://apt.llvm.org/llvm-snapshot.gpg.key | sudo apt-key add -
          sudo apt update
          sudo apt install -y libclang-17-dev clang-17 libc++-17-dev
      - name: Set up include-what-you-use
        run: |
          mkdir build && cd build
          cmake -G "Unix Makefiles" -DCMAKE_PREFIX_PATH="/usr/lib/llvm-17" ..
          sudo make install
        working-directory: include-what-you-use
      - name: Check include-what-you-use
        run: include-what-you-use --version
      - name: Check includes
        run: >
          make analyze
          COMP=clang
          CXX=include-what-you-use
          CXXFLAGS="-stdlib=libc++ -Xiwyu --comment_style=long -Xiwyu --mapping='${{ github.workspace }}/Stockfish/.github/ci/libcxx17.imp' -Xiwyu --error"
@@ -1,71 +0,0 @@
 # This workflow will run matetrack on the PR
 name: Matetrack
 on:
  workflow_call:
 jobs:
  Matetrack:
    name: Matetrack
    runs-on: ubuntu-22.04
    steps:
      - name: Checkout SF repo 
        uses: actions/checkout@v4
        with:
          ref: ${{ github.event.pull_request.head.sha }}
          path: Stockfish
          persist-credentials: false
      - name: build SF
        working-directory: Stockfish/src
        run: make -j profile-build
      - name: Checkout matetrack repo
        uses: actions/checkout@v4
        with:
          repository: vondele/matetrack
          path: matetrack
          ref: 4f8a80860ed8f3607f05a9195df8b40203bdc360
          persist-credentials: false
      - name: matetrack install deps
        working-directory: matetrack
        run: pip install -r requirements.txt
      - name: cache syzygy
        id: cache-syzygy
        uses: actions/cache@v4
        with:
           path: |
              matetrack/3-4-5-wdl/
              matetrack/3-4-5-dtz/
           key: key-syzygy
      - name: download syzygy 3-4-5 if needed
        working-directory: matetrack
        if: steps.cache-syzygy.outputs.cache-hit != 'true'
        run: |
          wget --no-verbose -r -nH --cut-dirs=2 --no-parent --reject="index.html*" -e robots=off https://tablebase.lichess.ovh/tables/standard/3-4-5-wdl/
          wget --no-verbose -r -nH --cut-dirs=2 --no-parent --reject="index.html*" -e robots=off https://tablebase.lichess.ovh/tables/standard/3-4-5-dtz/
      - name: Run matetrack
        working-directory: matetrack
        run: |
          python matecheck.py --syzygyPath 3-4-5-wdl/:3-4-5-dtz/ --engine /home/runner/work/Stockfish/Stockfish/Stockfish/src/stockfish --epdFile mates2000.epd --nodes 100000 | tee matecheckout.out
          ! grep "issues were detected" matecheckout.out > /dev/null
      - name: Run matetrack with --syzygy50MoveRule false
        working-directory: matetrack
        run: |
          grep 5men cursed.epd > cursed5.epd
          python matecheck.py --syzygyPath 3-4-5-wdl/:3-4-5-dtz/ --engine /home/runner/work/Stockfish/Stockfish/Stockfish/src/stockfish --epdFile cursed5.epd --nodes 100000 --syzygy50MoveRule false | tee matecheckcursed.out
          ! grep "issues were detected" matecheckcursed.out > /dev/null
      - name: Verify mate and TB win count for matecheckcursed.out
        working-directory: matetrack
        run: |
          mates=$(grep "Found mates:" matecheckcursed.out | awk '{print $3}')
          tbwins=$(grep "Found TB wins:" matecheckcursed.out | awk '{print $4}')
          if [ $(($mates + $tbwins)) -ne 32 ]; then
            echo "Sum of mates and TB wins is not 32 in matecheckcursed.out" >&2
            exit 1
          fi
@@ -1,87 +0,0 @@
 name: Sanitizers
 on:
  workflow_call:
 jobs:
  Test-under-sanitizers:
    name: ${{ matrix.sanitizers.name }}
    runs-on: ${{ matrix.config.os }}
    env:
      COMPCXX: ${{ matrix.config.compiler }}
      COMP: ${{ matrix.config.comp }}
      CXXFLAGS: "-Werror"
    strategy:
      fail-fast: false
      matrix:
        config:
          - name: Ubuntu 22.04 GCC
            os: ubuntu-22.04
            compiler: g++
            comp: gcc
            shell: bash
        sanitizers:
          - name: Run with thread sanitizer
            make_option: sanitize=thread
            cxx_extra_flags: ""
            instrumented_option: sanitizer-thread
          - name: Run with UB sanitizer
            make_option: sanitize=undefined
            cxx_extra_flags: ""
            instrumented_option: sanitizer-undefined
          - name: Run under valgrind
            make_option: ""
            cxx_extra_flags: ""
            instrumented_option: valgrind
          - name: Run under valgrind-thread
            make_option: ""
            cxx_extra_flags: ""
            instrumented_option: valgrind-thread
          - name: Run non-instrumented
            make_option: ""
            cxx_extra_flags: ""
            instrumented_option: none
          - name: Run with glibcxx assertions
            make_option: ""
            cxx_extra_flags: -D_GLIBCXX_ASSERTIONS
            instrumented_option: non
    defaults:
      run:
        working-directory: src
        shell: ${{ matrix.config.shell }}
    steps:
      - uses: actions/checkout@v4
        with:
          persist-credentials: false
      - name: Download required linux packages
        run: |
          sudo apt update
          sudo apt install expect valgrind g++-multilib
      - name: Download the used network from the fishtest framework
        run: make net
      - name: Check compiler
        run: $COMPCXX -v
      - name: Test help target
        run: make help
      - name: Check git
        run: git --version
      # Since Linux Kernel 6.5 we are getting false positives from the ci,
      # lower the ALSR entropy to disable ALSR, which works as a temporary workaround.
      # https://github.com/google/sanitizers/issues/1716
      # https://bugs.launchpad.net/ubuntu/+source/linux/+bug/2056762
      - name: Lower ALSR entropy
        run: sudo sysctl -w vm.mmap_rnd_bits=28
      # Sanitizers
      - name: ${{ matrix.sanitizers.name }}
        run: |
          export CXXFLAGS="-O1 -fno-inline ${{ matrix.sanitizers.cxx_extra_flags }}"
          make clean
          make -j4 ARCH=x86-64-sse41-popcnt ${{ matrix.sanitizers.make_option }} debug=yes optimize=no build > /dev/null
          python3 ../tests/instrumented.py --${{ matrix.sanitizers.instrumented_option }} ./stockfish
@@ -1,122 +1,260 @@
 name: Stockfish
 on:
  push:
    tags:
      - "*"
    branches:
      - master
      - tools
      - github_ci
      - github_ci_armv7
  pull_request:
    branches:
      - master
      - tools
 jobs:
-  Prerelease:
+  Stockfish:
-    if: github.repository == 'official-stockfish/Stockfish' && (github.ref == 'refs/heads/master' || (startsWith(github.ref_name, 'sf_') && github.ref_type == 'tag'))
+    name: ${{ matrix.config.name }}
-    runs-on: ubuntu-latest
+    runs-on: ${{ matrix.config.os }}
-    permissions:
+    env:
-      contents: write # For deleting/creating a prerelease
+      COMPILER: ${{ matrix.config.compiler }}
      COMP: ${{ matrix.config.comp }}
    strategy:
      matrix:
        config:
          # set the variable for the required tests:
          # run_expensive_tests: true
          # run_32bit_tests: true
          # run_64bit_tests: true
          - {
              name: "Ubuntu 20.04 GCC",
              os: ubuntu-20.04,
              compiler: g++,
              comp: gcc,
              run_expensive_tests: true,
              run_64bit_tests: true,
              shell: 'bash {0}'
            }
          - {
              name: "Ubuntu 20.04 Clang",
              os: ubuntu-20.04,
              compiler: clang++,
              comp: clang,
              run_64bit_tests: true,
              shell: 'bash {0}'
            }
          - {
              name: "MacOS 10.15 Apple Clang",
              os: macos-10.15,
              compiler: clang++,
              comp: clang,
              run_64bit_tests: true,
              shell: 'bash {0}'
            }
          - {
              name: "MacOS 10.15 GCC 10",
              os: macos-10.15,
              compiler: g++-10,
              comp: gcc,
              run_64bit_tests: true,
              shell: 'bash {0}'
            }
          - {
              name: "Windows 2022 Mingw-w64 GCC x86_64",
              os: windows-2022,
              compiler: g++,
              comp: mingw,
              run_64bit_tests: true,
              msys_sys: 'mingw64',
              msys_env: 'x86_64-gcc',
              shell: 'msys2 {0}'
            }
    defaults:
      run:
        working-directory: src
        shell: ${{ matrix.config.shell }}
    steps:
-      - uses: actions/checkout@v4
+      - uses: actions/checkout@v2
        with:
-          persist-credentials: false
+          fetch-depth: 0
-      # returns null if no pre-release exists
+      - name: Download required linux packages
-      - name: Get Commit SHA of Latest Pre-release
+        if: runner.os == 'Linux'
        run: |
-          # Install required packages
+          sudo apt update
-          sudo apt-get update
+          sudo apt install expect valgrind g++-multilib
          sudo apt-get install -y curl jq
-          echo "COMMIT_SHA_TAG=$(jq -r 'map(select(.prerelease)) | first | .tag_name' <<< $(curl -s https://api.github.com/repos/${{ github.repository_owner }}/Stockfish/releases))" >> $GITHUB_ENV
+      - name: Setup msys and install required packages
-
+        if: runner.os == 'Windows'
-      # delete old previous pre-release and tag
+        uses: msys2/setup-msys2@v2
      - run: gh release delete ${{ env.COMMIT_SHA_TAG }} --cleanup-tag
        if: env.COMMIT_SHA_TAG != 'null'
        env:
          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
      # Make sure that an old ci that still runs on master doesn't recreate a prerelease
      - name: Check Pullable Commits
        id: check_commits
        run: |
          git fetch
          CHANGES=$(git rev-list HEAD..origin/master --count)
          echo "CHANGES=$CHANGES" >> $GITHUB_ENV
      - name: Get last commit SHA
        id: last_commit
        run: echo "COMMIT_SHA=$(git rev-parse HEAD | cut -c 1-8)" >> $GITHUB_ENV
      - name: Get commit date
        id: commit_date
        run: echo "COMMIT_DATE=$(git show -s --date=format:'%Y%m%d' --format=%cd HEAD)" >> $GITHUB_ENV
      # Create a new pre-release, the other upload_binaries.yml will upload the binaries
      # to this pre-release.
      - name: Create Prerelease
        if: github.ref_name == 'master' && env.CHANGES == '0'
        uses: softprops/action-gh-release@4634c16e79c963813287e889244c50009e7f0981
        with:
-          name: Stockfish dev-${{ env.COMMIT_DATE }}-${{ env.COMMIT_SHA }}
+          msystem: ${{matrix.config.msys_sys}}
-          tag_name: stockfish-dev-${{ env.COMMIT_DATE }}-${{ env.COMMIT_SHA }}
+          install: mingw-w64-${{matrix.config.msys_env}} make git expect
          prerelease: true
-  Matrix:
+      - name: Download the used network from the fishtest framework
    runs-on: ubuntu-latest
    outputs:
      matrix: ${{ steps.set-matrix.outputs.matrix }}
      arm_matrix: ${{ steps.set-arm-matrix.outputs.arm_matrix }}
    steps:
      - uses: actions/checkout@v4
        with:
          persist-credentials: false
      - id: set-matrix
        run: |
-          TASKS=$(echo $(cat .github/ci/matrix.json) )
+          make net
-          echo "MATRIX=$TASKS" >> $GITHUB_OUTPUT
+
-      - id: set-arm-matrix
+      - name: Extract the bench number from the commit history
        run: |
-          TASKS_ARM=$(echo $(cat .github/ci/arm_matrix.json) )
+          git log HEAD | grep "\b[Bb]ench[ :]\+[0-9]\{7\}" | head -n 1 | sed "s/[^0-9]*\([0-9]*\).*/\1/g" > git_sig
-          echo "ARM_MATRIX=$TASKS_ARM" >> $GITHUB_OUTPUT
+          [ -s git_sig ] && echo "benchref=$(cat git_sig)" >> $GITHUB_ENV && echo "Reference bench:" $(cat git_sig) || echo "No bench found"
-  Compilation:
+
-    needs: [Matrix]
+      - name: Check compiler
-    uses: ./.github/workflows/compilation.yml
+        run: |
-    with:
+          $COMPILER -v
-      matrix: ${{ needs.Matrix.outputs.matrix }}
+
-  ARMCompilation:
+      - name: Test help target
-    needs: [Matrix]
+        run: |
-    uses: ./.github/workflows/arm_compilation.yml
+          make help
-    with:
+
-      matrix: ${{ needs.Matrix.outputs.arm_matrix }}
+      # x86-32 tests
-  IWYU:
+
-    uses: ./.github/workflows/iwyu.yml
+      - name: Test debug x86-32 build
-  Sanitizers:
+        if: ${{ matrix.config.run_32bit_tests }}
-    uses: ./.github/workflows/sanitizers.yml
+        run: |
-  Tests:
+          export CXXFLAGS="-D_GLIBCXX_DEBUG"
-    uses: ./.github/workflows/tests.yml
+          make clean
-  Matetrack:
+          make -j2 ARCH=x86-32 optimize=no debug=yes build
-    uses: ./.github/workflows/matetrack.yml
+          ../tests/signature.sh $benchref
-  Games:
+
-    uses: ./.github/workflows/games.yml
+      - name: Test x86-32 build
-  Binaries:
+        if: ${{ matrix.config.run_32bit_tests }}
-    if: github.repository == 'official-stockfish/Stockfish'
+        run: |
-    needs: [Matrix, Prerelease, Compilation]
+          make clean
-    uses: ./.github/workflows/upload_binaries.yml
+          make -j2 ARCH=x86-32 build
-    with:
+          ../tests/signature.sh $benchref
-      matrix: ${{ needs.Matrix.outputs.matrix }}
+
-    permissions:
+      - name: Test x86-32-sse41-popcnt build
-      contents: write # For deleting/creating a (pre)release
+        if: ${{ matrix.config.run_32bit_tests }}
-    secrets:
+        run: |
-      token: ${{ secrets.GITHUB_TOKEN }}
+          make clean
-  ARM_Binaries:
+          make -j2 ARCH=x86-32-sse41-popcnt build
-    if: github.repository == 'official-stockfish/Stockfish'
+          ../tests/signature.sh $benchref
-    needs: [Matrix, Prerelease, ARMCompilation]
+
-    uses: ./.github/workflows/upload_binaries.yml
+      - name: Test x86-32-sse2 build
-    with:
+        if: ${{ matrix.config.run_32bit_tests }}
-      matrix: ${{ needs.Matrix.outputs.arm_matrix }}
+        run: |
-    permissions:
+          make clean
-      contents: write # For deleting/creating a (pre)release
+          make -j2 ARCH=x86-32-sse2 build
-    secrets:
+          ../tests/signature.sh $benchref
-      token: ${{ secrets.GITHUB_TOKEN }}
+
      - name: Test general-32 build
        if: ${{ matrix.config.run_32bit_tests }}
        run: |
          make clean
          make -j2 ARCH=general-32 build
          ../tests/signature.sh $benchref
      # x86-64 tests
      - name: Test debug x86-64-modern build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          export CXXFLAGS="-D_GLIBCXX_DEBUG"
          make clean
          make -j2 ARCH=x86-64-modern optimize=no debug=yes build
          ../tests/signature.sh $benchref
      - name: Test x86-64-modern build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-modern build
          ../tests/signature.sh $benchref
      - name: Test x86-64-ssse3 build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-ssse3 build
          ../tests/signature.sh $benchref
      - name: Test x86-64-sse3-popcnt build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-sse3-popcnt build
          ../tests/signature.sh $benchref
      - name: Test x86-64 build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64 build
          ../tests/signature.sh $benchref
      - name: Test general-64 build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j2 ARCH=general-64 build
          ../tests/signature.sh $benchref
      # x86-64 with newer extensions tests
      - name: Compile x86-64-avx2 build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-avx2 build
      - name: Compile x86-64-bmi2 build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-bmi2 build
      - name: Compile x86-64-avx512 build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-avx512 build
      - name: Compile x86-64-vnni512 build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-vnni512 build
      - name: Compile x86-64-vnni256 build
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-vnni256 build
      # Other tests
      - name: Check perft and search reproducibility
        if: ${{ matrix.config.run_64bit_tests }}
        run: |
          make clean
          make -j2 ARCH=x86-64-modern build
          ../tests/perft.sh
          ../tests/reprosearch.sh
      # Sanitizers
      - name: Run under valgrind
        if: ${{ matrix.config.run_expensive_tests }}
        run: |
          export CXXFLAGS="-O1 -fno-inline"
          make clean
          make -j2 ARCH=x86-64-modern debug=yes optimize=no build > /dev/null
          ../tests/instrumented.sh --valgrind
          ../tests/instrumented.sh --valgrind-thread
      - name: Run with UB sanitizer
        if: ${{ matrix.config.run_expensive_tests }}
        run: |
          export CXXFLAGS="-O1 -fno-inline"
          make clean
          make -j2 ARCH=x86-64-modern sanitize=undefined optimize=no debug=yes build > /dev/null
          ../tests/instrumented.sh --sanitizer-undefined
      - name: Run with thread sanitizer
        if: ${{ matrix.config.run_expensive_tests }}
        run: |
          export CXXFLAGS="-O1 -fno-inline"
          make clean
          make -j2 ARCH=x86-64-modern sanitize=thread optimize=no debug=yes build > /dev/null
          ../tests/instrumented.sh --sanitizer-thread
@@ -1,366 +0,0 @@
 name: Tests
 on:
  workflow_call:
 jobs:
  Test-Targets:
    name: ${{ matrix.config.name }}
    runs-on: ${{ matrix.config.os }}
    env:
      COMPCXX: ${{ matrix.config.compiler }}
      COMP: ${{ matrix.config.comp }}
      CXXFLAGS: "-Werror"
    strategy:
      fail-fast: false
      matrix:
        config:
          - name: Ubuntu 22.04 GCC
            os: ubuntu-22.04
            compiler: g++
            comp: gcc
            run_32bit_tests: true
            run_64bit_tests: true
            shell: bash
          - name: Ubuntu 22.04 Clang
            os: ubuntu-22.04
            compiler: clang++
            comp: clang
            run_32bit_tests: true
            run_64bit_tests: true
            shell: bash
          - name: Android NDK aarch64
            os: ubuntu-22.04
            compiler: aarch64-linux-android21-clang++
            comp: ndk
            run_armv8_tests: true
            shell: bash
          - name: Android NDK arm
            os: ubuntu-22.04
            compiler: armv7a-linux-androideabi21-clang++
            comp: ndk
            run_armv7_tests: true
            shell: bash
          - name: Linux GCC riscv64
            os: ubuntu-22.04
            compiler: g++
            comp: gcc
            run_riscv64_tests: true
            base_image: "riscv64/alpine:edge"
            platform: linux/riscv64
            shell: bash
          - name: Linux GCC ppc64
            os: ubuntu-22.04
            compiler: g++
            comp: gcc
            run_ppc64_tests: true
            base_image: "ppc64le/alpine:latest"
            platform: linux/ppc64le
            shell: bash
          - name: MacOS 13 Apple Clang
            os: macos-13
            compiler: clang++
            comp: clang
            run_64bit_tests: true
            shell: bash
          - name: MacOS 14 Apple Clang M1
            os: macos-14
            compiler: clang++
            comp: clang
            run_64bit_tests: false
            run_m1_tests: true
            shell: bash
          - name: MacOS 13 GCC 11
            os: macos-13
            compiler: g++-11
            comp: gcc
            run_64bit_tests: true
            shell: bash
          - name: Windows 2022 Mingw-w64 GCC x86_64
            os: windows-2022
            compiler: g++
            comp: mingw
            run_64bit_tests: true
            msys_sys: mingw64
            msys_env: x86_64-gcc
            shell: msys2 {0}
          - name: Windows 2022 Mingw-w64 GCC i686
            os: windows-2022
            compiler: g++
            comp: mingw
            run_32bit_tests: true
            msys_sys: mingw32
            msys_env: i686-gcc
            shell: msys2 {0}
          - name: Windows 2022 Mingw-w64 Clang x86_64
            os: windows-2022
            compiler: clang++
            comp: clang
            run_64bit_tests: true
            msys_sys: clang64
            msys_env: clang-x86_64-clang
            shell: msys2 {0}
    defaults:
      run:
        working-directory: src
        shell: ${{ matrix.config.shell }}
    steps:
      - uses: actions/checkout@v4
        with:
          fetch-depth: 0
          persist-credentials: false
      - name: Download required linux packages
        if: runner.os == 'Linux'
        run: |
          sudo apt update
          sudo apt install expect valgrind g++-multilib qemu-user-static
      - name: Install NDK
        if: runner.os == 'Linux'
        run: |
          if [ $COMP == ndk ]; then
            NDKV="21.4.7075529"
            ANDROID_ROOT=/usr/local/lib/android
            ANDROID_SDK_ROOT=$ANDROID_ROOT/sdk
            SDKMANAGER=$ANDROID_SDK_ROOT/cmdline-tools/latest/bin/sdkmanager
            echo "y" | $SDKMANAGER "ndk;$NDKV"
            ANDROID_NDK_ROOT=$ANDROID_SDK_ROOT/ndk/$NDKV
            ANDROID_NDK_BIN=$ANDROID_NDK_ROOT/toolchains/llvm/prebuilt/linux-x86_64/bin
            echo "ANDROID_NDK_BIN=$ANDROID_NDK_BIN" >> $GITHUB_ENV
          fi
      - name: Set up QEMU
        if: matrix.config.base_image
        uses: docker/setup-qemu-action@v3
      - name: Set up Docker Buildx
        if: matrix.config.base_image
        uses: docker/setup-buildx-action@v3
      - name: Build Docker container
        if: matrix.config.base_image
        run: |
          docker buildx build --platform ${{ matrix.config.platform }} --load -t sf_builder - << EOF
          FROM ${{ matrix.config.base_image }}
          WORKDIR /app
          RUN apk update && apk add make g++
          CMD ["sh", "src/script.sh"]
          EOF
      - name: Download required macOS packages
        if: runner.os == 'macOS'
        run: brew install coreutils gcc@11
      - name: Setup msys and install required packages
        if: runner.os == 'Windows'
        uses: msys2/setup-msys2@v2
        with:
          msystem: ${{ matrix.config.msys_sys }}
          install: mingw-w64-${{ matrix.config.msys_env }} make git expect
      - name: Download the used network from the fishtest framework
        run: make net
      - name: Extract the bench number from the commit history
        run: |
          for hash in $(git rev-list -100 HEAD); do
            benchref=$(git show -s $hash | tac | grep -m 1 -o -x '[[:space:]]*\b[Bb]ench[ :]\+[1-9][0-9]\{5,7\}\b[[:space:]]*' | sed 's/[^0-9]//g') && break || true
          done
          [[ -n "$benchref" ]] && echo "benchref=$benchref" >> $GITHUB_ENV && echo "From commit: $hash" && echo "Reference bench: $benchref" || echo "No bench found"
      - name: Check compiler
        run: |
          if [ -z "${{ matrix.config.base_image }}" ]; then
            if [ $COMP == ndk ]; then
              export PATH=${{ env.ANDROID_NDK_BIN }}:$PATH
            fi
            $COMPCXX -v
          else
            echo "$COMPCXX -v" > script.sh
            docker run --rm --platform ${{ matrix.config.platform }} -v ${{ github.workspace }}:/app sf_builder
          fi
      - name: Test help target
        run: make help
      - name: Check git
        run: git --version
      # x86-32 tests
      - name: Test debug x86-32 build
        if: matrix.config.run_32bit_tests
        run: |
          export CXXFLAGS="-Werror -D_GLIBCXX_DEBUG"
          make clean
          make -j4 ARCH=x86-32 optimize=no debug=yes build
          ../tests/signature.sh $benchref
      - name: Test x86-32 build
        if: matrix.config.run_32bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-32 build
          ../tests/signature.sh $benchref
      - name: Test x86-32-sse41-popcnt build
        if: matrix.config.run_32bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-32-sse41-popcnt build
          ../tests/signature.sh $benchref
      - name: Test x86-32-sse2 build
        if: matrix.config.run_32bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-32-sse2 build
          ../tests/signature.sh $benchref
      - name: Test general-32 build
        if: matrix.config.run_32bit_tests
        run: |
          make clean
          make -j4 ARCH=general-32 build
          ../tests/signature.sh $benchref
      # x86-64 tests
      - name: Test debug x86-64-avx2 build
        if: matrix.config.run_64bit_tests
        run: |
          export CXXFLAGS="-Werror -D_GLIBCXX_DEBUG"
          make clean
          make -j4 ARCH=x86-64-avx2 optimize=no debug=yes build
          ../tests/signature.sh $benchref
      - name: Test x86-64-bmi2 build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-64-bmi2 build
          ../tests/signature.sh $benchref
      - name: Test x86-64-avx2 build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-64-avx2 build
          ../tests/signature.sh $benchref
      # Test a deprecated arch
      - name: Test x86-64-modern build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-64-modern build
          ../tests/signature.sh $benchref
      - name: Test x86-64-sse41-popcnt build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-64-sse41-popcnt build
          ../tests/signature.sh $benchref
      - name: Test x86-64-ssse3 build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-64-ssse3 build
          ../tests/signature.sh $benchref
      - name: Test x86-64-sse3-popcnt build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-64-sse3-popcnt build
          ../tests/signature.sh $benchref
      - name: Test x86-64 build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-64 build
          ../tests/signature.sh $benchref
      - name: Test general-64 build
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=general-64 build
          ../tests/signature.sh $benchref
      - name: Test apple-silicon build
        if: matrix.config.run_m1_tests
        run: |
          make clean
          make -j4 ARCH=apple-silicon build
          ../tests/signature.sh $benchref
      # armv8 tests
      - name: Test armv8 build
        if: matrix.config.run_armv8_tests
        run: |
          export PATH=${{ env.ANDROID_NDK_BIN }}:$PATH
          export LDFLAGS="-static -Wno-unused-command-line-argument"
          make clean
          make -j4 ARCH=armv8 build
          ../tests/signature.sh $benchref
      - name: Test armv8-dotprod build
        if: matrix.config.run_armv8_tests
        run: |
          export PATH=${{ env.ANDROID_NDK_BIN }}:$PATH
          export LDFLAGS="-static -Wno-unused-command-line-argument"
          make clean
          make -j4 ARCH=armv8-dotprod build
          ../tests/signature.sh $benchref
      # armv7 tests
      - name: Test armv7 build
        if: matrix.config.run_armv7_tests
        run: |
          export PATH=${{ env.ANDROID_NDK_BIN }}:$PATH
          export LDFLAGS="-static -Wno-unused-command-line-argument"
          make clean
          make -j4 ARCH=armv7 build
          ../tests/signature.sh $benchref
      - name: Test armv7-neon build
        if: matrix.config.run_armv7_tests
        run: |
          export PATH=${{ env.ANDROID_NDK_BIN }}:$PATH
          export LDFLAGS="-static -Wno-unused-command-line-argument"
          make clean
          make -j4 ARCH=armv7-neon build
          ../tests/signature.sh $benchref
      # riscv64 tests
      - name: Test riscv64 build
        if: matrix.config.run_riscv64_tests
        run: |
          echo "cd src && export LDFLAGS='-static' && make clean && make -j4 ARCH=riscv64 build" > script.sh
          docker run --rm --platform ${{ matrix.config.platform }} -v ${{ github.workspace }}:/app sf_builder
          ../tests/signature.sh $benchref
      # ppc64 tests
      - name: Test ppc64 build
        if: matrix.config.run_ppc64_tests
        run: |
          echo "cd src && export LDFLAGS='-static' && make clean && make -j4 ARCH=ppc-64 build" > script.sh
          docker run --rm --platform ${{ matrix.config.platform }} -v ${{ github.workspace }}:/app sf_builder
          ../tests/signature.sh $benchref
      # Other tests
      - name: Check perft and search reproducibility
        if: matrix.config.run_64bit_tests
        run: |
          make clean
          make -j4 ARCH=x86-64-avx2 build
          ../tests/perft.sh
          ../tests/reprosearch.sh
@@ -1,114 +0,0 @@
 name: Upload Binaries
 on:
  workflow_call:
    inputs:
      matrix:
        type: string
        required: true
    secrets:
      token:
        required: true
 jobs:
  Artifacts:
    name: ${{ matrix.config.name }} ${{ matrix.binaries }}
    runs-on: ${{ matrix.config.os }}
    env:
      COMPCXX: ${{ matrix.config.compiler }}
      COMP: ${{ matrix.config.comp }}
      EXT: ${{ matrix.config.ext }}
      NAME: ${{ matrix.config.simple_name }}
      BINARY: ${{ matrix.binaries }}
      SDE: ${{ matrix.config.sde }}
    strategy:
      fail-fast: false
      matrix: ${{ fromJson(inputs.matrix) }}
    defaults:
      run:
        shell: ${{ matrix.config.shell }}
    steps:
      - uses: actions/checkout@v4
        with:
          persist-credentials: false
      - name: Download artifact from compilation
        uses: actions/download-artifact@v4
        with:
          name: ${{ matrix.config.simple_name }} ${{ matrix.binaries }}
          path: ${{ matrix.config.simple_name }} ${{ matrix.binaries }}
      - name: Setup msys and install required packages
        if: runner.os == 'Windows'
        uses: msys2/setup-msys2@v2
        with:
          msystem: ${{ matrix.config.msys_sys }}
          install: mingw-w64-${{ matrix.config.msys_env }} make git zip
      - name: Create Package
        run: |
          mkdir stockfish
      - name: Download wiki
        run: |
          git clone https://github.com/official-stockfish/Stockfish.wiki.git wiki
          rm -rf wiki/.git
          mv wiki stockfish/
      - name: Copy files
        run: |
          mv "${{ matrix.config.simple_name }} ${{ matrix.binaries }}" stockfish-workflow
          cd stockfish-workflow
          cp -r src ../stockfish/
          cp -r scripts ../stockfish/
          cp stockfish-$NAME-$BINARY$EXT ../stockfish/
          cp "Top CPU Contributors.txt" ../stockfish/
          cp Copying.txt ../stockfish/
          cp AUTHORS ../stockfish/
          cp CITATION.cff ../stockfish/
          cp README.md ../stockfish/
          cp CONTRIBUTING.md ../stockfish/
      - name: Create tar
        if: runner.os != 'Windows'
        run: |
          chmod +x ./stockfish/stockfish-$NAME-$BINARY$EXT
          tar -cvf stockfish-$NAME-$BINARY.tar stockfish
      - name: Create zip
        if: runner.os == 'Windows'
        run: |
          zip -r stockfish-$NAME-$BINARY.zip stockfish
      - name: Release
        if: startsWith(github.ref_name, 'sf_') && github.ref_type == 'tag'
        uses: softprops/action-gh-release@4634c16e79c963813287e889244c50009e7f0981
        with:
          files: stockfish-${{ matrix.config.simple_name }}-${{ matrix.binaries }}.${{ matrix.config.archive_ext }}
          token: ${{ secrets.token }}
      - name: Get last commit sha
        id: last_commit
        run: echo "COMMIT_SHA=$(git rev-parse HEAD | cut -c 1-8)" >> $GITHUB_ENV
      - name: Get commit date
        id: commit_date
        run: echo "COMMIT_DATE=$(git show -s --date=format:'%Y%m%d' --format=%cd HEAD)" >> $GITHUB_ENV
      # Make sure that an old ci that still runs on master doesn't recreate a prerelease
      - name: Check Pullable Commits
        id: check_commits
        run: |
          git fetch
          CHANGES=$(git rev-list HEAD..origin/master --count)
          echo "CHANGES=$CHANGES" >> $GITHUB_ENV
      - name: Prerelease
        if: github.ref_name == 'master' && env.CHANGES == '0'
        continue-on-error: true
        uses: softprops/action-gh-release@4634c16e79c963813287e889244c50009e7f0981
        with:
          name: Stockfish dev-${{ env.COMMIT_DATE }}-${{ env.COMMIT_SHA }}
          tag_name: stockfish-dev-${{ env.COMMIT_DATE }}-${{ env.COMMIT_SHA }}
          prerelease: true
          files: stockfish-${{ matrix.config.simple_name }}-${{ matrix.binaries }}.${{ matrix.config.archive_ext }}
          token: ${{ secrets.token }}
@@ -10,8 +10,3 @@ src/-lstdc++.res
 # Neural network for the NNUE evaluation
 **/*.nnue
 # Files generated by the instrumented tests
 tsan.supp
 __pycache__/
 tests/syzygy
 tests/bench_tmp.epd
@@ -1,18 +1,19 @@
-# Founders of the Stockfish project and Fishtest infrastructure
+# List of authors for Stockfish
 # Founders of the Stockfish project and fishtest infrastructure
 Tord Romstad (romstad)
 Marco Costalba (mcostalba)
 Joona Kiiski (zamar)
 Gary Linscott (glinscott)
-# Authors and inventors of NNUE, training, and NNUE port
+# Authors and inventors of NNUE, training, NNUE port
 Yu Nasu (ynasu87)
 Motohiro Isozaki (yaneurao)
 Hisayori Noda (nodchip)
-# All other authors of Stockfish code (in alphabetical order)
+# all other authors of the code in alphabetical order
 Aditya (absimaldata)
 Adrian Petrescu (apetresc)
 Ahmed Kerimov (wcdbmv)
 Ajith Chandy Jose (ajithcj)
 Alain Savard (Rocky640)
 Alayan Feh (Alayan-stk-2)
@@ -20,8 +21,6 @@ Alexander Kure
 Alexander Pagel (Lolligerhans)
 Alfredo Menezes (lonfom169)
 Ali AlZhrani (Cooffe)
 Andreas Jan van der Meulen (Andyson007)
 Andreas Matthies (Matthies)
 Andrei Vetrov (proukornew)
 Andrew Grant (AndyGrant)
 Andrey Neporada (nepal)
@@ -31,35 +30,23 @@ Aram Tumanian (atumanian)
 Arjun Temurnikar
 Artem Solopiy (EntityFX)
 Auguste Pop
 Balazs Szilagyi
 Balint Pfliegel
 Ben Chaney (Chaneybenjamini)
 Ben Koshy (BKSpurgeon)
 Bill Henry (VoyagerOne)
 Bojun Guo (noobpwnftw, Nooby)
 borg323
 Boštjan Mejak (PedanticHacker)
 braich
 Brian Sheppard (SapphireBrand, briansheppard-toast)
 Bruno de Melo Costa (BM123499)
 Bruno Pellanda (pellanda)
 Bryan Cross (crossbr)
 candirufish
 Carlos Esparza Sánchez (ces42)
 Chess13234
 Chris Bao (sscg13)
 Chris Cain (ceebo)
 Ciekce
 clefrks
 Clemens L. (rn5f107s2)
 Cody Ho (aesrentai)
 Dale Weiler (graphitemaster)
 Dan Schmidt (dfannius)
 Daniel Axtens (daxtens)
 Daniel Dugovic (ddugovic)
 Daniel Monroe (Ergodice)
 Dan Schmidt (dfannius)
 Dariusz Orzechowski (dorzechowski)
 David (dav1312)
 David Zar
 Daylen Yang (daylen)
 Deshawn Mohan-Smith (GoldenRare)
@@ -71,72 +58,61 @@ Douglas Matos Gomes (dsmsgms)
 Dubslow
 Eduardo Cáceres (eduherminio)
 Eelco de Groot (KingDefender)
 Ehsan Rashid (erashid)
 Elvin Liu (solarlight2)
 erbsenzaehler
 Ernesto Gatti
-evqsx
+Linmiao Xu (linrock)
 Fabian Beuke (madnight)
 Fabian Fichter (ianfab)
 Fanael Linithien (Fanael)
 fanon
-Fauzi Akram Dabat (fauzi2)
+Fauzi Akram Dabat (FauziAkram)
 Felix Wittmann
 gamander
 Gabriele Lombardo (gabe)
 Gahtan Nahdi
 Gary Heckman (gheckman)
 George Sobala (gsobala)
 gguliash
 Giacomo Lorenzetti (G-Lorenz)
 Gian-Carlo Pascutto (gcp)
 Goh CJ (cj5716)
 Gontran Lemaire (gonlem)
 Goodkov Vasiliy Aleksandrovich (goodkov)
 Gregor Cramer
 GuardianRM
 Guy Vreuls (gvreuls)
 Günther Demetz (pb00067, pb00068)
 Guy Vreuls (gvreuls)
 Henri Wiechers
 Hiraoka Takuya (HiraokaTakuya)
 homoSapiensSapiens
 Hongzhi Cheng
 Ivan Ivec (IIvec)
 Jacques B. (Timshel)
 Jake Senne (w1wwwwww)
 Jan Ondruš (hxim)
-Jared Kish (Kurtbusch, kurt22i)
+Jared Kish (Kurtbusch)
 Jarrod Torriero (DU-jdto)
 Jasper Shovelton (Beanie496)
 Jean-Francois Romang (jromang)
 Jean Gauthier (OuaisBla)
 Jean-Francois Romang (jromang)
 Jekaa
 Jerry Donald Watson (jerrydonaldwatson)
 jjoshua2
 Jonathan Buladas Dumale (SFisGOD)
 Jonathan Calovski (Mysseno)
-Jonathan McDermid (jonathanmcdermid)
+Jonathan Buladas Dumale (SFisGOD)
 Joost VandeVondele (vondele)
 Jörg Oster (joergoster)
 Joseph Ellis (jhellis3)
 Joseph R. Prostko
 Jörg Oster (joergoster)
 Julian Willemer (NightlyKing)
 jundery
 Justin Blanchard (UncombedCoconut)
 Kelly Wilson
 Ken Takusagawa
 Kenneth Lee (kennethlee33)
 Kian E (KJE-98)
 kinderchocolate
 Kiran Panditrao (Krgp)
 Kojirion
 Krisztián Peőcz
 Krystian Kuzniarek (kuzkry)
 Leonardo Ljubičić (ICCF World Champion)
 Leonid Pechenik (lp--)
 Li Ying (yl25946)
 Liam Keegan (lkeegan)
 Linmiao Xu (linrock)
 Linus Arver (listx)
 loco-loco
 Lub van den Berg (ElbertoOne)
@@ -147,12 +123,10 @@ Maciej Żenczykowski (zenczykowski)
 Malcolm Campbell (xoto10)
 Mark Tenzer (31m059)
 marotear
 Mathias Parnaudeau (mparnaudeau)
 Matt Ginsberg (mattginsberg)
 Matthew Lai (matthewlai)
 Matthew Sullivan (Matt14916)
 Max A. (Disservin)
 Maxim Masiutin (maximmasiutin)
 Maxim Molchanov (Maxim)
 Michael An (man)
 Michael Byrne (MichaelB7)
@@ -167,42 +141,35 @@ Mira
 Miroslav Fontán (Hexik)
 Moez Jellouli (MJZ1977)
 Mohammed Li (tthsqe12)
 Muzhen J (XInTheDark)
 Nathan Rugg (nmrugg)
 Nguyen Pham (nguyenpham)
 Nicklas Persson (NicklasPersson)
 Nick Pelling (nickpelling)
 Nicklas Persson (NicklasPersson)
 Niklas Fiekas (niklasf)
 Nikolay Kostov (NikolayIT)
 Nguyen Pham (nguyenpham)
 Norman Schmidt (FireFather)
 notruck
 Nour Berakdar (Nonlinear)
 Ofek Shochat (OfekShochat, ghostway)
 Ondrej Mosnáček (WOnder93)
 Ondřej Mišina (AndrovT)
 Oskar Werkelin Ahlin
 Ömer Faruk Tutkun (OmerFarukTutkun)
 Pablo Vazquez
 Panthee
 Pascal Romaret
 Pasquale Pigazzini (ppigazzini)
 Patrick Jansen (mibere)
 pellanda
 Peter Schneider (pschneider1968)
 Peter Zsifkovits (CoffeeOne)
 PikaCat
 Praveen Kumar Tummala (praveentml)
 Prokop Randáček (ProkopRandacek)
 Rahul Dsilva (silversolver1)
 Ralph Stößer (Ralph Stoesser)
 Raminder Singh
 renouve
-Reuven Peleg (R-Peleg)
+Reuven Peleg
-Richard Lloyd (Richard-Lloyd)
+Richard Lloyd
 Robert Nürnberg (robertnurnberg)
 Rodrigo Exterckötter Tjäder
 Rodrigo Roim (roim)
 Ronald de Man (syzygy1, syzygy)
 Ron Britvich (Britvich)
 Ronald de Man (syzygy1, syzygy)
 rqs
 Rui Coelho (ruicoelhopedro)
 Ryan Schmitt
@@ -213,28 +180,20 @@ Sergei Antonov (saproj)
 Sergei Ivanov (svivanov72)
 Sergio Vieri (sergiovieri)
 sf-x
 Shahin M. Shahin (peregrine)
 Shane Booth (shane31)
 Shawn Varghese (xXH4CKST3RXx)
 Shawn Xu (xu-shawn)
 Siad Daboul (Topologist)
 Stefan Geschwentner (locutus2)
 Stefano Cardanobile (Stefano80)
 Stefano Di Martino (StefanoD)
 Steinar Gunderson (sesse)
 Stéphane Nicolet (snicolet)
-Stephen Touset (stouset)
+Prokop Randáček (ProkopRandacek)
 Syine Mineta (MinetaS)
 Taras Vuk (TarasVuk)
 Thanar2
 thaspel
 theo77186
 TierynnB
 Ting-Hsuan Huang (fffelix-huang)
 Tobias Steinmann
 Tomasz Sobczyk (Sopel97)
 Tom Truscott
 Tom Vijlbrief (tomtor)
 Tomasz Sobczyk (Sopel97)
 Torsten Franz (torfranz, tfranzer)
 Torsten Hellwig (Torom)
 Tracey Emery (basepr1me)
@@ -242,14 +201,11 @@ tttak
 Unai Corzo (unaiic)
 Uri Blass (uriblass)
 Vince Negri (cuddlestmonkey)
 Viren
 Wencey Wang
 windfishballad
 xefoci7612
 Xiang Wang (KatyushaScarlet)
 zz4032
 # Additionally, we acknowledge the authors and maintainers of fishtest,
-# an amazing and essential framework for Stockfish development!
+# an amazing and essential framework for the development of Stockfish!
 #
-# https://github.com/official-stockfish/fishtest/blob/master/AUTHORS
+# https://github.com/glinscott/fishtest/blob/master/AUTHORS
@@ -1,23 +0,0 @@
 # This CITATION.cff file was generated with cffinit.
 # Visit https://bit.ly/cffinit to generate yours today!
 cff-version: 1.2.0
 title: Stockfish
 message: >-
  Please cite this software using the metadata from this
  file.
 type: software
 authors:
  - name: The Stockfish developers (see AUTHORS file)
 repository-code: 'https://github.com/official-stockfish/Stockfish'
 url: 'https://stockfishchess.org/'
 repository-artifact: 'https://stockfishchess.org/download/'
 abstract: Stockfish is a free and strong UCI chess engine.
 keywords:
  - chess
  - artificial intelligence (AI)
  - tree search
  - alpha-beta search
  - neural networks (NN)
  - efficiently updatable neural networks (NNUE)
 license: GPL-3.0
@@ -1,96 +0,0 @@
 # Contributing to Stockfish
 Welcome to the Stockfish project! We are excited that you are interested in
 contributing. This document outlines the guidelines and steps to follow when
 making contributions to Stockfish.
 ## Table of Contents
 - [Building Stockfish](#building-stockfish)
 - [Making Contributions](#making-contributions)
  - [Reporting Issues](#reporting-issues)
  - [Submitting Pull Requests](#submitting-pull-requests)
 - [Code Style](#code-style)
 - [Community and Communication](#community-and-communication)
 - [License](#license)
 ## Building Stockfish
 In case you do not have a C++ compiler installed, you can follow the
 instructions from our wiki.
 - [Ubuntu][ubuntu-compiling-link]
 - [Windows][windows-compiling-link]
 - [macOS][macos-compiling-link]
 ## Making Contributions
 ### Reporting Issues
 If you find a bug, please open an issue on the
 [issue tracker][issue-tracker-link]. Be sure to include relevant information
 like your operating system, build environment, and a detailed description of the
 problem.
 _Please note that Stockfish's development is not focused on adding new features.
 Thus any issue regarding missing features will potentially be closed without
 further discussion._
 ### Submitting Pull Requests
 - Functional changes need to be tested on fishtest. See
  [Creating my First Test][creating-my-first-test] for more details.
  The accompanying pull request should include a link to the test results and
  the new bench.
 - Non-functional changes (e.g. refactoring, code style, documentation) do not
  need to be tested on fishtest, unless they might impact performance.
 - Provide a clear and concise description of the changes in the pull request
  description.
 _First time contributors should add their name to [AUTHORS](./AUTHORS)._
 _Stockfish's development is not focused on adding new features. Thus any pull
 request introducing new features will potentially be closed without further
 discussion._
 ## Code Style
 Changes to Stockfish C++ code should respect our coding style defined by
 [.clang-format](.clang-format). You can format your changes by running
 `make format`. This requires clang-format version 18 to be installed on your system.
 ## Navigate
 For experienced Git users who frequently use git blame, it is recommended to
 configure the blame.ignoreRevsFile setting.
 This setting is useful for excluding noisy formatting commits.
 ```bash
 git config blame.ignoreRevsFile .git-blame-ignore-revs
 ```
 ## Community and Communication
 - Join the [Stockfish discord][discord-link] to discuss ideas, issues, and
  development.
 - Participate in the [Stockfish GitHub discussions][discussions-link] for
  broader conversations.
 ## License
 By contributing to Stockfish, you agree that your contributions will be licensed
 under the GNU General Public License v3.0. See [Copying.txt][copying-link] for
 more details.
 Thank you for contributing to Stockfish and helping us make it even better!
 [copying-link]:           https://github.com/official-stockfish/Stockfish/blob/master/Copying.txt
 [discord-link]:           https://discord.gg/GWDRS3kU6R
 [discussions-link]:       https://github.com/official-stockfish/Stockfish/discussions/new
 [creating-my-first-test]: https://github.com/official-stockfish/fishtest/wiki/Creating-my-first-test#create-your-test
 [issue-tracker-link]:     https://github.com/official-stockfish/Stockfish/issues
 [ubuntu-compiling-link]:  https://github.com/official-stockfish/Stockfish/wiki/Developers#user-content-installing-a-compiler-1
 [windows-compiling-link]: https://github.com/official-stockfish/Stockfish/wiki/Developers#user-content-installing-a-compiler
 [macos-compiling-link]:   https://github.com/official-stockfish/Stockfish/wiki/Developers#user-content-installing-a-compiler-2
@@ -1,161 +1,371 @@
 <div align="center">
  [![Stockfish][stockfish128-logo]][website-link]
  <h3>Stockfish</h3>
  A free and strong UCI chess engine.
  <br>
  <strong>[Explore Stockfish docs »][wiki-link]</strong>
  <br>
  <br>
  [Report bug][issue-link]
  ·
  [Open a discussion][discussions-link]
  ·
  [Discord][discord-link]
  ·
  [Blog][website-blog-link]
  [![Build][build-badge]][build-link]
  [![License][license-badge]][license-link]
  <br>
  [![Release][release-badge]][release-link]
  [![Commits][commits-badge]][commits-link]
  <br>
  [![Website][website-badge]][website-link]
  [![Fishtest][fishtest-badge]][fishtest-link]
  [![Discord][discord-badge]][discord-link]
 </div>
 ## Overview
-[Stockfish][website-link] is a **free and strong UCI chess engine** derived from
+[![Build Status](https://github.com/official-stockfish/Stockfish/actions/workflows/stockfish.yml/badge.svg)](https://github.com/official-stockfish/Stockfish/actions)
 Glaurung 2.1 that analyzes chess positions and computes the optimal moves.
-Stockfish **does not include a graphical user interface** (GUI) that is required
+[Stockfish](https://stockfishchess.org) is a free, powerful UCI chess engine
-to display a chessboard and to make it easy to input moves. These GUIs are
+derived from Glaurung 2.1. Stockfish is not a complete chess program and requires a
-developed independently from Stockfish and are available online. **Read the
+UCI-compatible graphical user interface (GUI) (e.g. XBoard with PolyGlot, Scid,
-documentation for your GUI** of choice for information about how to use
+Cute Chess, eboard, Arena, Sigma Chess, Shredder, Chess Partner or Fritz) in order
-Stockfish with it.
+to be used comfortably. Read the documentation for your GUI of choice for information
 about how to use Stockfish with it.
-See also the Stockfish [documentation][wiki-usage-link] for further usage help.
+The Stockfish engine features two evaluation functions for chess. The efficiently 
 updatable neural network (NNUE) based evaluation is the default and by far the strongest.
 The classical evaluation based on handcrafted terms remains available. The strongest 
 network is integrated in the binary and downloaded automatically during the build process.
 The NNUE evaluation benefits from the vector intrinsics available on most CPUs (sse2, 
 avx2, neon, or similar).
 ## Files
 This distribution of Stockfish consists of the following files:
-  * [README.md][readme-link], the file you are currently reading.
+  * [README.md](https://github.com/official-stockfish/Stockfish/blob/master/README.md),
    the file you are currently reading.
-  * [Copying.txt][license-link], a text file containing the GNU General Public
+  * [Copying.txt](https://github.com/official-stockfish/Stockfish/blob/master/Copying.txt),
-    License version 3.
+    a text file containing the GNU General Public License version 3.
-  * [AUTHORS][authors-link], a text file with the list of authors for the project.
+  * [AUTHORS](https://github.com/official-stockfish/Stockfish/blob/master/AUTHORS), 
    a text file with the list of authors for the project
-  * [src][src-link], a subdirectory containing the full source code, including a
+  * [src](https://github.com/official-stockfish/Stockfish/tree/master/src),
-    Makefile that can be used to compile Stockfish on Unix-like systems.
+    a subdirectory containing the full source code, including a Makefile
    that can be used to compile Stockfish on Unix-like systems.
  * a file with the .nnue extension, storing the neural network for the NNUE
    evaluation. Binary distributions will have this file embedded.
-## Contributing
+## The UCI protocol and available options
-__See [Contributing Guide](CONTRIBUTING.md).__
+The Universal Chess Interface (UCI) is a standard protocol used to communicate with
 a chess engine, and is the recommended way to do so for typical graphical user interfaces
 (GUI) or chess tools. Stockfish implements the majority of its options as described
 in [the UCI protocol](https://www.shredderchess.com/download/div/uci.zip).
 Developers can see the default values for UCI options available in Stockfish by typing
 `./stockfish uci` in a terminal, but the majority of users will typically see them and
 change them via a chess GUI. This is a list of available UCI options in Stockfish:
  * #### Threads
    The number of CPU threads used for searching a position. For best performance, set
    this equal to the number of CPU cores available.
  * #### Hash
    The size of the hash table in MB. It is recommended to set Hash after setting Threads.
  * #### Clear Hash
    Clear the hash table.
  * #### Ponder
    Let Stockfish ponder its next move while the opponent is thinking.
  * #### MultiPV
    Output the N best lines (principal variations, PVs) when searching.
    Leave at 1 for best performance.
  * #### Use NNUE
    Toggle between the NNUE and classical evaluation functions. If set to "true",
    the network parameters must be available to load from file (see also EvalFile),
    if they are not embedded in the binary.
  * #### EvalFile
    The name of the file of the NNUE evaluation parameters. Depending on the GUI the
    filename might have to include the full path to the folder/directory that contains
    the file. Other locations, such as the directory that contains the binary and the
    working directory, are also searched.
  * #### UCI_AnalyseMode
    An option handled by your GUI.
  * #### UCI_Chess960
    An option handled by your GUI. If true, Stockfish will play Chess960.
  * #### UCI_ShowWDL
    If enabled, show approximate WDL statistics as part of the engine output.
    These WDL numbers model expected game outcomes for a given evaluation and
    game ply for engine self-play at fishtest LTC conditions (60+0.6s per game).
  * #### UCI_LimitStrength
    Enable weaker play aiming for an Elo rating as set by UCI_Elo. This option overrides Skill Level.
  * #### UCI_Elo
    If enabled by UCI_LimitStrength, aim for an engine strength of the given Elo.
    This Elo rating has been calibrated at a time control of 60s+0.6s and anchored to CCRL 40/4.
  * #### Skill Level
    Lower the Skill Level in order to make Stockfish play weaker (see also UCI_LimitStrength).
    Internally, MultiPV is enabled, and with a certain probability depending on the Skill Level a
    weaker move will be played.
  * #### SyzygyPath
    Path to the folders/directories storing the Syzygy tablebase files. Multiple
    directories are to be separated by ";" on Windows and by ":" on Unix-based
    operating systems. Do not use spaces around the ";" or ":".
    Example: `C:\tablebases\wdl345;C:\tablebases\wdl6;D:\tablebases\dtz345;D:\tablebases\dtz6`
    It is recommended to store .rtbw files on an SSD. There is no loss in storing
    the .rtbz files on a regular HDD. It is recommended to verify all md5 checksums
    of the downloaded tablebase files (`md5sum -c checksum.md5`) as corruption will
    lead to engine crashes.
  * #### SyzygyProbeDepth
    Minimum remaining search depth for which a position is probed. Set this option
    to a higher value to probe less aggressively if you experience too much slowdown
    (in terms of nps) due to tablebase probing.
  * #### Syzygy50MoveRule
    Disable to let fifty-move rule draws detected by Syzygy tablebase probes count
    as wins or losses. This is useful for ICCF correspondence games.
  * #### SyzygyProbeLimit
    Limit Syzygy tablebase probing to positions with at most this many pieces left
    (including kings and pawns).
  * #### Move Overhead
    Assume a time delay of x ms due to network and GUI overheads. This is useful to
    avoid losses on time in those cases.
  * #### Slow Mover
    Lower values will make Stockfish take less time in games, higher values will
    make it think longer.
  * #### nodestime
    Tells the engine to use nodes searched instead of wall time to account for
    elapsed time. Useful for engine testing.
  * #### Debug Log File
    Write all communication to and from the engine into a text file.
 For developers the following non-standard commands might be of interest, mainly useful for debugging:
  * #### bench *ttSize threads limit fenFile limitType evalType*
    Performs a standard benchmark using various options. The signature of a version 
    (standard node count) is obtained using all defaults. `bench` is currently 
    `bench 16 1 13 default depth mixed`.
  * #### compiler
    Give information about the compiler and environment used for building a binary.
  * #### d
    Display the current position, with ascii art and fen.
  * #### eval
    Return the evaluation of the current position.
  * #### export_net [filename]
    Exports the currently loaded network to a file.
    If the currently loaded network is the embedded network and the filename
    is not specified then the network is saved to the file matching the name
    of the embedded network, as defined in evaluate.h.
    If the currently loaded network is not the embedded network (some net set
    through the UCI setoption) then the filename parameter is required and the
    network is saved into that file.
  * #### flip
    Flips the side to move.
 ### Generating Training Data
 To generate training data from the classic eval, use the generate_training_data command with the setting "Use NNUE" set to "false". The given example is generation in its simplest form. There are more commands.
 ```
 uci
 setoption name PruneAtShallowDepth value false
 setoption name Use NNUE value false
 setoption name Threads value X
 setoption name Hash value Y
 setoption name SyzygyPath value path
 isready
 generate_training_data depth A count B keep_draws 1 eval_limit 32000
 ```
 - `A` is the searched depth per move, or how far the engine looks forward. This value is an integer.
 - `B` is the amount of positions generated. This value is also an integer.
 Specify how many threads and how much memory you would like to use with the `x` and `y` values. The option SyzygyPath is not necessary, but if you would like to use it, you must first have Syzygy endgame tablebases on your computer, which you can find [here](http://oics.olympuschess.com/tracker/index.php). You will need to have a torrent client to download these tablebases, as that is probably the fastest way to obtain them. The `path` is the path to the folder containing those tablebases. It does not have to be surrounded in quotes.
 This will create a file named "training_data.binpack" in the same folder as the binary containing the generated training data. Once generation is done, you can rename the file to something like "1billiondepth12.binpack" to remember the depth and quantity of the positions and move it to a folder named "trainingdata" in the same directory as the binaries.
 You will also need validation data that is used for loss calculation and accuracy computation. Validation data is generated in the same way as training data, but generally at most 1 million positions should be used as there's no need for more and it would just slow the learning process down. It may also be better to slightly increase the depth for validation data. After generation you can rename the validation data file to "val.binpack" and drop it in a folder named "validationdata" in the same directory to make it easier.
 ## Training data formats.
 Currently there are 3 training data formats. Two of them are supported directly.
 - `.bin` - the original training data format. Uses 40 bytes per entry. Is supported directly by the `generate_training_data` command.
 - `.plain` - a human readable training data format. This one is not supported directly by the `generate_training_data` command. It should not be used for data exchange because it's less compact than other formats. It is mostly useful for inspection of the data.
 - `.binpack` - a compact binary training data format that exploits positions chains to further reduce size. It uses on average between 2 to 3 bytes per entry when generating data with `generate_training_data`. It is supported directly by `generate_training_data` command. It is currently the default for the `generate_training_data` command. A more in depth description can be found [here](docs/binpack.md)
 ### Conversion between formats.
 There is a builting converted that support all 3 formats described above. Any of them can be converted to any other. For more information and usage guide see [here](docs/convert.md).
 ## A note on classical evaluation versus NNUE evaluation
 Both approaches assign a value to a position that is used in alpha-beta (PVS) search
 to find the best move. The classical evaluation computes this value as a function
 of various chess concepts, handcrafted by experts, tested and tuned using fishtest.
 The NNUE evaluation computes this value with a neural network based on basic
 inputs (e.g. piece positions only). The network is optimized and trained
 on the evaluations of millions of positions at moderate search depth.
 The NNUE evaluation was first introduced in shogi, and ported to Stockfish afterward.
 It can be evaluated efficiently on CPUs, and exploits the fact that only parts
 of the neural network need to be updated after a typical chess move.
 [The nodchip repository](https://github.com/nodchip/Stockfish) provided the first 
 version of the needed tools to train and develop the NNUE networks. Today, more 
 advanced training tools are available in 
 [the nnue-pytorch repository](https://github.com/glinscott/nnue-pytorch/), 
 while data generation tools are available in 
 [a dedicated branch](https://github.com/official-stockfish/Stockfish/tree/tools).
 On CPUs supporting modern vector instructions (avx2 and similar), the NNUE evaluation
 results in much stronger playing strength, even if the nodes per second computed by
 the engine is somewhat lower (roughly 80% of nps is typical).
 Notes:
 1) the NNUE evaluation depends on the Stockfish binary and the network parameter file 
 (see the EvalFile UCI option). Not every parameter file is compatible with a given
 Stockfish binary, but the default value of the EvalFile UCI option is the name of a 
 network that is guaranteed to be compatible with that binary.
 2) to use the NNUE evaluation, the additional data file with neural network parameters
 needs to be available. Normally, this file is already embedded in the binary or it can
 be downloaded. The filename for the default (recommended) net can be found as the default
 value of the `EvalFile` UCI option, with the format `nn-[SHA256 first 12 digits].nnue`
 (for instance, `nn-c157e0a5755b.nnue`). This file can be downloaded from
 ```
 https://tests.stockfishchess.org/api/nn/[filename]
 ```
 replacing `[filename]` as needed.
 ## What to expect from the Syzygy tablebases?
 If the engine is searching a position that is not in the tablebases (e.g.
 a position with 8 pieces), it will access the tablebases during the search.
 If the engine reports a very large score (typically 153.xx), this means
 it has found a winning line into a tablebase position.
 If the engine is given a position to search that is in the tablebases, it
 will use the tablebases at the beginning of the search to preselect all
 good moves, i.e. all moves that preserve the win or preserve the draw while
 taking into account the 50-move rule.
 It will then perform a search only on those moves. **The engine will not move
 immediately**, unless there is only a single good move. **The engine likely
 will not report a mate score, even if the position is known to be won.**
 It is therefore clear that this behaviour is not identical to what one might
 be used to with Nalimov tablebases. There are technical reasons for this
 difference, the main technical reason being that Nalimov tablebases use the
 DTM metric (distance-to-mate), while the Syzygy tablebases use a variation of the
 DTZ metric (distance-to-zero, zero meaning any move that resets the 50-move
 counter). This special metric is one of the reasons that the Syzygy tablebases are
 more compact than Nalimov tablebases, while still storing all information
 needed for optimal play and in addition being able to take into account
 the 50-move rule.
 ## Large Pages
 Stockfish supports large pages on Linux and Windows. Large pages make
 the hash access more efficient, improving the engine speed, especially
 on large hash sizes. Typical increases are 5..10% in terms of nodes per
 second, but speed increases up to 30% have been measured. The support is
 automatic. Stockfish attempts to use large pages when available and
 will fall back to regular memory allocation when this is not the case.
 ### Support on Linux
 Large page support on Linux is obtained by the Linux kernel
 transparent huge pages functionality. Typically, transparent huge pages
 are already enabled, and no configuration is needed.
 ### Support on Windows
 The use of large pages requires "Lock Pages in Memory" privilege. See
 [Enable the Lock Pages in Memory Option (Windows)](https://docs.microsoft.com/en-us/sql/database-engine/configure-windows/enable-the-lock-pages-in-memory-option-windows)
 on how to enable this privilege, then run [RAMMap](https://docs.microsoft.com/en-us/sysinternals/downloads/rammap)
 to double-check that large pages are used. We suggest that you reboot
 your computer after you have enabled large pages, because long Windows
 sessions suffer from memory fragmentation, which may prevent Stockfish
 from getting large pages: a fresh session is better in this regard.
 ## Compiling Stockfish yourself from the sources
 Stockfish has support for 32 or 64-bit CPUs, certain hardware
 instructions, big-endian machines such as Power PC, and other platforms.
 On Unix-like systems, it should be easy to compile Stockfish
 directly from the source code with the included Makefile in the folder
 `src`. In general it is recommended to run `make help` to see a list of make
 targets with corresponding descriptions.
 ```
    cd src
    make help
    make net
    make build ARCH=x86-64-modern
 ```
 When not using the Makefile to compile (for instance, with Microsoft MSVC) you
 need to manually set/unset some switches in the compiler command line; see
 file *types.h* for a quick reference.
 When reporting an issue or a bug, please tell us which Stockfish version
 and which compiler you used to create your executable. This information
 can be found by typing the following command in a console:
 ```
    ./stockfish compiler
 ```
 ## Understanding the code base and participating in the project
 Stockfish's improvement over the last decade has been a great community
 effort. There are a few ways to help contribute to its growth.
 ### Donating hardware
-Improving Stockfish requires a massive amount of testing. You can donate your
+Improving Stockfish requires a massive amount of testing. You can donate
-hardware resources by installing the [Fishtest Worker][worker-link] and viewing
+your hardware resources by installing the [Fishtest Worker](https://github.com/glinscott/fishtest/wiki/Running-the-worker:-overview)
-the current tests on [Fishtest][fishtest-link].
+and view the current tests on [Fishtest](https://tests.stockfishchess.org/tests).
 ### Improving the code
-In the [chessprogramming wiki][programming-link], many techniques used in
+If you want to help improve the code, there are several valuable resources:
 Stockfish are explained with a lot of background information.
 The [section on Stockfish][programmingsf-link] describes many features
 and techniques used by Stockfish. However, it is generic rather than
 focused on Stockfish's precise implementation.
-The engine testing is done on [Fishtest][fishtest-link].
+* [In this wiki,](https://www.chessprogramming.org) many techniques used in
-If you want to help improve Stockfish, please read this [guideline][guideline-link]
+Stockfish are explained with a lot of background information.
 * [The section on Stockfish](https://www.chessprogramming.org/Stockfish)
 describes many features and techniques used by Stockfish. However, it is
 generic rather than being focused on Stockfish's precise implementation.
 Nevertheless, a helpful resource.
 * The latest source can always be found on [GitHub](https://github.com/official-stockfish/Stockfish).
 Discussions about Stockfish take place these days mainly in the [FishCooking](https://groups.google.com/forum/#!forum/fishcooking)
 group and on the [Stockfish Discord channel](https://discord.gg/nv8gDtt).
 The engine testing is done on [Fishtest](https://tests.stockfishchess.org/tests).
 If you want to help improve Stockfish, please read this [guideline](https://github.com/glinscott/fishtest/wiki/Creating-my-first-test)
 first, where the basics of Stockfish development are explained.
 Discussions about Stockfish take place these days mainly in the Stockfish
 [Discord server][discord-link]. This is also the best place to ask questions
 about the codebase and how to improve it.
 ## Compiling Stockfish
 Stockfish has support for 32 or 64-bit CPUs, certain hardware instructions,
 big-endian machines such as Power PC, and other platforms.
 On Unix-like systems, it should be easy to compile Stockfish directly from the
 source code with the included Makefile in the folder `src`. In general, it is
 recommended to run `make help` to see a list of make targets with corresponding
 descriptions. An example suitable for most Intel and AMD chips:
 ```
 cd src
 make -j profile-build
 ```
 Detailed compilation instructions for all platforms can be found in our
 [documentation][wiki-compile-link]. Our wiki also has information about
 the [UCI commands][wiki-uci-link] supported by Stockfish.
 ## Terms of use
-Stockfish is free and distributed under the
+Stockfish is free, and distributed under the **GNU General Public License version 3**
-[**GNU General Public License version 3**][license-link] (GPL v3). Essentially,
+(GPL v3). Essentially, this means you are free to do almost exactly
-this means you are free to do almost exactly what you want with the program,
+what you want with the program, including distributing it among your
-including distributing it among your friends, making it available for download
+friends, making it available for download from your website, selling
-from your website, selling it (either by itself or as part of some bigger
+it (either by itself or as part of some bigger software package), or
-software package), or using it as the starting point for a software project of
+using it as the starting point for a software project of your own.
 your own.
-The only real limitation is that whenever you distribute Stockfish in some way,
+The only real limitation is that whenever you distribute Stockfish in
-you MUST always include the license and the full source code (or a pointer to
+some way, you MUST always include the license and the full source code
-where the source code can be found) to generate the exact binary you are
+(or a pointer to where the source code can be found) to generate the 
-distributing. If you make any changes to the source code, these changes must
+exact binary you are distributing. If you make any changes to the
-also be made available under GPL v3.
+source code, these changes must also be made available under the GPL v3.
-## Acknowledgements
+For full details, read the copy of the GPL v3 found in the file named
-
+[*Copying.txt*](https://github.com/official-stockfish/Stockfish/blob/master/Copying.txt).
 Stockfish uses neural networks trained on [data provided by the Leela Chess Zero
 project][lc0-data-link], which is made available under the [Open Database License][odbl-link] (ODbL).
 [authors-link]:       https://github.com/official-stockfish/Stockfish/blob/master/AUTHORS
 [build-link]:         https://github.com/official-stockfish/Stockfish/actions/workflows/stockfish.yml
 [commits-link]:       https://github.com/official-stockfish/Stockfish/commits/master
 [discord-link]:       https://discord.gg/GWDRS3kU6R
 [issue-link]:         https://github.com/official-stockfish/Stockfish/issues/new?assignees=&labels=&template=BUG-REPORT.yml
 [discussions-link]:   https://github.com/official-stockfish/Stockfish/discussions/new
 [fishtest-link]:      https://tests.stockfishchess.org/tests
 [guideline-link]:     https://github.com/official-stockfish/fishtest/wiki/Creating-my-first-test
 [license-link]:       https://github.com/official-stockfish/Stockfish/blob/master/Copying.txt
 [programming-link]:   https://www.chessprogramming.org/Main_Page
 [programmingsf-link]: https://www.chessprogramming.org/Stockfish
 [readme-link]:        https://github.com/official-stockfish/Stockfish/blob/master/README.md
 [release-link]:       https://github.com/official-stockfish/Stockfish/releases/latest
 [src-link]:           https://github.com/official-stockfish/Stockfish/tree/master/src
 [stockfish128-logo]:  https://stockfishchess.org/images/logo/icon_128x128.png
 [uci-link]:           https://backscattering.de/chess/uci/
 [website-link]:       https://stockfishchess.org
 [website-blog-link]:  https://stockfishchess.org/blog/
 [wiki-link]:          https://github.com/official-stockfish/Stockfish/wiki
 [wiki-compile-link]:  https://github.com/official-stockfish/Stockfish/wiki/Compiling-from-source
 [wiki-uci-link]:      https://github.com/official-stockfish/Stockfish/wiki/UCI-&-Commands
 [wiki-usage-link]:    https://github.com/official-stockfish/Stockfish/wiki/Download-and-usage
 [worker-link]:        https://github.com/official-stockfish/fishtest/wiki/Running-the-worker
 [lc0-data-link]:      https://storage.lczero.org/files/training_data
 [odbl-link]:          https://opendatacommons.org/licenses/odbl/odbl-10.txt
 [build-badge]:        https://img.shields.io/github/actions/workflow/status/official-stockfish/Stockfish/stockfish.yml?branch=master&style=for-the-badge&label=stockfish&logo=github
 [commits-badge]:      https://img.shields.io/github/commits-since/official-stockfish/Stockfish/latest?style=for-the-badge
 [discord-badge]:      https://img.shields.io/discord/435943710472011776?style=for-the-badge&label=discord&logo=Discord
 [fishtest-badge]:     https://img.shields.io/website?style=for-the-badge&down_color=red&down_message=Offline&label=Fishtest&up_color=success&up_message=Online&url=https%3A%2F%2Ftests.stockfishchess.org%2Ftests%2Ffinished
 [license-badge]:      https://img.shields.io/github/license/official-stockfish/Stockfish?style=for-the-badge&label=license&color=success
 [release-badge]:      https://img.shields.io/github/v/release/official-stockfish/Stockfish?style=for-the-badge&label=official%20release
 [website-badge]:      https://img.shields.io/website?style=for-the-badge&down_color=red&down_message=Offline&label=website&up_color=success&up_message=Online&url=https%3A%2F%2Fstockfishchess.org
@@ -1,301 +1,235 @@
-Contributors to Fishtest with >10,000 CPU hours, as of 2024-08-31.
+Contributors to Fishtest with >10,000 CPU hours, as of 2022-04-14.
 Thank you!
 Username                                CPU Hours     Games played
 ------------------------------------------------------------------
-noobpwnftw                               40428649       3164740143
+noobpwnftw                               31714850       2267266129
-technologov                              23581394       1076895482
+mlang                                     2954099        198421098
-vdv                                      19425375        718302718
+technologov                               2324150        102449398
-linrock                                  10034115        643194527
+dew                                       1670874         99276012
-mlang                                     3026000        200065824
+grandphish2                               1134273         68070459
-okrout                                    2572676        237511408
+okrout                                     901194         77738874
-pemo                                      1836785         62226157
+TueRens                                    821388         50207666
-dew                                       1689162        100033738
+tvijlbrief                                 795993         51894442
-TueRens                                   1648780         77891164
+pemo                                       744463         32486677
-sebastronomy                              1468328         60859092
+JojoM                                      724378         43660674
 grandphish2                               1466110         91776075
 JojoM                                     1130625         73666098
 olafm                                     1067009         74807270
 tvijlbrief                                 796125         51897690
 oz                                         781847         53910686
 rpngn                                      768460         49812975
 gvreuls                                    751085         52177668
 mibere                                     703840         46867607
-leszek                                     566598         42024615
+linrock                                    626939         17408017
-cw                                         519601         34988161
+gvreuls                                    534079         34352532
-fastgm                                     503862         30260818
+cw                                         507221         34006775
-CSU_Dynasty                                468784         31385034
+fastgm                                     489749         29344518
-maximmasiutin                              439192         27893522
+crunchy                                    427035         27344275
-ctoks                                      435148         28541909
+CSU_Dynasty                                424643         28525220
-crunchy                                    427414         27371625
+ctoks                                      415771         27364603
-bcross                                     415724         29061187
+oz                                         369200         27017658
-robal                                      371112         24642270
+bcross                                     342642         23671289
 mgrabiak                                   367963         26464704
 velislav                                   342588         22140902
 ncfish1                                    329039         20624527
 Fisherman                                  327231         21829379
-Dantist                                    296386         18031762
+velislav                                   325670         20911076
-tolkki963                                  262050         22049676
+leszek                                     321295         19874113
-Sylvain27                                  255595          8864404
+Dantist                                    274747         16910258
-nordlandia                                 249322         16420192
+mgrabiak                                   237604         15418700
-Fifis                                      237657         13065577
+robal                                      217959         13840386
-marrco                                     234581         17714473
+glinscott                                  217799         13780820
-Calis007                                   217537         14450582
+nordlandia                                 211692         13484886
-glinscott                                  208125         13277240
+drabel                                     201967         13798360
 drabel                                     204167         13930674
 mhoram                                     202894         12601997
 bking_US                                   198894         11876016
 mhoram                                     194862         12261809
 Thanar                                     179852         12365359
-javran                                     169679         13481966
+vdv                                        175544          9904472
 armo9494                                   162863         10937118
 spams                                      157128         10319326
-DesolatedDodo                              156683         10211206
+rpngn                                      154081          9652139
-Wencey                                     152308          8375444
+marrco                                     150300          9402229
 sqrt2                                      147963          9724586
-vdbergh                                    140311          9225125
+vdbergh                                    137430          8955097
 jcAEie                                     140086         10603658
 CoffeeOne                                  137100          5024116
 malala                                     136182          8002293
 xoto                                       133759          9159372
-Dubslow                                    129614          8519312
+davar                                      125240          8117121
 davar                                      129023          8376525
 DMBK                                       122960          8980062
 dsmith                                     122059          7570238
-CypressChess                               120784          8672620
+amicic                                     119659          7937885
 sschnee                                    120526          7547722
 maposora                                   119734         10749710
 amicic                                     119661          7938029
 Wolfgang                                   115713          8159062
 Data                                       113305          8220352
 BrunoBanani                                112960          7436849
-markkulix                                  112897          9133168
+CypressChess                               108321          7759588
-cuistot                                    109802          7121030
+DesolatedDodo                              106811          6776980
 skiminki                                   107583          7218170
 sterni1971                                 104431          5938282
 MaZePallas                                 102823          6633619
 sterni1971                                 100532          5880772
 sunu                                       100167          7040199
 zeryl                                       99331          6221261
 thirdlife                                   99156          2245320
 ElbertoOne                                  99028          7023771
-megaman7de                                  98456          6675076
+skiminki                                    98123          6478402
 Goatminola                                  96765          8257832
 bigpen0r                                    94825          6529241
 brabos                                      92118          6186135
-Maxim                                       90818          3283364
+cuistot                                     90358          5351004
 psk                                         89957          5984901
-racerschmacer                               85805          6122790
+racerschmacer                               85712          6119648
 Vizvezdenec                                 83761          5344740
 zeryl                                       83680          5250995
 sschnee                                     83003          4840890
 0x3C33                                      82614          5271253
 szupaw                                      82495          7151686
 BRAVONE                                     81239          5054681
 nssy                                        76497          5259388
 cody                                        76126          4492126
 jromang                                     76106          5236025
 MarcusTullius                               76103          5061991
 woutboat                                    76072          6022922
 Spprtr                                      75977          5252287
 teddybaer                                   75125          5407666
 jromang                                     74796          5175825
 Pking_cda                                   73776          5293873
-yurikvelo                                   73611          5046822
+Calis007                                    72477          4088576
 Mineta                                      71130          4711422
 Bobo1239                                    70579          4794999
 solarlight                                  70517          5028306
 dv8silencer                                 70287          3883992
 Bobo1239                                    68515          4652287
 manap                                       66273          4121774
 yurikvelo                                   65716          4457300
 tinker                                      64333          4268790
 Wolfgang                                    62644          3817410
 qurashee                                    61208          3429862
 AGI                                         58195          4329580
 robnjr                                      57262          4053117
 Freja                                       56938          3733019
 MaxKlaxxMiner                               56879          3423958
 ttruscott                                   56010          3680085
 rkl                                         55132          4164467
 jmdana                                      54697          4012593
 notchris                                    53936          4184018
 renouve                                     53811          3501516
 megaman7de                                  52434          3243016
 MaxKlaxxMiner                               51977          3153032
 finfish                                     51360          3370515
 eva42                                       51272          3599691
-eastorwest                                  51117          3454811
+eastorwest                                  51058          3451555
 rap                                         49985          3219146
-pb00067                                     49733          3298934
+pb00067                                     49727          3298270
-GPUex                                       48686          3684998
+Spprtr                                      48920          3161711
-OuaisBla                                    48626          3445134
+bigpen0r                                    47667          3336927
 ronaldjerum                                 47654          3240695
 biffhero                                    46564          3111352
-oryx                                        45639          3546530
+Fifis                                       45843          3088497
 VoyagerOne                                  45476          3452465
 speedycpu                                   43842          3003273
 jbwiebe                                     43305          2805433
 Antihistamine                               41788          2761312
 mhunt                                       41735          2691355
 jibarbosa                                   41640          4145702
 homyur                                      39893          2850481
 gri                                         39871          2515779
-DeepnessFulled                              39020          3323102
+armo9494                                    39064          2832326
-Garf                                        37741          2999686
+oryx                                        38867          2976992
 SC                                          37299          2731694
-Gaster319                                   37118          3279678
+Garf                                        37213          2986270
-naclosagc                                   36562          1279618
+tolkki963                                   37059          2154330
 csnodgrass                                  36207          2688994
 jmdana                                      36157          2210661
 strelock                                    34716          2074055
-gopeto                                      33717          2245606
+DMBK                                        34010          2482916
 EthanOConnor                                33370          2090311
 slakovv                                     32915          2021889
-jojo2357                                    32890          2826662
+gopeto                                      30993          2028106
 shawnxu                                     32019          2802552
 Gelma                                       31771          1551204
 vidar808                                    31560          1351810
 kdave                                       31157          2198362
 manapbk                                     30987          1810399
 ZacHFX                                      30966          2272416
 TataneSan                                   30713          1513402
 votoanthuan                                 30691          2460856
 Prcuvu                                      30377          2170122
 anst                                        30301          2190091
 jkiiski                                     30136          1904470
 spcc                                        29925          1901692
 hyperbolic.tom                              29840          2017394
 chuckstablers                               29659          2093438
 Pyafue                                      29650          1902349
-belzedar94                                  28846          1811530
+ncfish1                                     29105          1704011
-mecevdimitar                                27610          1721382
+belzedar94                                  27935          1789106
 OuaisBla                                    27636          1578800
 chriswk                                     26902          1868317
 xwziegtm                                    26897          2124586
 achambord                                   26582          1767323
 somethingintheshadows                       26496          2186404
 Patrick_G                                   26276          1801617
 yorkman                                     26193          1992080
 srowen                                      25743          1490684
 Ulysses                                     25413          1702830
 Jopo12321                                   25227          1652482
 SFTUser                                     25182          1675689
-nabildanial                                 25068          1531665
+nabildanial                                 24942          1519409
 Sharaf_DG                                   24765          1786697
-rodneyc                                     24376          1416402
+rodneyc                                     24275          1410450
 jsys14                                      24297          1721230
 agg177                                      23890          1395014
 AndreasKrug                                 23754          1890115
 Ente                                        23752          1678188
 JanErik                                     23408          1703875
 Isidor                                      23388          1680691
-Norabor                                     23371          1603244
+Norabor                                     23339          1602636
-WoodMan777                                  23253          2023048
+Ente                                        23270          1651432
-Nullvalue                                   23155          2022752
+cisco2015                                   22897          1762669
-cisco2015                                   22920          1763301
+MarcusTullius                               22688          1274821
 Zirie                                       22542          1472937
 team-oh                                     22272          1636708
 Roady                                       22220          1465606
 MazeOfGalious                               21978          1629593
-sg4032                                      21950          1643373
+sg4032                                      21947          1643265
 tsim67                                      21747          1330880
 ianh2105                                    21725          1632562
 Skiff84                                     21711          1014212
 xor12                                       21628          1680365
 dex                                         21612          1467203
 nesoneg                                     21494          1463031
-user213718                                  21454          1404128
+Roady                                       21323          1433822
 Serpensin                                   21452          1790510
 sphinx                                      21211          1384728
-qoo_charly_cai                              21136          1514927
+user213718                                  21196          1397710
-IslandLambda                                21062          1220838
+spcc                                        21065          1311338
 jjoshua2                                    21001          1423089
 Zake9298                                    20938          1565848
 horst.prack                                 20878          1465656
 fishtester                                  20729          1348888
 0xB00B1ES                                   20590          1208666
 ols                                         20477          1195945
 Dinde                                       20459          1292774
 j3corre                                     20405           941444
 kdave                                       20364          1389254
 Adrian.Schmidt123                           20316          1281436
 Ulysses                                     20217          1351500
 markkulix                                   19976          1115258
 wei                                         19973          1745989
 teenychess                                  19819          1762006
 rstoesser                                   19569          1293588
 eudhan                                      19274          1283717
 fishtester                                  18995          1238686
 vulcan                                      18871          1729392
 wizardassassin                              18795          1376884
 Karpovbot                                   18766          1053178
 jundery                                     18445          1115855
-mkstockfishtester                           18350          1690676
+iisiraider                                  18247          1101015
 ville                                       17883          1384026
 chris                                       17698          1487385
 purplefishies                               17595          1092533
-dju                                         17414           981289
+dju                                         17353           978595
-iisiraider                                  17275          1049015
+Wencey                                      17125           805964
 DragonLord                                  17014          1162790
-Karby                                       17008          1013160
+thirdlife                                   16996           447356
 pirt                                        16965          1271519
 redstone59                                  16842          1461780
 Alb11747                                    16787          1213990
 Naven94                                     16414           951718
 scuzzi                                      16115           994341
 IgorLeMasson                                16064          1147232
 ako027ako                                   15671          1173203
-infinigon                                   15285           965966
+AndreasKrug                                 15550          1194497
 Nikolay.IT                                  15154          1068349
 Andrew Grant                                15114           895539
 scuzzi                                      14928           953313
 OssumOpossum                                14857          1007129
-LunaticBFF57                                14525          1190310
+Karby                                       14808           867120
 jsys14                                      14652           855642
 enedene                                     14476           905279
-Hjax                                        14394          1005013
+bpfliegel                                   14298           884523
 bpfliegel                                   14233           882523
 YELNAMRON                                   14230          1128094
 mpx86                                       14019           759568
 jpulman                                     13982           870599
 getraideBFF                                 13871          1172846
 Nesa92                                      13806          1116101
 crocogoat                                   13803          1117422
-joster                                      13710           946160
+joster                                      13794           950160
 Nesa92                                      13786          1114691
 mbeier                                      13650          1044928
-Pablohn26                                   13552          1088532
+Hjax                                        13535           915487
 wxt9861                                     13550          1312306
 Dark_wizzie                                 13422          1007152
 Jopo12321                                   13367           678852
 Rudolphous                                  13244           883140
 Machariel                                   13010           863104
 nalanzeyu                                   12996           232590
 mabichito                                   12903           749391
 Jackfish                                    12895           868928
 thijsk                                      12886           722107
 AdrianSA                                    12860           804972
 infinigon                                   12807           937332
 Flopzee                                     12698           894821
 whelanh                                     12682           266404
 mschmidt                                    12644           863193
 korposzczur                                 12606           838168
 fatmurphy                                   12547           853210
 Oakwen                                      12532           855759
 icewulf                                     12447           854878
 SapphireBrand                               12416           969604
 deflectooor                                 12386           579392
 modolief                                    12386           896470
 Farseer                                     12249           694108
 Hongildong                                  12201           648712
 pgontarz                                    12151           848794
-dbernier                                    12103           860824
+pirt                                        12008           923149
 szczur90                                    12035           942376
 FormazChar                                  12019           910409
 rensonthemove                               11999           971993
 stocky                                      11954           699440
-MooTheCow                                   11923           779432
+mschmidt                                    11941           803401
-3cho                                        11842          1036786
+dbernier                                    11609           818636
-ckaz                                        11792           732276
+Maxim                                       11543           836024
 infinity                                    11470           727027
-aga                                         11412           695127
+aga                                         11409           695071
 torbjo                                      11395           729145
 Thomas A. Anderson                          11372           732094
 savage84                                    11358           670860
-Def9Infinity                                11345           696552
+FormazChar                                  11349           850327
 d64                                         11263           789184
-ali-al-zhrani                               11245           779246
+MooTheCow                                   11237           720174
 ImperiumAeternum                            11155           952000
 snicolet                                    11106           869170
-dapper                                      11032           771402
+ali-al-zhrani                               11098           768494
-Ethnikoi                                    10993           945906
+whelanh                                     11067           235676
-Snuuka                                      10938           435504
+Jackfish                                    10978           720078
-Karmatron                                   10871           678306
+deflectooor                                 10886           520116
 basepi                                      10637           744851
 Cubox                                       10621           826448
 gerbil                                      10519           971688
 michaelrpg                                  10509           739239
 OIVAS7572                                   10420           995586
 Garruk                                      10365           706465
 dzjp                                        10343           732529
-RickGroszkiewicz                            10263           990798
+Garruk                                      10334           704065
 ols                                         10259           570669
 lbraesch                                    10252           647825
 qoo_charly_cai                              10212           620407
 Naven94                                     10069           503192
@@ -0,0 +1,42 @@
 # Binpack
 Binpack is a binary training data storage format designed to take advantage of position chains differing by a single move. Therefore it is very good at compactly storing data generated from real games (as opposed to random positions for example sourced from an opening book).
 It is currently implemented through a single header library in `extra/nnue_data_binpack_format.h`.
 Below follows a rough description of the format in a BNF-like notation.
 ```
 [[nodiscard]] std::uint16_t signedToUnsigned(std::int16_t a) {
    std::uint16_t r;
    std::memcpy(&r, &a, sizeof(std::uint16_t));
    if (r & 0x8000) r ^= 0x7FFF; // flip value bits if negative
    r = (r << 1) | (r >> 15); // store sign bit at bit 0
    return r;
 }
 file := <block>*
 block := BINP<chain>*
 chain := <stem><movetext>
 stem := <pos><move><score><ply_and_result><rule50> (32 bytes)
 pos := https://github.com/Sopel97/nnue_data_compress/blob/master/src/chess/Position.h#L1166 (24 bytes)
 move := https://github.com/Sopel97/nnue_data_compress/blob/master/src/chess/Chess.h#L1044 (2 bytes)
 score := signedToUnsigned(score) (2 bytes, big endian)
 ply_and_result := ply bitwise_or (signedToUnsigned(result) << 14) (2 bytes, big endian)
 rule50 := rule_50_counter (2 bytes, big endian)
    // this is a small defect from old version,
    I didn't want to break backwards compatibility. Effectively means that there's
    one byte left for something else in the future because rule50 always fits in one byte.
 movetext := <count><move_and_score>*
 count := number of plies in the movetext (2 bytes, big endian). Can be 0.
 move_and_score := <encoded_move><encoded_score> (~2 bytes)
 encoded_move := oof this one is complicated to explain.
    https://github.com/Sopel97/nnue_data_compress/blob/master/src/compress_file.cpp#L827.
    https://github.com/Sopel97/chess_pos_db/blob/master/docs/bcgn/variable_length.md
 encoded_score := https://en.wikipedia.org/wiki/Variable-width_encoding
    with block size of 4 bits + 1 bit for extension bit.
    Encoded value is signedToUnsigned(-prev_score - current_score)
    (scores are always seen from the perspective of side to move in <pos>, that's why the '-' before prev_score)
 ```
@@ -0,0 +1,18 @@
 # Convert
 `convert` allows conversion of training data between any of `.plain`, `.bin`, and `.binpack`.
 As all commands in stockfish `convert` can be invoked either from command line (as `stockfish.exe convert ...`) or in the interactive prompt.
 The syntax of this command is as follows:
 ```
 convert from_path to_path [append] [validate]
 ```
 `from_path` is the path to the file to convert from. The type of the data is deduced based on its extension (one of `.plain`, `.bin`, `.binpack`).
 `to_path` is the path to an output file. The type of the data is deduced from its extension. If the file does not exist it is created.
 `append` and `validate` can come in any order and are optional.
 If `append` not specified then the output file will be truncated prior to any writes. If `append` is specified then the converted training data will be appended to the end of the output file.
 If `validate` is specified then the conversion will stop on the first illegal move found and a diagnostic will be shown.
@@ -0,0 +1,67 @@
 # generate_training_data
 `generate_training_data` command allows generation of training data from self-play in a manner that suits training better than traditional games. It introduces random moves to diversify openings, and fixed depth evaluation.
 As all commands in stockfish `generate_training_data` can be invoked either from command line (as `stockfish.exe generate_training_data ...`, but this is not recommended because it's not possible to specify UCI options before `generate_training_data` executes) or in the interactive prompt.
 It is recommended to set the `PruneAtShallowDepth` UCI option to `false` as it will increase the quality of fixed depth searches.
 It is recommended to keep the `EnableTranspositionTable` UCI option at the default `true` value as it will make the generation process faster without noticably harming the uniformity of the data.
 `generate_training_data` takes named parameters in the form of `generate_training_data param_1_name param_1_value param_2_name param_2_value ...`.
 Currently the following options are available:
 `set_recommended_uci_options` - this is a modifier not a parameter, no value follows it. If specified then some UCI options are set to recommended values.
 `depth` - sets minimum and maximum depth of evaluation of each position. Default: 3.
 `mindepth` - minimum depth of evaluation of each position. If not specified then the same as `depth`.
 `maxdepth` - minimum depth of evaluation of each position. If not specified then the same as `depth`.
 `nodes` - the number of nodes to use for evaluation of each position. This number is multiplied by the number of PVs of the current search. This does NOT override the `depth` and `depth2` options. If specified then whichever of depth or nodes limit is reached first applies.
 `count` - the number of training data entries to generate. 1 entry == 1 position. If both `count` and `max_time_*` are specified the data generation process will end when any of conditions is fullfilled. Default: 8000000000 (8B).
 `max_time_seconds`, `max_time_minutes`, `max_time_hours` - specifies the maximum runtime for the data generation. The data generation will NOT be interrupted while a self-play game is in progress. If both `count` and `max_time_*` are specified the data generation process will end when any of conditions is fullfilled. Default: \~250 years.
 `output_file_name` - the name of the file to output to. If the extension is not present or doesn't match the selected training data format the right extension will be appened. Default: generated_kifu
 `eval_limit` - evaluations with higher absolute value than this will not be written and will terminate a self-play game. Should not exceed 10000 which is VALUE_KNOWN_WIN, but is only hardcapped at mate in 2 (\~30000). Default: 3000
 `random_move_min_ply` - the minimal ply at which a random move may be executed instead of a move chosen by search. Default: 1.
 `random_move_max_ply` - the maximal ply at which a random move may be executed instead of a move chosen by search. Default: 24.
 `random_move_count` - maximum number of random moves in a single self-play game. Default: 5.
 `random_move_like_apery` - either 0 or 1. If 1 then random king moves will be followed by a random king move from the opponent whenever possible with 50% probability. Default: 0.
 `random_multi_pv` - the number of PVs used for determining the random move. If not specified then a truly random move will be chosen. If specified then a multiPV search will be performed the random move will be one of the moves chosen by the search.
 `random_multi_pv_diff` - Makes the multiPV random move selection consider only moves that are at most `random_multi_pv_diff` worse than the next best move. Default: 30000 (all multiPV moves).
 `random_multi_pv_depth` - the depth to use for multiPV search for random move. Default: `depth2`.
 `random_multi_pv_nodes` - the maximum number of nodes for a multiPV search for random move. Default: `nodes`.
 `write_min_ply` - minimum ply for which the training data entry will be emitted. Default: 16.
 `write_max_ply` - maximum ply for which the training data entry will be emitted. Default: 400.
 `book` - a path to an opening book to use for the starting positions. Currently only .epd format is supported. If not specified then the starting position is always the standard chess starting position.
 `save_every` - the number of training data entries per file. If not specified then there will be always one file. If specified there may be more than one file generated (each having at most `save_every` training data entries) and each file will have a unique number attached.
 `random_file_name` - if specified then the output filename will be chosen randomly. Overrides `output_file_name`.
 `keep_draws` - either 0 or 1. If 1 then training data from drawn games will be emitted too. Default: 1.
 `adjudicate_draws_by_score` - either 0 or 1. If 1 then drawn games will be adjudicated when the score remains 0 for at least 8 plies after ply 80. Default: 1.
 `adjudicate_draws_by_insufficient_mating_material` - either 0 or 1. If 1 then position with insufficient material will be adjudicated as draws. Default: 1.
 `data_format` - format of the training data to use. Either `bin` or `binpack`. Default: `binpack`.
 `seed` - seed for the PRNG. Can be either a number or a string. If it's a string then its hash will be used. If not specified then the current time will be used.
@@ -0,0 +1,41 @@
 # generate_training_data_nonpv
 `generate_training_data_nonpv` command allows generation of training data from self-play in a manner that suits training better than traditional games. It plays fixed nodes self play games for exploration and records [some of] the evaluated positions. Then rescores them with fixed depth search.
 As all commands in stockfish `generate_training_data_nonpv` can be invoked either from command line (as `stockfish.exe generate_training_data_nonpv ...`, but this is not recommended because it's not possible to specify UCI options before `generate_training_data_nonpv` executes) or in the interactive prompt.
 It is recommended to set the `PruneAtShallowDepth` UCI option to `false` as it will increase the quality of fixed depth searches.
 It is recommended to keep the `EnableTranspositionTable` UCI option at the default `true` value as it will make the generation process faster without noticably harming the uniformity of the data.
 `generate_training_data_nonpv` takes named parameters in the form of `generate_training_data_nonpv param_1_name param_1_value param_2_name param_2_value ...`.
 Currently the following options are available:
 `depth` - the search depth to use for rescoring. Default: 3.
 `count` - the number of training data entries to generate. 1 entry == 1 position. Default: 1000000 (1M).
 `exploration_min_nodes` - the min number of nodes to use for exploraton during selfplay. Default: 5000.
 `exploration_max_nodes` - the max number of nodes to use for exploraton during selfplay. The number of nodes is chosen from a uniform distribution between min and max. Default: 15000.
 `exploration_save_rate` - the ratio of positions seen during exploration self play games that are saved for later rescoring. Default: 0.01 (meaning 1 in 100 positions seen during search get saved for rescoring).
 `output_file` - the name of the file to output to. If the extension is not present or doesn't match the selected training data format the right extension will be appened. Default: generated_gensfen_nonpv
 `eval_limit` - evaluations with higher absolute value than this will not be written and will terminate a self-play game. Should not exceed 10000 which is VALUE_KNOWN_WIN, but is only hardcapped at mate in 2 (\~30000). Default: 4000
 `exploration_eval_limit` - same as `eval_limit` but used during exploration with a value from fixed depth search.
 `exploration_min_pieces` - the min number of pieces in the self play games to start the fixed depth search. Note that even if there's N pieces on the board the fixed nodes search usually reaches positions with less pieces and they are saved too. Default: 8.
 `exploration_max_ply` the max ply for the exploration self play. Default: 200.
 `smart_fen_skipping` - this is a flag option. When specified some position that are not good candidates for teaching are removed from the output. This includes positions where the best move is a capture or promotion, and position where a king is in check.
 `book` - a path to an opening book to use for the starting positions. Currently only .epd format is supported. If not specified then the starting position is always the standard chess starting position.
 `data_format` - format of the training data to use. Either `bin` or `binpack`. Default: `binpack`.
 `seed` - seed for the PRNG. Can be either a number or a string. If it's a string then its hash will be used. If not specified then the current time will be used.
@@ -0,0 +1,41 @@
 # Stats
 `gather_statistics` command allows gathering various statistics from a .bin or a .binpack file. The syntax is `gather_statistics (GROUP)* input_file FILENAME`. There can be many groups specified. Any statistic gatherer that belongs to at least one of the specified groups will be used.
 Simplest usage: `stockfish.exe gather_statistics all input_file a.binpack`
 Any name that doesn't designate an argument name or is not an argument will be interpreted as a group name.
 ## Parameters
 `input_file` - the path to the .bin or .binpack input file to read
 `output_file` - optional path to the output file to write the results too. Results are always written on the console, so if this is specified the results will be written in both places.
 `max_count` - the maximum number of positions to process. Default: no limit.
 ## Groups
 `all` - a special group designating all statistics gatherers available.
 `position_count` - the total number of positions in the file.
 `king`, `king_square_count` - the number of times a king was on each square. Output is layed out as a chessboard, with the 8th rank being the topmost. Separate values for white and black kings.
 `move`, `move_from_count` - same as `king_square_count` but for from_sq(move)
 `move`, `move_to_count` - same as `king_square_count` but for to_sq(move)
 `move`, `move_type` - the number of moves with each type. Includes normal, captures, castling, promotions, enpassant. The groups are not disjoint.
 `move`, `moved_piece_type` - the number of times a piece of each type was moved
 `piece_count` - the histogram of the number of pieces on the board
 `ply_discontinuities` - the number of times the ply jumped by a value different than 1 between two consecutive positions. Usually the number of games.
 `material_imbalance` - the histogram of imbalances, with values computed using "simple eval", that is pawn=1, bishop=knight=3, rook=5, queen=9
 `results` - the distribution of game results
 `endgames_6man` - distribution of endgame configurations for <=6 pieces (including kings)
@@ -0,0 +1,42 @@
 # Transform
 `transform` command exposes subcommands that perform some specific transformation over data. The call syntax is `transform <subcommand>`. Currently implemented subcommands are listed and described below.
 ## `nudged_static`
 `transform nudged_static` takes named parameters in the form of `transform nudged_static param_1_name param_1_value param_2_name param_2_value ...` and flag parameters which don't require values.
 This command goes through positions in the input files and replaces the scores with new ones - generated from static eval - but slightly adjusted based on the scores in the original input file.
 Currently the following options are available:
 `input_file` - path to the input file. Supports bin and binpack formats. Default: in.binpack.
 `output_file` - path to the output file. Supports bin and binpack formats. Default: out.binpack.
 `absolute` - states that the adjustment should be bounded by an absolute value. After this token follows the maximum absolute adjustment. Values are always adjusted towards scores in the input file. This is the default mode. Default maximum adjustement: 5.
 `relative` - states that the adjustment should be bounded by a value relative in magnitude to the static eval value. After this token follows the maximum relative change - a floating point value greater than 0. For example a value of 0.1 only allows changing the static eval by at most 10% towards the score from the input file.
 `interpolate` states that the output score should be a value interpolated between static eval and the score from the input file. After this token follows the interpolation constant `t`. `t` of 0 means that only static eval is used. `t` of 1 means that only score from the input file is used. `t` of 0.5 means that the static eval and input score are averaged. It accepts values outside of range `<0, 1>`, but the usefulness is questionable.
 ## `rescore`
 `transform rescore` takes named parameters in the form of `transform rescore param_1_name param_1_value param_2_name param_2_value ...` and flag parameters which don't require values.
 This tool respects the UCI option `Threads` and uses all available threads.
 This command takes a path to the input file that is either a .epd file which contains one FEN per line or a .bin or .binpack file and outputs a .bin or .binpack file with these positions rescored with specified depth search.
 Currently the following options are available:
 `input_file` - path to the input file. Default: in.binpack.
 `output_file` - path to the output .bin or .binpack file. The file is opened in append mode. Default: out.binpack.
 `depth` - the search depth to use for rescoring. Default: 3.
 `keep_moves` - whether to keep moves from the input file if available. Allows to keep compression in .binpack. Default: 1.
 `research_count` - number of additional searches of depth N done on the same position before using the eval. Default: 0.
@@ -0,0 +1,12 @@
 # validate_training_data
 `validate_training_data` allows validation of training data of types `.plain`, `.bin`, and `.binpack`.
 As all commands in stockfish `validate_training_data` can be invoked either from command line (as `stockfish.exe validate_training_data ...`) or in the interactive prompt.
 The syntax of this command is as follows:
 ```
 validate_training_data in_path
 ```
 `in_path` is the path to the file to validate. The type of the data is deduced based on its extension (one of `.plain`, `.bin`, `.binpack`).
@@ -0,0 +1,52 @@
 # `pgn_to_plain`
 This script converts pgn files into text file to apply `learn convert_bin` command. You need to import [python-chess](https://pypi.org/project/python-chess/) to use this script.
    pip install python-chess
 # Example of Qhapaq's finetune using `pgn_to_plain`
 ## Download data
 You can download data from [here](http://rebel13.nl/index.html)
 ## Convert pgn files
 **Important : convert text will be superheavy (approx 200 byte / position)**
    python pgn_to_plain.py --pgn "pgn/*.pgn" --start_ply 1 --output converted_pgn.txt
 `--pgn` option supports wildcard. When you use pgn files with elo >= 3300, You will get 1.7 GB text file.
 ## Convert into training data
 ### Example build command
    make nnue-learn ARCH=x86-64
 See `src/Makefile` for detail.
 ### Convert
    ./stockfish
    learn convert_bin converted_pgn.txt output_file_name pgn_bin.bin
 	learn shuffle pgn_bin.bin
 You also need to prepare validation data for training like following.
 	python pgn_to_plain.py --pgn "pgn/ccrl-40-15-3400.pgn" --start_ply 1 --output ccrl-40-15-3400.txt
 	./stockfish
    learn convert_bin ccrl-40-15-3400.txt ccrl-40-15-3400_plain.bin
 ### Learn
    ./stockfish
 	setoption name Threads value 8
    learn shuffled_sfen.bin newbob_decay 0.5  validation_set_file_name ccrl-40-15-3400_plain.bin  nn_batch_size 50000 batchsize 1000000 eval_save_interval 8000000 eta 0.05 lambda 0.0 eval_limit 3000 mirror_percentage 0 use_draw_in_training 1
@@ -0,0 +1,42 @@
 import sys
 ENTRY_SIZE = 40
 NUM_ENTRIES_IN_CHUNK = 1024*1024
 def copy(infile, outfile, count, times):
    if times > 1:
        outfile.write(infile.read(count*ENTRY_SIZE)*times)
    else:
        offset = 0
        while offset < count:
            to_read = NUM_ENTRIES_IN_CHUNK if offset + NUM_ENTRIES_IN_CHUNK <= count else count - offset
            outfile.write(infile.read(to_read*ENTRY_SIZE))
            offset += NUM_ENTRIES_IN_CHUNK
 def work():
    filename = sys.argv[1]
    offset = int(sys.argv[2])
    count = int(sys.argv[3])
    times = int(sys.argv[4]) if len(sys.argv) >= 5 else 1
    with open(filename, 'rb') as infile:
        infile.seek(offset * ENTRY_SIZE)
        filename_parts = filename.split('.')
        out_path = '.'.join(filename_parts[:-1]) + '_' + str(offset) + '_' + str(count) + '_' + str(times) + '.' + filename_parts[-1]
        with open(out_path, 'wb') as outfile:
            copy(infile, outfile, count, times)
 def show_help():
    print('Usage: python extract_bin.py filename offset count [times]')
    print('filename - the path to the .bin file to process')
    print('offset - the number of sfens to skip')
    print('count - the number of sfens to extract')
    print('times - the number of times to repeat the extracted sfens. Default = 1')
    print('The result is saved in a new file named `filename.stem`_`offset`_`count`_`times`.bin')
 if len(sys.argv) < 4:
    show_help()
 else:
    work()
@@ -0,0 +1,86 @@
 import struct
 import sys
 import os
 import random
 from pathlib import Path
 def copy_next_chunk(in_file, out_file):
    chunk_header = in_file.read(8)
    assert chunk_header[0:4] == b"BINP"
    size = struct.unpack("<I", chunk_header[4:])[0]
    out_file.write(chunk_header)
    data = in_file.read(size)
    out_file.write(data)
    return size + 8
 def main():
    if len(sys.argv) < 4:
        print("Usage: python interleave_binpacks.py infile1 ... infileN outfile")
        print("       The output binpack, will contain all data from the input files.")
        print("       Data is read sequentially from the input, randomly alternating between files.")
        return
    # open last arg as output file name
    out_filename = sys.argv[-1]
    print("outfile: ", out_filename)
    if Path(out_filename).exists():
        print(
            "Output path {} already exists. Please specify a path to a file that does not exist.".format(
                out_filename
            )
        )
        return
    out_file = open(out_filename, "wb")
    # open other args as input file names, and get their sizes
    in_filenames = []
    for i in range(1, len(sys.argv) - 1):
        in_filenames.append(sys.argv[i])
    print("infiles: ", in_filenames)
    in_files = []
    in_files_remaining = []
    for in_filename in in_filenames:
        in_file = open(in_filename, "rb")
        in_files.append(in_file)
        file_size = os.path.getsize(in_filename)
        in_files_remaining.append(file_size)
    # randomly pick a file, with a probability related to their sizes.
    # copy from the front and keep track of remaining sizes
    total_remaining = sum(in_files_remaining)
    print("Merging {} bytes ".format(total_remaining))
    total_size = 0
    report_every = 100
    prev_mib = -report_every
    while total_remaining > 0:
        where = random.randrange(total_remaining)
        i = 0
        while where >= in_files_remaining[i]:
            where -= in_files_remaining[i]
            i += 1
        size = copy_next_chunk(in_files[i], out_file)
        in_files_remaining[i] -= size
        total_remaining -= size
        total_size += size
        mib = total_size // 1024 // 1024
        if mib // 100 != prev_mib // 100:
            print("Copied {} MiB".format(mib))
            prev_mib = mib
    out_file.close()
    for in_file in in_files:
        in_file.close()
    print("Merged  {} bytes".format(total_size))
 main()
@@ -0,0 +1,110 @@
 import chess.pgn
 import argparse
 import glob
 import re
 from typing import List
 # todo close in c++ tools using pgn-extract
 # https://www.cs.kent.ac.uk/people/staff/djb/pgn-extract/help.html#-w
 commentRe = re.compile("([+-]*M*[0-9.]*)/([0-9]*)")
 mateRe = re.compile("([+-])M([0-9]*)")
 flip_black = False
 def parse_result(result_str:str, board:chess.Board) -> int:
    if result_str == "1/2-1/2":
        return 0
    if result_str == "0-1":
        if board.turn == chess.WHITE:
            return -1
        else:
            return 1
    elif result_str == "1-0":
        if board.turn == chess.WHITE:
            return 1
        else:
            return -1
    else:
        print("illegal result", result_str)
        raise ValueError
 def game_sanity_check(game: chess.pgn.Game) -> bool:
    if not game.headers["Result"] in ["1/2-1/2", "0-1", "1-0"]:
        print("invalid result", game.headers["Result"])
        return False
    return True
 def parse_comment_for_score(comment_str: str, board: chess.Board) -> int:
    global commentRe
    global mateRe
    global flip_black
    try:
      m = commentRe.search(comment_str)
      if m:
         score = m.group(1)
         # depth = int(m.group(2))
         m = mateRe.search(score)
         if m:
            if m.group(1) == "+":
               score =  32000 - int(m.group(2))
            else:
               score = -32000 + int(m.group(2))
         else:
            score = int(float(score) * 208) # pawn to SF PawnValueEg
         if flip_black and board.turn == chess.BLACK:
            score = -score
      else:
         score = 0
    except:
      score = 0
    return score
 def parse_game(game: chess.pgn.Game, writer, start_play: int=1)->None:
    board: chess.Board = game.board()
    if not game_sanity_check(game):
        return
    result: str = game.headers["Result"]
    ply = 0
    for node in game.mainline():
        move = node.move
        if ply >= start_play:
            comment: str = node.comment
            writer.write("fen " + board.fen() + "\n")
            writer.write("move " + str(move) + "\n")
            writer.write("score " + str(parse_comment_for_score(comment, board)) + "\n")
            writer.write("ply " + str(ply)+"\n")
            writer.write("result " + str(parse_result(result, board)) +"\n")
            writer.write("e\n")
        ply += 1
        board.push(move)
 def main():
    parser = argparse.ArgumentParser()
    parser.add_argument("--pgn", type=str, required=True)
    parser.add_argument("--start_ply", type=int, default=1)
    parser.add_argument("--output", type=str, default="plain.txt")
    parser.add_argument("--flip_black_score", action='store_true', dest='flip_black_score', help="Flip black score. Default: False")
    args = parser.parse_args()
    global flip_black
    flip_black = args.flip_black_score
    pgn_files: List[str] = glob.glob(args.pgn)
    pgn_files = sorted(pgn_files, key=lambda x:float(re.findall("-(\d+).pgn",x)[0] if re.findall("-(\d+).pgn",x) else 0.0))
    f = open(args.output, 'w')
    for pgn_file in pgn_files:
        print("parse", pgn_file)
        pgn_loader = open(pgn_file)
        while True:
            game = chess.pgn.read_game(pgn_loader)
            if game is None:
                break
            parse_game(game, f, args.start_ply)
    f.close()
 if __name__=="__main__":
    main()
@@ -0,0 +1,89 @@
 import struct
 import sys
 import os
 import random
 from pathlib import Path
 def index_binpack(file):
    print('Indexing...')
    index = []
    offset = 0
    report_every = 100
    prev_mib = -report_every
    while file.peek():
        chunk_header = file.read(8)
        assert chunk_header[0:4] == b'BINP'
        size = struct.unpack('<I', chunk_header[4:])[0]
        file.seek(size, os.SEEK_CUR)
        index.append((offset, size + 8))
        offset += size + 8
        mib = offset // 1024 // 1024
        if mib // 100 != prev_mib // 100:
            print('Indexed {} MiB'.format(mib))
            prev_mib = mib
    return index
 def copy_binpack_indexed(in_file, index, out_files):
    print('Copying...')
    total_size = 0
    report_every = 100
    prev_mib = -report_every
    nextfile = 0
    for offset, size in index:
        in_file.seek(offset, os.SEEK_SET)
        data = in_file.read(size)
        assert len(data) == size
        out_files[nextfile].write(data)
        nextfile = (nextfile + 1) % len(out_files)
        total_size += size
        mib = total_size // 1024 // 1024
        if mib // 100 != prev_mib // 100:
            print('Copied {} MiB'.format(mib))
            prev_mib = mib
 def main():
    if len(sys.argv) < 3:
        print('Usage: python shuffle_binpack.py infile outfile [split_count]')
        return
    in_filename = sys.argv[1]
    if len(sys.argv) > 3:
       # split the infile in split_count pieces, creating new outfile names based on the provided name
       basefile = sys.argv[2]
       split_count = int(sys.argv[3])
       base=os.path.splitext(basefile)[0]
       ext=os.path.splitext(basefile)[1]
       out_filenames = []
       for i in range(split_count):
           out_filenames.append(base+"_{}".format(i)+ext)
    else:
       out_filenames = [sys.argv[2]]
    for out_filename in out_filenames:
      if (Path(out_filename).exists()):
          print('Output path {} already exists. Please specify a path to a file that does not exist.'.format(out_filename))
          return
    print(out_filenames)
    in_file = open(in_filename, 'rb')
    index = index_binpack(in_file)
    print('Shuffling...')
    random.shuffle(index)
    out_files = []
    for out_filename in out_filenames:
        out_files.append(open(out_filename, 'wb'))
    copy_binpack_indexed(in_file, index, out_files)
    in_file.close()
    for out_file in out_files:
        out_file.close()
 main()
@@ -1 +0,0 @@
 *.sh text eol=lf
@@ -1,153 +0,0 @@
 #!/bin/sh
 #
 # Returns properties of the native system.
 # best architecture as supported by the CPU
 # filename of the best binary uploaded as an artifact during CI
 #
 # Check if all the given flags are present in the CPU flags list
 check_flags() {
  for flag; do
    printf '%s\n' "$flags" | grep -q -w "$flag" || return 1
  done
 }
 # Set the CPU flags list
 # remove underscores and points from flags, e.g. gcc uses avx512vnni, while some cpuinfo can have avx512_vnni, some systems use sse4_1 others sse4.1
 get_flags() {
  flags=$(awk '/^flags[ \t]*:|^Features[ \t]*:/{gsub(/^flags[ \t]*:[ \t]*|^Features[ \t]*:[ \t]*|[_.]/, ""); line=$0} END{print line}' /proc/cpuinfo)
 }
 # Check for gcc march "znver1" or "znver2" https://en.wikichip.org/wiki/amd/cpuid
 check_znver_1_2() {
  vendor_id=$(awk '/^vendor_id/{print $3; exit}' /proc/cpuinfo)
  cpu_family=$(awk '/^cpu family/{print $4; exit}' /proc/cpuinfo)
  [ "$vendor_id" = "AuthenticAMD" ] && [ "$cpu_family" = "23" ] && znver_1_2=true
 }
 # Set the file CPU loongarch64 architecture
 set_arch_loongarch64() {
  if check_flags 'lasx'; then
    true_arch='loongarch64-lasx'
  elif check_flags 'lsx'; then
    true_arch='lonngarch64-lsx'
  else
    true_arch='loongarch64'
  fi
 }
 # Set the file CPU x86_64 architecture
 set_arch_x86_64() {
  if check_flags 'avx512vnni' 'avx512dq' 'avx512f' 'avx512bw' 'avx512vl'; then
    true_arch='x86-64-vnni256'
  elif check_flags 'avx512f' 'avx512bw'; then
    true_arch='x86-64-avx512'
  elif [ -z "${znver_1_2+1}" ] && check_flags 'bmi2'; then
    true_arch='x86-64-bmi2'
  elif check_flags 'avx2'; then
    true_arch='x86-64-avx2'
  elif check_flags 'sse41' && check_flags 'popcnt'; then
    true_arch='x86-64-sse41-popcnt'
  else
    true_arch='x86-64'
  fi
 }
 set_arch_ppc_64() {
  if $(grep -q -w "altivec" /proc/cpuinfo); then
    power=$(grep -oP -m 1 'cpu\t+: POWER\K\d+' /proc/cpuinfo)
    if [ "0$power" -gt 7 ]; then
      # VSX started with POWER8
      true_arch='ppc-64-vsx'
    else
      true_arch='ppc-64-altivec'
    fi
  else
    true_arch='ppc-64'
  fi
 }
 # Check the system type
 uname_s=$(uname -s)
 uname_m=$(uname -m)
 case $uname_s in
  'Darwin') # Mac OSX system
    case $uname_m in
      'arm64')
        true_arch='apple-silicon'
        file_arch='m1-apple-silicon'
        ;;
      'x86_64')
        flags=$(sysctl -n machdep.cpu.features machdep.cpu.leaf7_features | tr '\n' ' ' | tr '[:upper:]' '[:lower:]' | tr -d '_.')
        set_arch_x86_64
        if [ "$true_arch" = 'x86-64-vnni256' ] || [ "$true_arch" = 'x86-64-avx512' ]; then
           file_arch='x86-64-bmi2'
        fi
        ;;
    esac
    file_os='macos'
    file_ext='tar'
    ;;
  'Linux') # Linux system
    get_flags
    case $uname_m in
      'x86_64')
        file_os='ubuntu'
        check_znver_1_2
        set_arch_x86_64
        ;;
      'i686')
        file_os='ubuntu'
        true_arch='x86-32'
        ;;
      'ppc64'*)
        file_os='ubuntu'
        set_arch_ppc_64
        ;;
      'aarch64')
        file_os='android'
        true_arch='armv8'
        if check_flags 'asimddp'; then
          true_arch="$true_arch-dotprod"
        fi
        ;;
      'armv7'*)
        file_os='android'
        true_arch='armv7'
        if check_flags 'neon'; then
          true_arch="$true_arch-neon"
        fi
        ;;
      'loongarch64'*)
        file_os='linux'
        set_arch_loongarch64
        ;;
      *) # Unsupported machine type, exit with error
        printf 'Unsupported machine type: %s\n' "$uname_m"
        exit 1
        ;;
    esac
    file_ext='tar'
    ;;
  'CYGWIN'*|'MINGW'*|'MSYS'*) # Windows system with POSIX compatibility layer
    get_flags
    check_znver_1_2
    set_arch_x86_64
    file_os='windows'
    file_ext='zip'
    ;;
  *)
    # Unknown system type, exit with error
    printf 'Unsupported system type: %s\n' "$uname_s"
    exit 1
    ;;
 esac
 if [ -z "$file_arch" ]; then
  file_arch=$true_arch
 fi
 file_name="stockfish-$file_os-$file_arch.$file_ext"
 printf '%s %s\n' "$true_arch" "$file_name"
@@ -1,75 +0,0 @@
 #!/bin/sh
 wget_or_curl=$( (command -v wget > /dev/null 2>&1 && echo "wget -qO-") || \
                (command -v curl > /dev/null 2>&1 && echo "curl -skL"))
 if [ -z "$wget_or_curl" ]; then
  >&2 printf "%s\n" "Neither wget or curl is installed." \
 	         "Install one of these tools to download NNUE files automatically."
  exit 1
 fi
 sha256sum=$( (command -v shasum > /dev/null 2>&1 && echo "shasum -a 256") || \
             (command -v sha256sum > /dev/null 2>&1 && echo "sha256sum"))
 if [ -z "$sha256sum" ]; then
  >&2 echo "sha256sum not found, NNUE files will be assumed valid."
 fi
 get_nnue_filename() {
  grep "$1" evaluate.h | grep "#define" | sed "s/.*\(nn-[a-z0-9]\{12\}.nnue\).*/\1/"
 }
 validate_network() {
  # If no sha256sum command is available, assume the file is always valid.
  if [ -n "$sha256sum" ] && [ -f "$1" ]; then
    if [ "$1" != "nn-$($sha256sum "$1" | cut -c 1-12).nnue" ]; then
      rm -f "$1"
      return 1
    fi
  fi
 }
 fetch_network() {
  _filename="$(get_nnue_filename "$1")"
  if [ -z "$_filename" ]; then
    >&2 echo "NNUE file name not found for: $1"
    return 1
  fi
  if [ -f "$_filename" ]; then
    if validate_network "$_filename"; then
      echo "Existing $_filename validated, skipping download"
      return
    else
      echo "Removing invalid NNUE file: $_filename"
    fi
  fi
  for url in \
    "https://tests.stockfishchess.org/api/nn/$_filename" \
    "https://github.com/official-stockfish/networks/raw/master/$_filename"; do
    echo "Downloading from $url ..."
    if $wget_or_curl "$url" > "$_filename"; then
      if validate_network "$_filename"; then
        echo "Successfully validated $_filename"
      else
        echo "Downloaded $_filename is invalid"
        continue
      fi
    else
      echo "Failed to download from $url"
    fi
    if [ -f "$_filename" ]; then
      return
    fi
  done
  # Download was not successful in the loop, return false.
  >&2 echo "Failed to download $_filename"
  return 1
 }
 fetch_network EvalFileDefaultNameBig && \
 fetch_network EvalFileDefaultNameSmall
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -16,18 +16,18 @@
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "benchmark.h"
 #include "numa.h"
 #include <cstdlib>
 #include <fstream>
 #include <iostream>
 #include <istream>
 #include <vector>
 #include "position.h"
 using namespace std;
 namespace {
-// clang-format off
+const vector<string> Defaults = {
 const std::vector<std::string> Defaults = {
  "setoption name UCI_Chess960 value false",
  "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1",
  "r3k2r/p1ppqpb1/bn2pnp1/3PN3/1p2P3/2N2Q1p/PPPBBPPP/R3K2R w KQkq - 0 10",
@@ -90,423 +90,86 @@ const std::vector<std::string> Defaults = {
  "nqbnrkrb/pppppppp/8/8/8/8/PPPPPPPP/NQBNRKRB w KQkq - 0 1",
  "setoption name UCI_Chess960 value false"
 };
 // clang-format on
-// clang-format off
+} // namespace
 // human-randomly picked 5 games with <60 moves from
 // https://tests.stockfishchess.org/tests/view/665c71f9fd45fb0f907c21e0
 // only moves for one side
 const std::vector<std::vector<std::string>> BenchmarkPositions = {
    {
        "rnbq1k1r/ppp1bppp/4pn2/8/2B5/2NP1N2/PPP2PPP/R1BQR1K1 b - - 2 8",
        "rnbq1k1r/pp2bppp/4pn2/2p5/2B2B2/2NP1N2/PPP2PPP/R2QR1K1 b - - 1 9",
        "r1bq1k1r/pp2bppp/2n1pn2/2p5/2B1NB2/3P1N2/PPP2PPP/R2QR1K1 b - - 3 10",
        "r1bq1k1r/pp2bppp/2n1p3/2p5/2B1PB2/5N2/PPP2PPP/R2QR1K1 b - - 0 11",
        "r1b2k1r/pp2bppp/2n1p3/2p5/2B1PB2/5N2/PPP2PPP/3RR1K1 b - - 0 12",
        "r1b1k2r/pp2bppp/2n1p3/2p5/2B1PB2/2P2N2/PP3PPP/3RR1K1 b - - 0 13",
        "r1b1k2r/1p2bppp/p1n1p3/2p5/4PB2/2P2N2/PP2BPPP/3RR1K1 b - - 1 14",
        "r1b1k2r/4bppp/p1n1p3/1pp5/P3PB2/2P2N2/1P2BPPP/3RR1K1 b - - 0 15",
        "r1b1k2r/4bppp/p1n1p3/1P6/2p1PB2/2P2N2/1P2BPPP/3RR1K1 b - - 0 16",
        "r1b1k2r/4bppp/2n1p3/1p6/2p1PB2/1PP2N2/4BPPP/3RR1K1 b - - 0 17",
        "r3k2r/3bbppp/2n1p3/1p6/2P1PB2/2P2N2/4BPPP/3RR1K1 b - - 0 18",
        "r3k2r/3bbppp/2n1p3/8/1pP1P3/2P2N2/3BBPPP/3RR1K1 b - - 1 19",
        "1r2k2r/3bbppp/2n1p3/8/1pPNP3/2P5/3BBPPP/3RR1K1 b - - 3 20",
        "1r2k2r/3bbppp/2n1p3/8/2PNP3/2B5/4BPPP/3RR1K1 b - - 0 21",
        "1r2k2r/3bb1pp/2n1pp2/1N6/2P1P3/2B5/4BPPP/3RR1K1 b - - 1 22",
        "1r2k2r/3b2pp/2n1pp2/1N6/1BP1P3/8/4BPPP/3RR1K1 b - - 0 23",
        "1r2k2r/3b2pp/4pp2/1N6/1nP1P3/8/3RBPPP/4R1K1 b - - 1 24",
        "1r5r/3bk1pp/4pp2/1N6/1nP1PP2/8/3RB1PP/4R1K1 b - - 0 25",
        "1r5r/3bk1pp/2n1pp2/1N6/2P1PP2/8/3RBKPP/4R3 b - - 2 26",
        "1r5r/3bk1pp/2n2p2/1N2p3/2P1PP2/6P1/3RBK1P/4R3 b - - 0 27",
        "1r1r4/3bk1pp/2n2p2/1N2p3/2P1PP2/6P1/3RBK1P/R7 b - - 2 28",
        "1r1r4/N3k1pp/2n1bp2/4p3/2P1PP2/6P1/3RBK1P/R7 b - - 4 29",
        "1r1r4/3bk1pp/2N2p2/4p3/2P1PP2/6P1/3RBK1P/R7 b - - 0 30",
        "1r1R4/4k1pp/2b2p2/4p3/2P1PP2/6P1/4BK1P/R7 b - - 0 31",
        "3r4/4k1pp/2b2p2/4P3/2P1P3/6P1/4BK1P/R7 b - - 0 32",
        "3r4/R3k1pp/2b5/4p3/2P1P3/6P1/4BK1P/8 b - - 1 33",
        "8/3rk1pp/2b5/R3p3/2P1P3/6P1/4BK1P/8 b - - 3 34",
        "8/3r2pp/2bk4/R1P1p3/4P3/6P1/4BK1P/8 b - - 0 35",
        "8/2kr2pp/2b5/R1P1p3/4P3/4K1P1/4B2P/8 b - - 2 36",
        "1k6/3r2pp/2b5/RBP1p3/4P3/4K1P1/7P/8 b - - 4 37",
        "8/1k1r2pp/2b5/R1P1p3/4P3/3BK1P1/7P/8 b - - 6 38",
        "1k6/3r2pp/2b5/2P1p3/4P3/3BK1P1/7P/R7 b - - 8 39",
        "1k6/r5pp/2b5/2P1p3/4P3/3BK1P1/7P/5R2 b - - 10 40",
        "1k3R2/6pp/2b5/2P1p3/4P3/r2BK1P1/7P/8 b - - 12 41",
        "5R2/2k3pp/2b5/2P1p3/4P3/r2B2P1/3K3P/8 b - - 14 42",
        "5R2/2k3pp/2b5/2P1p3/4P3/3BK1P1/r6P/8 b - - 16 43",
        "5R2/2k3pp/2b5/2P1p3/4P3/r2B2P1/4K2P/8 b - - 18 44",
        "5R2/2k3pp/2b5/2P1p3/4P3/3B1KP1/r6P/8 b - - 20 45",
        "8/2k2Rpp/2b5/2P1p3/4P3/r2B1KP1/7P/8 b - - 22 46",
        "3k4/5Rpp/2b5/2P1p3/4P3/r2B2P1/4K2P/8 b - - 24 47",
        "3k4/5Rpp/2b5/2P1p3/4P3/3B1KP1/r6P/8 b - - 26 48",
        "3k4/5Rpp/2b5/2P1p3/4P3/r2B2P1/4K2P/8 b - - 28 49",
        "3k4/5Rpp/2b5/2P1p3/4P3/3BK1P1/r6P/8 b - - 30 50",
        "3k4/5Rpp/2b5/2P1p3/4P3/r2B2P1/3K3P/8 b - - 32 51",
        "3k4/5Rpp/2b5/2P1p3/4P3/2KB2P1/r6P/8 b - - 34 52",
        "3k4/5Rpp/2b5/2P1p3/4P3/r2B2P1/2K4P/8 b - - 36 53",
        "3k4/5Rpp/2b5/2P1p3/4P3/1K1B2P1/r6P/8 b - - 38 54",
        "3k4/6Rp/2b5/2P1p3/4P3/1K1B2P1/7r/8 b - - 0 55",
        "3k4/8/2b3Rp/2P1p3/4P3/1K1B2P1/7r/8 b - - 1 56",
        "8/2k3R1/2b4p/2P1p3/4P3/1K1B2P1/7r/8 b - - 3 57",
        "3k4/8/2b3Rp/2P1p3/4P3/1K1B2P1/7r/8 b - - 5 58",
        "8/2k5/2b3Rp/2P1p3/1K2P3/3B2P1/7r/8 b - - 7 59",
        "8/2k5/2b3Rp/2P1p3/4P3/2KB2P1/3r4/8 b - - 9 60",
        "8/2k5/2b3Rp/2P1p3/1K2P3/3B2P1/6r1/8 b - - 11 61",
        "8/2k5/2b3Rp/2P1p3/4P3/2KB2P1/3r4/8 b - - 13 62",
        "8/2k5/2b3Rp/2P1p3/2K1P3/3B2P1/6r1/8 b - - 15 63",
        "4b3/2k3R1/7p/2P1p3/2K1P3/3B2P1/6r1/8 b - - 17 64",
    },
    {
        "r1bqkbnr/npp1pppp/p7/3P4/4pB2/2N5/PPP2PPP/R2QKBNR w KQkq - 1 6",
        "r1bqkb1r/npp1pppp/p4n2/3P4/4pB2/2N5/PPP1QPPP/R3KBNR w KQkq - 3 7",
        "r2qkb1r/npp1pppp/p4n2/3P1b2/4pB2/2N5/PPP1QPPP/2KR1BNR w kq - 5 8",
        "r2qkb1r/1pp1pppp/p4n2/1n1P1b2/4pB2/2N4P/PPP1QPP1/2KR1BNR w kq - 1 9",
        "r2qkb1r/1pp1pppp/5n2/1p1P1b2/4pB2/7P/PPP1QPP1/2KR1BNR w kq - 0 10",
        "r2qkb1r/1ppbpppp/5n2/1Q1P4/4pB2/7P/PPP2PP1/2KR1BNR w kq - 1 11",
        "3qkb1r/1Qpbpppp/5n2/3P4/4pB2/7P/rPP2PP1/2KR1BNR w k - 0 12",
        "q3kb1r/1Qpbpppp/5n2/3P4/4pB2/7P/rPP2PP1/1K1R1BNR w k - 2 13",
        "r3kb1r/2pbpppp/5n2/3P4/4pB2/7P/1PP2PP1/1K1R1BNR w k - 0 14",
        "r3kb1r/2Bb1ppp/4pn2/3P4/4p3/7P/1PP2PP1/1K1R1BNR w k - 0 15",
        "r3kb1r/2Bb2pp/4pn2/8/4p3/7P/1PP2PP1/1K1R1BNR w k - 0 16",
        "r3k2r/2Bb2pp/4pn2/2b5/4p3/7P/1PP1NPP1/1K1R1B1R w k - 2 17",
        "r6r/2Bbk1pp/4pn2/2b5/3Np3/7P/1PP2PP1/1K1R1B1R w - - 4 18",
        "r6r/b2bk1pp/4pn2/4B3/3Np3/7P/1PP2PP1/1K1R1B1R w - - 6 19",
        "r1r5/b2bk1pp/4pn2/4B3/2BNp3/7P/1PP2PP1/1K1R3R w - - 8 20",
        "r7/b2bk1pp/4pn2/2r1B3/2BNp3/1P5P/2P2PP1/1K1R3R w - - 1 21",
        "rb6/3bk1pp/4pn2/2r1B3/2BNpP2/1P5P/2P3P1/1K1R3R w - - 1 22",
        "1r6/3bk1pp/4pn2/2r5/2BNpP2/1P5P/2P3P1/1K1R3R w - - 0 23",
        "1r6/3bk1p1/4pn1p/2r5/2BNpP2/1P5P/2P3P1/2KR3R w - - 0 24",
        "8/3bk1p1/1r2pn1p/2r5/2BNpP1P/1P6/2P3P1/2KR3R w - - 1 25",
        "8/3bk3/1r2pnpp/2r5/2BNpP1P/1P6/2P3P1/2K1R2R w - - 0 26",
        "2b5/4k3/1r2pnpp/2r5/2BNpP1P/1P4P1/2P5/2K1R2R w - - 1 27",
        "8/1b2k3/1r2pnpp/2r5/2BNpP1P/1P4P1/2P5/2K1R1R1 w - - 3 28",
        "8/1b1nk3/1r2p1pp/2r5/2BNpPPP/1P6/2P5/2K1R1R1 w - - 1 29",
        "8/1b2k3/1r2p1pp/2r1nP2/2BNp1PP/1P6/2P5/2K1R1R1 w - - 1 30",
        "8/1b2k3/1r2p1p1/2r1nPp1/2BNp2P/1P6/2P5/2K1R1R1 w - - 0 31",
        "8/1b2k3/1r2p1n1/2r3p1/2BNp2P/1P6/2P5/2K1R1R1 w - - 0 32",
        "8/1b2k3/1r2p1n1/6r1/2BNp2P/1P6/2P5/2K1R3 w - - 0 33",
        "8/1b2k3/1r2p3/4n1P1/2BNp3/1P6/2P5/2K1R3 w - - 1 34",
        "8/1b2k3/1r2p3/4n1P1/2BN4/1P2p3/2P5/2K4R w - - 0 35",
        "8/1b2k3/1r2p2R/6P1/2nN4/1P2p3/2P5/2K5 w - - 0 36",
        "8/1b2k3/3rp2R/6P1/2PN4/4p3/2P5/2K5 w - - 1 37",
        "8/4k3/3rp2R/6P1/2PN4/2P1p3/6b1/2K5 w - - 1 38",
        "8/4k3/r3p2R/2P3P1/3N4/2P1p3/6b1/2K5 w - - 1 39",
        "8/3k4/r3p2R/2P2NP1/8/2P1p3/6b1/2K5 w - - 3 40",
        "8/3k4/4p2R/2P3P1/8/2P1N3/6b1/r1K5 w - - 1 41",
        "8/3k4/4p2R/2P3P1/8/2P1N3/3K2b1/6r1 w - - 3 42",
        "8/3k4/4p2R/2P3P1/8/2PKNb2/8/6r1 w - - 5 43",
        "8/4k3/4p1R1/2P3P1/8/2PKNb2/8/6r1 w - - 7 44",
        "8/4k3/4p1R1/2P3P1/3K4/2P1N3/8/6rb w - - 9 45",
        "8/3k4/4p1R1/2P1K1P1/8/2P1N3/8/6rb w - - 11 46",
        "8/3k4/4p1R1/2P3P1/5K2/2P1N3/8/4r2b w - - 13 47",
        "8/3k4/2b1p2R/2P3P1/5K2/2P1N3/8/4r3 w - - 15 48",
        "8/3k4/2b1p3/2P3P1/5K2/2P1N2R/8/6r1 w - - 17 49",
        "2k5/7R/2b1p3/2P3P1/5K2/2P1N3/8/6r1 w - - 19 50",
        "2k5/7R/4p3/2P3P1/b1P2K2/4N3/8/6r1 w - - 1 51",
        "2k5/3bR3/4p3/2P3P1/2P2K2/4N3/8/6r1 w - - 3 52",
        "3k4/3b2R1/4p3/2P3P1/2P2K2/4N3/8/6r1 w - - 5 53",
        "3kb3/6R1/4p1P1/2P5/2P2K2/4N3/8/6r1 w - - 1 54",
        "3kb3/6R1/4p1P1/2P5/2P2KN1/8/8/2r5 w - - 3 55",
        "3kb3/6R1/4p1P1/2P1N3/2P2K2/8/8/5r2 w - - 5 56",
        "3kb3/6R1/4p1P1/2P1N3/2P5/4K3/8/4r3 w - - 7 57",
    },
    {
        "rnbq1rk1/ppp1npb1/4p1p1/3P3p/3PP3/2N2N2/PP2BPPP/R1BQ1RK1 b - - 0 8",
        "rnbq1rk1/ppp1npb1/6p1/3pP2p/3P4/2N2N2/PP2BPPP/R1BQ1RK1 b - - 0 9",
        "rn1q1rk1/ppp1npb1/6p1/3pP2p/3P2b1/2N2N2/PP2BPPP/R1BQR1K1 b - - 2 10",
        "r2q1rk1/ppp1npb1/2n3p1/3pP2p/3P2bN/2N5/PP2BPPP/R1BQR1K1 b - - 4 11",
        "r4rk1/pppqnpb1/2n3p1/3pP2p/3P2bN/2N4P/PP2BPP1/R1BQR1K1 b - - 0 12",
        "r4rk1/pppqnpb1/2n3p1/3pP2p/3P3N/7P/PP2NPP1/R1BQR1K1 b - - 0 13",
        "r4rk1/pppq1pb1/2n3p1/3pPN1p/3P4/7P/PP2NPP1/R1BQR1K1 b - - 0 14",
        "r4rk1/ppp2pb1/2n3p1/3pPq1p/3P1N2/7P/PP3PP1/R1BQR1K1 b - - 1 15",
        "r4rk1/pppq1pb1/2n3p1/3pP2p/P2P1N2/7P/1P3PP1/R1BQR1K1 b - - 0 16",
        "r2n1rk1/pppq1pb1/6p1/3pP2p/P2P1N2/R6P/1P3PP1/2BQR1K1 b - - 2 17",
        "r4rk1/pppq1pb1/4N1p1/3pP2p/P2P4/R6P/1P3PP1/2BQR1K1 b - - 0 18",
        "r4rk1/ppp2pb1/4q1p1/3pP1Bp/P2P4/R6P/1P3PP1/3QR1K1 b - - 1 19",
        "r3r1k1/ppp2pb1/4q1p1/3pP1Bp/P2P1P2/R6P/1P4P1/3QR1K1 b - - 0 20",
        "r3r1k1/ppp3b1/4qpp1/3pP2p/P2P1P1B/R6P/1P4P1/3QR1K1 b - - 1 21",
        "r3r1k1/ppp3b1/4q1p1/3pP2p/P4P1B/R6P/1P4P1/3QR1K1 b - - 0 22",
        "r4rk1/ppp3b1/4q1p1/3pP1Bp/P4P2/R6P/1P4P1/3QR1K1 b - - 2 23",
        "r4rk1/pp4b1/4q1p1/2ppP1Bp/P4P2/3R3P/1P4P1/3QR1K1 b - - 1 24",
        "r4rk1/pp4b1/4q1p1/2p1P1Bp/P2p1PP1/3R3P/1P6/3QR1K1 b - - 0 25",
        "r4rk1/pp4b1/4q1p1/2p1P1B1/P2p1PP1/3R4/1P6/3QR1K1 b - - 0 26",
        "r5k1/pp3rb1/4q1p1/2p1P1B1/P2p1PP1/6R1/1P6/3QR1K1 b - - 2 27",
        "5rk1/pp3rb1/4q1p1/2p1P1B1/P2pRPP1/6R1/1P6/3Q2K1 b - - 4 28",
        "5rk1/1p3rb1/p3q1p1/P1p1P1B1/3pRPP1/6R1/1P6/3Q2K1 b - - 0 29",
        "4r1k1/1p3rb1/p3q1p1/P1p1P1B1/3pRPP1/1P4R1/8/3Q2K1 b - - 0 30",
        "4r1k1/5rb1/pP2q1p1/2p1P1B1/3pRPP1/1P4R1/8/3Q2K1 b - - 0 31",
        "4r1k1/5rb1/pq4p1/2p1P1B1/3pRPP1/1P4R1/4Q3/6K1 b - - 1 32",
        "4r1k1/1r4b1/pq4p1/2p1P1B1/3pRPP1/1P4R1/2Q5/6K1 b - - 3 33",
        "4r1k1/1r4b1/1q4p1/p1p1P1B1/3p1PP1/1P4R1/2Q5/4R1K1 b - - 1 34",
        "4r1k1/3r2b1/1q4p1/p1p1P1B1/2Qp1PP1/1P4R1/8/4R1K1 b - - 3 35",
        "4r1k1/3r2b1/4q1p1/p1p1P1B1/2Qp1PP1/1P4R1/5K2/4R3 b - - 5 36",
        "4r1k1/3r2b1/6p1/p1p1P1B1/2Pp1PP1/6R1/5K2/4R3 b - - 0 37",
        "4r1k1/3r2b1/6p1/p1p1P1B1/2P2PP1/3p2R1/5K2/3R4 b - - 1 38",
        "5rk1/3r2b1/6p1/p1p1P1B1/2P2PP1/3p2R1/8/3RK3 b - - 3 39",
        "5rk1/6b1/6p1/p1p1P1B1/2Pr1PP1/3R4/8/3RK3 b - - 0 40",
        "5rk1/3R2b1/6p1/p1p1P1B1/2r2PP1/8/8/3RK3 b - - 1 41",
        "5rk1/3R2b1/6p1/p1p1P1B1/4rPP1/8/3K4/3R4 b - - 3 42",
        "1r4k1/3R2b1/6p1/p1p1P1B1/4rPP1/2K5/8/3R4 b - - 5 43",
        "1r4k1/3R2b1/6p1/p1p1P1B1/2K2PP1/4r3/8/3R4 b - - 7 44",
        "1r3bk1/8/3R2p1/p1p1P1B1/2K2PP1/4r3/8/3R4 b - - 9 45",
        "1r3bk1/8/6R1/2p1P1B1/p1K2PP1/4r3/8/3R4 b - - 0 46",
        "1r3b2/5k2/R7/2p1P1B1/p1K2PP1/4r3/8/3R4 b - - 2 47",
        "5b2/1r3k2/R7/2p1P1B1/p1K2PP1/4r3/8/7R b - - 4 48",
        "5b2/5k2/R7/2pKP1B1/pr3PP1/4r3/8/7R b - - 6 49",
        "5b2/5k2/R1K5/2p1P1B1/p2r1PP1/4r3/8/7R b - - 8 50",
        "8/R4kb1/2K5/2p1P1B1/p2r1PP1/4r3/8/7R b - - 10 51",
        "8/R5b1/2K3k1/2p1PPB1/p2r2P1/4r3/8/7R b - - 0 52",
        "8/6R1/2K5/2p1PPk1/p2r2P1/4r3/8/7R b - - 0 53",
        "8/6R1/2K5/2p1PP2/p2r1kP1/4r3/8/5R2 b - - 2 54",
        "8/6R1/2K2P2/2p1P3/p2r2P1/4r1k1/8/5R2 b - - 0 55",
        "8/5PR1/2K5/2p1P3/p2r2P1/4r3/6k1/5R2 b - - 0 56",
    },
    {
        "rn1qkb1r/p1pbpppp/5n2/8/2pP4/2N5/1PQ1PPPP/R1B1KBNR w KQkq - 0 7",
        "r2qkb1r/p1pbpppp/2n2n2/8/2pP4/2N2N2/1PQ1PPPP/R1B1KB1R w KQkq - 2 8",
        "r2qkb1r/p1pbpppp/5n2/8/1npPP3/2N2N2/1PQ2PPP/R1B1KB1R w KQkq - 1 9",
        "r2qkb1r/p1pb1ppp/4pn2/8/1npPP3/2N2N2/1P3PPP/R1BQKB1R w KQkq - 0 10",
        "r2qk2r/p1pbbppp/4pn2/8/1nBPP3/2N2N2/1P3PPP/R1BQK2R w KQkq - 1 11",
        "r2q1rk1/p1pbbppp/4pn2/8/1nBPP3/2N2N2/1P3PPP/R1BQ1RK1 w - - 3 12",
        "r2q1rk1/2pbbppp/p3pn2/8/1nBPPB2/2N2N2/1P3PPP/R2Q1RK1 w - - 0 13",
        "r2q1rk1/2p1bppp/p3pn2/1b6/1nBPPB2/2N2N2/1P3PPP/R2QR1K1 w - - 2 14",
        "r2q1rk1/4bppp/p1p1pn2/1b6/1nBPPB2/1PN2N2/5PPP/R2QR1K1 w - - 0 15",
        "r4rk1/3qbppp/p1p1pn2/1b6/1nBPPB2/1PN2N2/3Q1PPP/R3R1K1 w - - 2 16",
        "r4rk1/1q2bppp/p1p1pn2/1b6/1nBPPB2/1PN2N1P/3Q1PP1/R3R1K1 w - - 1 17",
        "r3r1k1/1q2bppp/p1p1pn2/1b6/1nBPPB2/1PN2N1P/4QPP1/R3R1K1 w - - 3 18",
        "r3r1k1/1q1nbppp/p1p1p3/1b6/1nBPPB2/1PN2N1P/4QPP1/3RR1K1 w - - 5 19",
        "r3rbk1/1q1n1ppp/p1p1p3/1b6/1nBPPB2/1PN2N1P/3RQPP1/4R1K1 w - - 7 20",
        "r3rbk1/1q3ppp/pnp1p3/1b6/1nBPPB2/1PN2N1P/3RQPP1/4R2K w - - 9 21",
        "2r1rbk1/1q3ppp/pnp1p3/1b6/1nBPPB2/1PN2N1P/3RQPP1/1R5K w - - 11 22",
        "2r1rbk1/1q4pp/pnp1pp2/1b6/1nBPPB2/1PN2N1P/4QPP1/1R1R3K w - - 0 23",
        "2r1rbk1/5qpp/pnp1pp2/1b6/1nBPP3/1PN1BN1P/4QPP1/1R1R3K w - - 2 24",
        "2r1rbk1/5qp1/pnp1pp1p/1b6/1nBPP3/1PN1BN1P/4QPP1/1R1R2K1 w - - 0 25",
        "2r1rbk1/5qp1/pnp1pp1p/1b6/2BPP3/1P2BN1P/n3QPP1/1R1R2K1 w - - 0 26",
        "r3rbk1/5qp1/pnp1pp1p/1b6/2BPP3/1P2BN1P/Q4PP1/1R1R2K1 w - - 1 27",
        "rr3bk1/5qp1/pnp1pp1p/1b6/2BPP3/1P2BN1P/Q4PP1/R2R2K1 w - - 3 28",
        "rr2qbk1/6p1/pnp1pp1p/1b6/2BPP3/1P2BN1P/4QPP1/R2R2K1 w - - 5 29",
        "rr2qbk1/6p1/1np1pp1p/pb6/2BPP3/1P1QBN1P/5PP1/R2R2K1 w - - 0 30",
        "rr2qbk1/6p1/1n2pp1p/pp6/3PP3/1P1QBN1P/5PP1/R2R2K1 w - - 0 31",
        "rr2qbk1/6p1/1n2pp1p/1p1P4/p3P3/1P1QBN1P/5PP1/R2R2K1 w - - 0 32",
        "rr2qbk1/3n2p1/3Ppp1p/1p6/p3P3/1P1QBN1P/5PP1/R2R2K1 w - - 1 33",
        "rr3bk1/3n2p1/3Ppp1p/1p5q/pP2P3/3QBN1P/5PP1/R2R2K1 w - - 1 34",
        "rr3bk1/3n2p1/3Ppp1p/1p5q/1P2P3/p2QBN1P/5PP1/2RR2K1 w - - 0 35",
        "1r3bk1/3n2p1/r2Ppp1p/1p5q/1P2P3/pQ2BN1P/5PP1/2RR2K1 w - - 2 36",
        "1r2qbk1/2Rn2p1/r2Ppp1p/1p6/1P2P3/pQ2BN1P/5PP1/3R2K1 w - - 4 37",
        "1r2qbk1/2Rn2p1/r2Ppp1p/1pB5/1P2P3/1Q3N1P/p4PP1/3R2K1 w - - 0 38",
        "1r2q1k1/2Rn2p1/r2bpp1p/1pB5/1P2P3/1Q3N1P/p4PP1/R5K1 w - - 0 39",
        "1r2q1k1/2Rn2p1/3rpp1p/1p6/1P2P3/1Q3N1P/p4PP1/R5K1 w - - 0 40",
        "2r1q1k1/2Rn2p1/3rpp1p/1p6/1P2P3/5N1P/Q4PP1/R5K1 w - - 1 41",
        "1r2q1k1/1R1n2p1/3rpp1p/1p6/1P2P3/5N1P/Q4PP1/R5K1 w - - 3 42",
        "2r1q1k1/2Rn2p1/3rpp1p/1p6/1P2P3/5N1P/Q4PP1/R5K1 w - - 5 43",
        "1r2q1k1/1R1n2p1/3rpp1p/1p6/1P2P3/5N1P/Q4PP1/R5K1 w - - 7 44",
        "1rq3k1/R2n2p1/3rpp1p/1p6/1P2P3/5N1P/Q4PP1/R5K1 w - - 9 45",
        "2q3k1/Rr1n2p1/3rpp1p/1p6/1P2P3/5N1P/4QPP1/R5K1 w - - 11 46",
        "Rrq3k1/3n2p1/3rpp1p/1p6/1P2P3/5N1P/4QPP1/R5K1 w - - 13 47",
    },
    {
        "rn1qkb1r/1pp2ppp/p4p2/3p1b2/5P2/1P2PN2/P1PP2PP/RN1QKB1R b KQkq - 1 6",
        "r2qkb1r/1pp2ppp/p1n2p2/3p1b2/3P1P2/1P2PN2/P1P3PP/RN1QKB1R b KQkq - 0 7",
        "r2qkb1r/1pp2ppp/p4p2/3p1b2/1n1P1P2/1P1BPN2/P1P3PP/RN1QK2R b KQkq - 2 8",
        "r2qkb1r/1pp2ppp/p4p2/3p1b2/3P1P2/1P1PPN2/P5PP/RN1QK2R b KQkq - 0 9",
        "r2qk2r/1pp2ppp/p2b1p2/3p1b2/3P1P2/1PNPPN2/P5PP/R2QK2R b KQkq - 2 10",
        "r2qk2r/1p3ppp/p1pb1p2/3p1b2/3P1P2/1PNPPN2/P5PP/R2Q1RK1 b kq - 1 11",
        "r2q1rk1/1p3ppp/p1pb1p2/3p1b2/3P1P2/1PNPPN2/P2Q2PP/R4RK1 b - - 3 12",
        "r2qr1k1/1p3ppp/p1pb1p2/3p1b2/3P1P2/1P1PPN2/P2QN1PP/R4RK1 b - - 5 13",
        "r3r1k1/1p3ppp/pqpb1p2/3p1b2/3P1P2/1P1PPNN1/P2Q2PP/R4RK1 b - - 7 14",
        "r3r1k1/1p3ppp/pqp2p2/3p1b2/1b1P1P2/1P1PPNN1/P1Q3PP/R4RK1 b - - 9 15",
        "r3r1k1/1p1b1ppp/pqp2p2/3p4/1b1P1P2/1P1PPNN1/P4QPP/R4RK1 b - - 11 16",
        "2r1r1k1/1p1b1ppp/pqp2p2/3p4/1b1PPP2/1P1P1NN1/P4QPP/R4RK1 b - - 0 17",
        "2r1r1k1/1p1b1ppp/pq3p2/2pp4/1b1PPP2/PP1P1NN1/5QPP/R4RK1 b - - 0 18",
        "2r1r1k1/1p1b1ppp/pq3p2/2Pp4/4PP2/PPbP1NN1/5QPP/R4RK1 b - - 0 19",
        "2r1r1k1/1p1b1ppp/p4p2/2Pp4/4PP2/PqbP1NN1/5QPP/RR4K1 b - - 1 20",
        "2r1r1k1/1p1b1ppp/p4p2/2Pp4/q3PP2/P1bP1NN1/R4QPP/1R4K1 b - - 3 21",
        "2r1r1k1/1p3ppp/p4p2/1bPP4/q4P2/P1bP1NN1/R4QPP/1R4K1 b - - 0 22",
        "2r1r1k1/1p3ppp/p4p2/2PP4/q4P2/P1bb1NN1/R4QPP/2R3K1 b - - 1 23",
        "2r1r1k1/1p3ppp/p2P1p2/2P5/2q2P2/P1bb1NN1/R4QPP/2R3K1 b - - 0 24",
        "2rr2k1/1p3ppp/p2P1p2/2P5/2q2P2/P1bb1NN1/R4QPP/2R4K b - - 2 25",
        "2rr2k1/1p3ppp/p2P1p2/2Q5/5P2/P1bb1NN1/R5PP/2R4K b - - 0 26",
        "3r2k1/1p3ppp/p2P1p2/2r5/5P2/P1bb1N2/R3N1PP/2R4K b - - 1 27",
        "3r2k1/1p3ppp/p2P1p2/2r5/5P2/P1b2N2/4R1PP/2R4K b - - 0 28",
        "3r2k1/1p3ppp/p2P1p2/2r5/1b3P2/P4N2/4R1PP/3R3K b - - 2 29",
        "3r2k1/1p2Rppp/p2P1p2/b1r5/5P2/P4N2/6PP/3R3K b - - 4 30",
        "3r2k1/1R3ppp/p1rP1p2/b7/5P2/P4N2/6PP/3R3K b - - 0 31",
        "3r2k1/1R3ppp/p2R1p2/b7/5P2/P4N2/6PP/7K b - - 0 32",
        "6k1/1R3ppp/p2r1p2/b7/5P2/P4NP1/7P/7K b - - 0 33",
        "6k1/1R3p1p/p2r1pp1/b7/5P1P/P4NP1/8/7K b - - 0 34",
        "6k1/3R1p1p/pr3pp1/b7/5P1P/P4NP1/8/7K b - - 2 35",
        "6k1/5p2/pr3pp1/b2R3p/5P1P/P4NP1/8/7K b - - 1 36",
        "6k1/5p2/pr3pp1/7p/5P1P/P1bR1NP1/8/7K b - - 3 37",
        "6k1/5p2/p1r2pp1/7p/5P1P/P1bR1NP1/6K1/8 b - - 5 38",
        "6k1/5p2/p1r2pp1/b2R3p/5P1P/P4NP1/6K1/8 b - - 7 39",
        "6k1/5p2/p4pp1/b2R3p/5P1P/P4NPK/2r5/8 b - - 9 40",
        "6k1/2b2p2/p4pp1/7p/5P1P/P2R1NPK/2r5/8 b - - 11 41",
        "6k1/2b2p2/5pp1/p6p/3N1P1P/P2R2PK/2r5/8 b - - 1 42",
        "6k1/2b2p2/5pp1/p6p/3N1P1P/P1R3PK/r7/8 b - - 3 43",
        "6k1/5p2/1b3pp1/p6p/5P1P/P1R3PK/r1N5/8 b - - 5 44",
        "8/5pk1/1bR2pp1/p6p/5P1P/P5PK/r1N5/8 b - - 7 45",
        "3b4/5pk1/2R2pp1/p4P1p/7P/P5PK/r1N5/8 b - - 0 46",
        "8/4bpk1/2R2pp1/p4P1p/6PP/P6K/r1N5/8 b - - 0 47",
        "8/5pk1/2R2pP1/p6p/6PP/b6K/r1N5/8 b - - 0 48",
        "8/6k1/2R2pp1/p6P/7P/b6K/r1N5/8 b - - 0 49",
        "8/6k1/2R2p2/p6p/7P/b5K1/r1N5/8 b - - 1 50",
        "8/8/2R2pk1/p6p/7P/b4K2/r1N5/8 b - - 3 51",
        "8/8/2R2pk1/p6p/7P/4NK2/rb6/8 b - - 5 52",
        "2R5/8/5pk1/7p/p6P/4NK2/rb6/8 b - - 1 53",
        "6R1/8/5pk1/7p/p6P/4NK2/1b6/r7 b - - 3 54",
        "R7/5k2/5p2/7p/p6P/4NK2/1b6/r7 b - - 5 55",
        "R7/5k2/5p2/7p/7P/p3N3/1b2K3/r7 b - - 1 56",
        "8/R4k2/5p2/7p/7P/p3N3/1b2K3/7r b - - 3 57",
        "8/8/5pk1/7p/R6P/p3N3/1b2K3/7r b - - 5 58",
        "8/8/5pk1/7p/R6P/p7/4K3/2bN3r b - - 7 59",
        "8/8/5pk1/7p/R6P/p7/4KN1r/2b5 b - - 9 60",
        "8/8/5pk1/7p/R6P/p3K3/1b3N1r/8 b - - 11 61",
        "8/8/R4pk1/7p/7P/p1b1K3/5N1r/8 b - - 13 62",
        "8/8/5pk1/7p/7P/2b1K3/R4N1r/8 b - - 0 63",
        "8/8/5pk1/7p/3K3P/8/R4N1r/4b3 b - - 2 64",
    }
 };
 // clang-format on
-}  // namespace
+namespace Stockfish {
-namespace Stockfish::Benchmark {
+/// setup_bench() builds a list of UCI commands to be run by bench. There
 /// are five parameters: TT size in MB, number of search threads that
 /// should be used, the limit value spent for each position, a file name
 /// where to look for positions in FEN format, the type of the limit:
 /// depth, perft, nodes and movetime (in millisecs), and evaluation type
 /// mixed (default), classical, NNUE.
 ///
 /// bench -> search default positions up to depth 13
 /// bench 64 1 15 -> search default positions up to depth 15 (TT = 64MB)
 /// bench 64 4 5000 current movetime -> search current position with 4 threads for 5 sec
 /// bench 64 1 100000 default nodes -> search default positions for 100K nodes each
 /// bench 16 1 5 default perft -> run a perft 5 on default positions
-// Builds a list of UCI commands to be run by bench. There
+vector<string> setup_bench(const Position& current, istream& is) {
 // are five parameters: TT size in MB, number of search threads that
 // should be used, the limit value spent for each position, a file name
 // where to look for positions in FEN format, and the type of the limit:
 // depth, perft, nodes and movetime (in milliseconds). Examples:
 //
 // bench                            : search default positions up to depth 13
 // bench 64 1 15                    : search default positions up to depth 15 (TT = 64MB)
 // bench 64 1 100000 default nodes  : search default positions for 100K nodes each
 // bench 64 4 5000 current movetime : search current position with 4 threads for 5 sec
 // bench 16 1 5 blah perft          : run a perft 5 on positions in file "blah"
 std::vector<std::string> setup_bench(const std::string& currentFen, std::istream& is) {
-    std::vector<std::string> fens, list;
+  vector<string> fens, list;
-    std::string              go, token;
+  string go, token;
-    // Assign default values to missing arguments
+  // Assign default values to missing arguments
-    std::string ttSize    = (is >> token) ? token : "16";
+  string ttSize    = (is >> token) ? token : "16";
-    std::string threads   = (is >> token) ? token : "1";
+  string threads   = (is >> token) ? token : "1";
-    std::string limit     = (is >> token) ? token : "13";
+  string limit     = (is >> token) ? token : "13";
-    std::string fenFile   = (is >> token) ? token : "default";
+  string fenFile   = (is >> token) ? token : "default";
-    std::string limitType = (is >> token) ? token : "depth";
+  string limitType = (is >> token) ? token : "depth";
  string evalType  = (is >> token) ? token : "mixed";
-    go = limitType == "eval" ? "eval" : "go " + limitType + " " + limit;
+  go = limitType == "eval" ? "eval" : "go " + limitType + " " + limit;
-    if (fenFile == "default")
+  if (fenFile == "default")
-        fens = Defaults;
+      fens = Defaults;
-    else if (fenFile == "current")
+  else if (fenFile == "current")
-        fens.push_back(currentFen);
+      fens.push_back(current.fen());
-    else
+  else
-    {
+  {
-        std::string   fen;
+      string fen;
-        std::ifstream file(fenFile);
+      ifstream file(fenFile);
-        if (!file.is_open())
+      if (!file.is_open())
-        {
+      {
-            std::cerr << "Unable to open file " << fenFile << std::endl;
+          cerr << "Unable to open file " << fenFile << endl;
-            exit(EXIT_FAILURE);
+          exit(EXIT_FAILURE);
-        }
+      }
-        while (getline(file, fen))
+      while (getline(file, fen))
-            if (!fen.empty())
+          if (!fen.empty())
-                fens.push_back(fen);
+              fens.push_back(fen);
-        file.close();
+      file.close();
-    }
+  }
-    list.emplace_back("setoption name Threads value " + threads);
+  list.emplace_back("setoption name Threads value " + threads);
-    list.emplace_back("setoption name Hash value " + ttSize);
+  list.emplace_back("setoption name Hash value " + ttSize);
-    list.emplace_back("ucinewgame");
+  list.emplace_back("ucinewgame");
-    for (const std::string& fen : fens)
+  size_t posCounter = 0;
        if (fen.find("setoption") != std::string::npos)
            list.emplace_back(fen);
        else
        {
            list.emplace_back("position fen " + fen);
            list.emplace_back(go);
        }
-    return list;
+  for (const string& fen : fens)
      if (fen.find("setoption") != string::npos)
          list.emplace_back(fen);
      else
      {
          if (evalType == "classical" || (evalType == "mixed" && posCounter % 2 == 0))
              list.emplace_back("setoption name Use NNUE value false");
          else if (evalType == "NNUE" || (evalType == "mixed" && posCounter % 2 != 0))
              list.emplace_back("setoption name Use NNUE value true");
          list.emplace_back("position fen " + fen);
          list.emplace_back(go);
          ++posCounter;
      }
  list.emplace_back("setoption name Use NNUE value true");
  return list;
 }
-BenchmarkSetup setup_benchmark(std::istream& is) {
+} // namespace Stockfish
    // TT_SIZE_PER_THREAD is chosen such that roughly half of the hash is used all positions
    // for the current sequence have been searched.
    static constexpr int TT_SIZE_PER_THREAD = 128;
    static constexpr int DEFAULT_DURATION_S = 150;
    BenchmarkSetup setup{};
    // Assign default values to missing arguments
    int desiredTimeS;
    if (!(is >> setup.threads))
        setup.threads = get_hardware_concurrency();
    else
        setup.originalInvocation += std::to_string(setup.threads);
    if (!(is >> setup.ttSize))
        setup.ttSize = TT_SIZE_PER_THREAD * setup.threads;
    else
        setup.originalInvocation += " " + std::to_string(setup.ttSize);
    if (!(is >> desiredTimeS))
        desiredTimeS = DEFAULT_DURATION_S;
    else
        setup.originalInvocation += " " + std::to_string(desiredTimeS);
    setup.filledInvocation += std::to_string(setup.threads) + " " + std::to_string(setup.ttSize)
                            + " " + std::to_string(desiredTimeS);
    auto getCorrectedTime = [&](int ply) {
        // time per move is fit roughly based on LTC games
        // seconds = 50/{ply+15}
        // ms = 50000/{ply+15}
        // with this fit 10th move gets 2000ms
        // adjust for desired 10th move time
        return 50000.0 / (static_cast<double>(ply) + 15.0);
    };
    float totalTime = 0;
    for (const auto& game : BenchmarkPositions)
    {
        setup.commands.emplace_back("ucinewgame");
        int ply = 1;
        for (int i = 0; i < static_cast<int>(game.size()); ++i)
        {
            const float correctedTime = getCorrectedTime(ply);
            totalTime += correctedTime;
            ply += 1;
        }
    }
    float timeScaleFactor = static_cast<float>(desiredTimeS * 1000) / totalTime;
    for (const auto& game : BenchmarkPositions)
    {
        setup.commands.emplace_back("ucinewgame");
        int ply = 1;
        for (const std::string& fen : game)
        {
            setup.commands.emplace_back("position fen " + fen);
            const int correctedTime = static_cast<int>(getCorrectedTime(ply) * timeScaleFactor);
            setup.commands.emplace_back("go movetime " + std::to_string(correctedTime));
            ply += 1;
        }
    }
    return setup;
 }
 }  // namespace Stockfish
@@ -0,0 +1,172 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include <cassert>
 #include <vector>
 #include <bitset>
 #include "bitboard.h"
 #include "types.h"
 namespace Stockfish {
 namespace {
  // There are 24 possible pawn squares: files A to D and ranks from 2 to 7.
  // Positions with the pawn on files E to H will be mirrored before probing.
  constexpr unsigned MAX_INDEX = 2*24*64*64; // stm * psq * wksq * bksq = 196608
  std::bitset<MAX_INDEX> KPKBitbase;
  // A KPK bitbase index is an integer in [0, IndexMax] range
  //
  // Information is mapped in a way that minimizes the number of iterations:
  //
  // bit  0- 5: white king square (from SQ_A1 to SQ_H8)
  // bit  6-11: black king square (from SQ_A1 to SQ_H8)
  // bit    12: side to move (WHITE or BLACK)
  // bit 13-14: white pawn file (from FILE_A to FILE_D)
  // bit 15-17: white pawn RANK_7 - rank (from RANK_7 - RANK_7 to RANK_7 - RANK_2)
  unsigned index(Color stm, Square bksq, Square wksq, Square psq) {
    return int(wksq) | (bksq << 6) | (stm << 12) | (file_of(psq) << 13) | ((RANK_7 - rank_of(psq)) << 15);
  }
  enum Result {
    INVALID = 0,
    UNKNOWN = 1,
    DRAW    = 2,
    WIN     = 4
  };
  Result& operator|=(Result& r, Result v) { return r = Result(r | v); }
  struct KPKPosition {
    KPKPosition() = default;
    explicit KPKPosition(unsigned idx);
    operator Result() const { return result; }
    Result classify(const std::vector<KPKPosition>& db);
    Color stm;
    Square ksq[COLOR_NB], psq;
    Result result;
  };
 } // namespace
 bool Bitbases::probe(Square wksq, Square wpsq, Square bksq, Color stm) {
  assert(file_of(wpsq) <= FILE_D);
  return KPKBitbase[index(stm, bksq, wksq, wpsq)];
 }
 void Bitbases::init() {
  std::vector<KPKPosition> db(MAX_INDEX);
  unsigned idx, repeat = 1;
  // Initialize db with known win / draw positions
  for (idx = 0; idx < MAX_INDEX; ++idx)
      db[idx] = KPKPosition(idx);
  // Iterate through the positions until none of the unknown positions can be
  // changed to either wins or draws (15 cycles needed).
  while (repeat)
      for (repeat = idx = 0; idx < MAX_INDEX; ++idx)
          repeat |= (db[idx] == UNKNOWN && db[idx].classify(db) != UNKNOWN);
  // Fill the bitbase with the decisive results
  for (idx = 0; idx < MAX_INDEX; ++idx)
      if (db[idx] == WIN)
          KPKBitbase.set(idx);
 }
 namespace {
  KPKPosition::KPKPosition(unsigned idx) {
    ksq[WHITE] = Square((idx >>  0) & 0x3F);
    ksq[BLACK] = Square((idx >>  6) & 0x3F);
    stm        = Color ((idx >> 12) & 0x01);
    psq        = make_square(File((idx >> 13) & 0x3), Rank(RANK_7 - ((idx >> 15) & 0x7)));
    // Invalid if two pieces are on the same square or if a king can be captured
    if (   distance(ksq[WHITE], ksq[BLACK]) <= 1
        || ksq[WHITE] == psq
        || ksq[BLACK] == psq
        || (stm == WHITE && (pawn_attacks_bb(WHITE, psq) & ksq[BLACK])))
        result = INVALID;
    // Win if the pawn can be promoted without getting captured
    else if (   stm == WHITE
             && rank_of(psq) == RANK_7
             && ksq[WHITE] != psq + NORTH
             && (    distance(ksq[BLACK], psq + NORTH) > 1
                 || (distance(ksq[WHITE], psq + NORTH) == 1)))
        result = WIN;
    // Draw if it is stalemate or the black king can capture the pawn
    else if (   stm == BLACK
             && (  !(attacks_bb<KING>(ksq[BLACK]) & ~(attacks_bb<KING>(ksq[WHITE]) | pawn_attacks_bb(WHITE, psq)))
                 || (attacks_bb<KING>(ksq[BLACK]) & ~attacks_bb<KING>(ksq[WHITE]) & psq)))
        result = DRAW;
    // Position will be classified later
    else
        result = UNKNOWN;
  }
  Result KPKPosition::classify(const std::vector<KPKPosition>& db) {
    // White to move: If one move leads to a position classified as WIN, the result
    // of the current position is WIN. If all moves lead to positions classified
    // as DRAW, the current position is classified as DRAW, otherwise the current
    // position is classified as UNKNOWN.
    //
    // Black to move: If one move leads to a position classified as DRAW, the result
    // of the current position is DRAW. If all moves lead to positions classified
    // as WIN, the position is classified as WIN, otherwise the current position is
    // classified as UNKNOWN.
    const Result Good = (stm == WHITE ? WIN   : DRAW);
    const Result Bad  = (stm == WHITE ? DRAW  : WIN);
    Result r = INVALID;
    Bitboard b = attacks_bb<KING>(ksq[stm]);
    while (b)
        r |= stm == WHITE ? db[index(BLACK, ksq[BLACK], pop_lsb(b), psq)]
                          : db[index(WHITE, pop_lsb(b), ksq[WHITE], psq)];
    if (stm == WHITE)
    {
        if (rank_of(psq) < RANK_7)      // Single push
            r |= db[index(BLACK, ksq[BLACK], ksq[WHITE], psq + NORTH)];
        if (   rank_of(psq) == RANK_2   // Double push
            && psq + NORTH != ksq[WHITE]
            && psq + NORTH != ksq[BLACK])
            r |= db[index(BLACK, ksq[BLACK], ksq[WHITE], psq + NORTH + NORTH)];
    }
    return result = r & Good  ? Good  : r & UNKNOWN ? UNKNOWN : Bad;
  }
 } // namespace
 } // namespace Stockfish
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -16,12 +16,10 @@
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "bitboard.h"
 #include <algorithm>
 #include <bitset>
 #include <initializer_list>
 #include "bitboard.h"
 #include "misc.h"
 namespace Stockfish {
@@ -29,159 +27,154 @@ namespace Stockfish {
 uint8_t PopCnt16[1 << 16];
 uint8_t SquareDistance[SQUARE_NB][SQUARE_NB];
 Bitboard SquareBB[SQUARE_NB];
 Bitboard LineBB[SQUARE_NB][SQUARE_NB];
 Bitboard BetweenBB[SQUARE_NB][SQUARE_NB];
 Bitboard PseudoAttacks[PIECE_TYPE_NB][SQUARE_NB];
 Bitboard PawnAttacks[COLOR_NB][SQUARE_NB];
-alignas(64) Magic Magics[SQUARE_NB][2];
+Magic RookMagics[SQUARE_NB];
 Magic BishopMagics[SQUARE_NB];
 namespace {
-Bitboard RookTable[0x19000];   // To store rook attacks
+  Bitboard RookTable[0x19000];  // To store rook attacks
-Bitboard BishopTable[0x1480];  // To store bishop attacks
+  Bitboard BishopTable[0x1480]; // To store bishop attacks
-void init_magics(PieceType pt, Bitboard table[], Magic magics[][2]);
+  void init_magics(PieceType pt, Bitboard table[], Magic magics[]);
-// Returns the bitboard of target square for the given step
+}
-// from the given square. If the step is off the board, returns empty bitboard.
+
-Bitboard safe_destination(Square s, int step) {
+/// safe_destination() returns the bitboard of target square for the given step
 /// from the given square. If the step is off the board, returns empty bitboard.
 inline Bitboard safe_destination(Square s, int step) {
    Square to = Square(s + step);
    return is_ok(to) && distance(s, to) <= 2 ? square_bb(to) : Bitboard(0);
 }
 }
-// Returns an ASCII representation of a bitboard suitable
+
-// to be printed to standard output. Useful for debugging.
+/// Bitboards::pretty() returns an ASCII representation of a bitboard suitable
 /// to be printed to standard output. Useful for debugging.
 std::string Bitboards::pretty(Bitboard b) {
-    std::string s = "+---+---+---+---+---+---+---+---+\n";
+  std::string s = "+---+---+---+---+---+---+---+---+\n";
-    for (Rank r = RANK_8; r >= RANK_1; --r)
+  for (Rank r = RANK_8; r >= RANK_1; --r)
-    {
+  {
-        for (File f = FILE_A; f <= FILE_H; ++f)
+      for (File f = FILE_A; f <= FILE_H; ++f)
-            s += b & make_square(f, r) ? "| X " : "|   ";
+          s += b & make_square(f, r) ? "| X " : "|   ";
-        s += "| " + std::to_string(1 + r) + "\n+---+---+---+---+---+---+---+---+\n";
+      s += "| " + std::to_string(1 + r) + "\n+---+---+---+---+---+---+---+---+\n";
-    }
+  }
-    s += "  a   b   c   d   e   f   g   h\n";
+  s += "  a   b   c   d   e   f   g   h\n";
-    return s;
+  return s;
 }
-// Initializes various bitboard tables. It is called at
+/// Bitboards::init() initializes various bitboard tables. It is called at
-// startup and relies on global objects to be already zero-initialized.
+/// startup and relies on global objects to be already zero-initialized.
 void Bitboards::init() {
-    for (unsigned i = 0; i < (1 << 16); ++i)
+  for (unsigned i = 0; i < (1 << 16); ++i)
-        PopCnt16[i] = uint8_t(std::bitset<16>(i).count());
+      PopCnt16[i] = uint8_t(std::bitset<16>(i).count());
-    for (Square s1 = SQ_A1; s1 <= SQ_H8; ++s1)
+  for (Square s = SQ_A1; s <= SQ_H8; ++s)
-        for (Square s2 = SQ_A1; s2 <= SQ_H8; ++s2)
+      SquareBB[s] = (1ULL << s);
            SquareDistance[s1][s2] = std::max(distance<File>(s1, s2), distance<Rank>(s1, s2));
-    init_magics(ROOK, RookTable, Magics);
+  for (Square s1 = SQ_A1; s1 <= SQ_H8; ++s1)
-    init_magics(BISHOP, BishopTable, Magics);
+      for (Square s2 = SQ_A1; s2 <= SQ_H8; ++s2)
          SquareDistance[s1][s2] = std::max(distance<File>(s1, s2), distance<Rank>(s1, s2));
-    for (Square s1 = SQ_A1; s1 <= SQ_H8; ++s1)
+  init_magics(ROOK, RookTable, RookMagics);
-    {
+  init_magics(BISHOP, BishopTable, BishopMagics);
        PawnAttacks[WHITE][s1] = pawn_attacks_bb<WHITE>(square_bb(s1));
        PawnAttacks[BLACK][s1] = pawn_attacks_bb<BLACK>(square_bb(s1));
-        for (int step : {-9, -8, -7, -1, 1, 7, 8, 9})
+  for (Square s1 = SQ_A1; s1 <= SQ_H8; ++s1)
-            PseudoAttacks[KING][s1] |= safe_destination(s1, step);
+  {
      PawnAttacks[WHITE][s1] = pawn_attacks_bb<WHITE>(square_bb(s1));
      PawnAttacks[BLACK][s1] = pawn_attacks_bb<BLACK>(square_bb(s1));
-        for (int step : {-17, -15, -10, -6, 6, 10, 15, 17})
+      for (int step : {-9, -8, -7, -1, 1, 7, 8, 9} )
-            PseudoAttacks[KNIGHT][s1] |= safe_destination(s1, step);
+         PseudoAttacks[KING][s1] |= safe_destination(s1, step);
-        PseudoAttacks[QUEEN][s1] = PseudoAttacks[BISHOP][s1] = attacks_bb<BISHOP>(s1, 0);
+      for (int step : {-17, -15, -10, -6, 6, 10, 15, 17} )
-        PseudoAttacks[QUEEN][s1] |= PseudoAttacks[ROOK][s1]  = attacks_bb<ROOK>(s1, 0);
+         PseudoAttacks[KNIGHT][s1] |= safe_destination(s1, step);
-        for (PieceType pt : {BISHOP, ROOK})
+      PseudoAttacks[QUEEN][s1]  = PseudoAttacks[BISHOP][s1] = attacks_bb<BISHOP>(s1, 0);
-            for (Square s2 = SQ_A1; s2 <= SQ_H8; ++s2)
+      PseudoAttacks[QUEEN][s1] |= PseudoAttacks[  ROOK][s1] = attacks_bb<  ROOK>(s1, 0);
-            {
+
-                if (PseudoAttacks[pt][s1] & s2)
+      for (PieceType pt : { BISHOP, ROOK })
-                {
+          for (Square s2 = SQ_A1; s2 <= SQ_H8; ++s2)
-                    LineBB[s1][s2] = (attacks_bb(pt, s1, 0) & attacks_bb(pt, s2, 0)) | s1 | s2;
+          {
-                    BetweenBB[s1][s2] =
+              if (PseudoAttacks[pt][s1] & s2)
-                      (attacks_bb(pt, s1, square_bb(s2)) & attacks_bb(pt, s2, square_bb(s1)));
+              {
-                }
+                  LineBB[s1][s2]    = (attacks_bb(pt, s1, 0) & attacks_bb(pt, s2, 0)) | s1 | s2;
-                BetweenBB[s1][s2] |= s2;
+                  BetweenBB[s1][s2] = (attacks_bb(pt, s1, square_bb(s2)) & attacks_bb(pt, s2, square_bb(s1)));
-            }
+              }
-    }
+              BetweenBB[s1][s2] |= s2;
          }
  }
 }
 namespace {
-Bitboard sliding_attack(PieceType pt, Square sq, Bitboard occupied) {
+  Bitboard sliding_attack(PieceType pt, Square sq, Bitboard occupied) {
-    Bitboard  attacks             = 0;
+    Bitboard attacks = 0;
-    Direction RookDirections[4]   = {NORTH, SOUTH, EAST, WEST};
+    Direction   RookDirections[4] = {NORTH, SOUTH, EAST, WEST};
    Direction BishopDirections[4] = {NORTH_EAST, SOUTH_EAST, SOUTH_WEST, NORTH_WEST};
    for (Direction d : (pt == ROOK ? RookDirections : BishopDirections))
    {
        Square s = sq;
-        while (safe_destination(s, d))
+        while (safe_destination(s, d) && !(occupied & s))
        {
            attacks |= (s += d);
            if (occupied & s)
            {
                break;
            }
        }
    }
    return attacks;
-}
+  }
-// Computes all rook and bishop attacks at startup. Magic
+  // init_magics() computes all rook and bishop attacks at startup. Magic
-// bitboards are used to look up attacks of sliding pieces. As a reference see
+  // bitboards are used to look up attacks of sliding pieces. As a reference see
-// https://www.chessprogramming.org/Magic_Bitboards. In particular, here we use
+  // www.chessprogramming.org/Magic_Bitboards. In particular, here we use the so
-// the so called "fancy" approach.
+  // called "fancy" approach.
-void init_magics(PieceType pt, Bitboard table[], Magic magics[][2]) {
+
  void init_magics(PieceType pt, Bitboard table[], Magic magics[]) {
 #ifndef USE_PEXT
    // Optimal PRNG seeds to pick the correct magics in the shortest time
-    int seeds[][RANK_NB] = {{8977, 44560, 54343, 38998, 5731, 95205, 104912, 17020},
+    int seeds[][RANK_NB] = { { 8977, 44560, 54343, 38998,  5731, 95205, 104912, 17020 },
-                            {728, 10316, 55013, 32803, 12281, 15100, 16645, 255}};
+                             {  728, 10316, 55013, 32803, 12281, 15100,  16645,   255 } };
-    Bitboard occupancy[4096];
+    Bitboard occupancy[4096], reference[4096], edges, b;
-    int      epoch[4096] = {}, cnt = 0;
+    int epoch[4096] = {}, cnt = 0, size = 0;
 #endif
    Bitboard reference[4096];
    int      size = 0;
    for (Square s = SQ_A1; s <= SQ_H8; ++s)
    {
        // Board edges are not considered in the relevant occupancies
-        Bitboard edges = ((Rank1BB | Rank8BB) & ~rank_bb(s)) | ((FileABB | FileHBB) & ~file_bb(s));
+        edges = ((Rank1BB | Rank8BB) & ~rank_bb(s)) | ((FileABB | FileHBB) & ~file_bb(s));
        // Given a square 's', the mask is the bitboard of sliding attacks from
        // 's' computed on an empty board. The index must be big enough to contain
        // all the attacks for each possible subset of the mask and so is 2 power
        // the number of 1s of the mask. Hence we deduce the size of the shift to
        // apply to the 64 or 32 bits word to get the index.
-        Magic& m = magics[s][pt - BISHOP];
+        Magic& m = magics[s];
-        m.mask   = sliding_attack(pt, s, 0) & ~edges;
+        m.mask  = sliding_attack(pt, s, 0) & ~edges;
 #ifndef USE_PEXT
        m.shift = (Is64Bit ? 64 : 32) - popcount(m.mask);
-#endif
+
        // Set the offset for the attacks table of the square. We have individual
        // table sizes for each square with "Fancy Magic Bitboards".
-        m.attacks = s == SQ_A1 ? table : magics[s - 1][pt - BISHOP].attacks + size;
+        m.attacks = s == SQ_A1 ? table : magics[s - 1].attacks + size;
        size      = 0;
        // Use Carry-Rippler trick to enumerate all subsets of masks[s] and
        // store the corresponding sliding attack bitboard in reference[].
-        Bitboard b = 0;
+        b = size = 0;
-        do
+        do {
        {
 #ifndef USE_PEXT
            occupancy[size] = b;
 #endif
            reference[size] = sliding_attack(pt, s, b);
            if (HasPext)
@@ -191,14 +184,16 @@ void init_magics(PieceType pt, Bitboard table[], Magic magics[][2]) {
            b = (b - m.mask) & m.mask;
        } while (b);
-#ifndef USE_PEXT
+        if (HasPext)
            continue;
        PRNG rng(seeds[Is64Bit][rank_of(s)]);
        // Find a magic for square 's' picking up an (almost) random number
        // until we find the one that passes the verification test.
-        for (int i = 0; i < size;)
+        for (int i = 0; i < size; )
        {
-            for (m.magic = 0; popcount((m.magic * m.mask) >> 56) < 6;)
+            for (m.magic = 0; popcount((m.magic * m.mask) >> 56) < 6; )
                m.magic = rng.sparse_rand<Bitboard>();
            // A good magic must map every possible occupancy to an index that
@@ -213,16 +208,15 @@ void init_magics(PieceType pt, Bitboard table[], Magic magics[][2]) {
                if (epoch[idx] < cnt)
                {
-                    epoch[idx]     = cnt;
+                    epoch[idx] = cnt;
                    m.attacks[idx] = reference[i];
                }
                else if (m.attacks[idx] != reference[i])
                    break;
            }
        }
 #endif
    }
-}
+  }
 }
-}  // namespace Stockfish
+} // namespace Stockfish
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -19,24 +19,28 @@
 #ifndef BITBOARD_H_INCLUDED
 #define BITBOARD_H_INCLUDED
 #include <algorithm>
 #include <cassert>
 #include <cmath>
 #include <cstring>
 #include <cstdint>
 #include <cstdlib>
 #include <string>
 #include "types.h"
 namespace Stockfish {
 namespace Bitbases {
 void init();
 bool probe(Square wksq, Square wpsq, Square bksq, Color us);
 } // namespace Stockfish::Bitbases
 namespace Bitboards {
-void        init();
+void init();
 std::string pretty(Bitboard b);
-}  // namespace Stockfish::Bitboards
+} // namespace Stockfish::Bitboards
 constexpr Bitboard AllSquares = ~Bitboard(0);
 constexpr Bitboard DarkSquares = 0xAA55AA55AA55AA55ULL;
 constexpr Bitboard FileABB = 0x0101010101010101ULL;
 constexpr Bitboard FileBBB = FileABB << 1;
@@ -56,319 +60,392 @@ constexpr Bitboard Rank6BB = Rank1BB << (8 * 5);
 constexpr Bitboard Rank7BB = Rank1BB << (8 * 6);
 constexpr Bitboard Rank8BB = Rank1BB << (8 * 7);
 constexpr Bitboard QueenSide   = FileABB | FileBBB | FileCBB | FileDBB;
 constexpr Bitboard CenterFiles = FileCBB | FileDBB | FileEBB | FileFBB;
 constexpr Bitboard KingSide    = FileEBB | FileFBB | FileGBB | FileHBB;
 constexpr Bitboard Center      = (FileDBB | FileEBB) & (Rank4BB | Rank5BB);
 constexpr Bitboard KingFlank[FILE_NB] = {
  QueenSide ^ FileDBB, QueenSide, QueenSide,
  CenterFiles, CenterFiles,
  KingSide, KingSide, KingSide ^ FileEBB
 };
 extern uint8_t PopCnt16[1 << 16];
 extern uint8_t SquareDistance[SQUARE_NB][SQUARE_NB];
 extern Bitboard SquareBB[SQUARE_NB];
 extern Bitboard BetweenBB[SQUARE_NB][SQUARE_NB];
 extern Bitboard LineBB[SQUARE_NB][SQUARE_NB];
 extern Bitboard PseudoAttacks[PIECE_TYPE_NB][SQUARE_NB];
 extern Bitboard PawnAttacks[COLOR_NB][SQUARE_NB];
-// Magic holds all magic bitboards relevant data for a single square
+/// Magic holds all magic bitboards relevant data for a single square
 struct Magic {
-    Bitboard  mask;
+  Bitboard  mask;
-    Bitboard* attacks;
+  Bitboard  magic;
-#ifndef USE_PEXT
+  Bitboard* attacks;
-    Bitboard magic;
+  unsigned  shift;
    unsigned shift;
 #endif
-    // Compute the attack's index using the 'magic bitboards' approach
+  // Compute the attack's index using the 'magic bitboards' approach
-    unsigned index(Bitboard occupied) const {
+  unsigned index(Bitboard occupied) const {
-#ifdef USE_PEXT
+    if (HasPext)
        return unsigned(pext(occupied, mask));
 #else
        if (Is64Bit)
            return unsigned(((occupied & mask) * magic) >> shift);
-        unsigned lo = unsigned(occupied) & unsigned(mask);
+    if (Is64Bit)
-        unsigned hi = unsigned(occupied >> 32) & unsigned(mask >> 32);
+        return unsigned(((occupied & mask) * magic) >> shift);
        return (lo * unsigned(magic) ^ hi * unsigned(magic >> 32)) >> shift;
 #endif
    }
-    Bitboard attacks_bb(Bitboard occupied) const { return attacks[index(occupied)]; }
+    unsigned lo = unsigned(occupied) & unsigned(mask);
    unsigned hi = unsigned(occupied >> 32) & unsigned(mask >> 32);
    return (lo * unsigned(magic) ^ hi * unsigned(magic >> 32)) >> shift;
  }
 };
-extern Magic Magics[SQUARE_NB][2];
+extern Magic RookMagics[SQUARE_NB];
 extern Magic BishopMagics[SQUARE_NB];
-constexpr Bitboard square_bb(Square s) {
+inline Bitboard square_bb(Square s) {
-    assert(is_ok(s));
+  assert(is_ok(s));
-    return (1ULL << s);
+  return SquareBB[s];
 }
-// Overloads of bitwise operators between a Bitboard and a Square for testing
+/// Overloads of bitwise operators between a Bitboard and a Square for testing
-// whether a given bit is set in a bitboard, and for setting and clearing bits.
+/// whether a given bit is set in a bitboard, and for setting and clearing bits.
-inline Bitboard  operator&(Bitboard b, Square s) { return b & square_bb(s); }
+inline Bitboard  operator&( Bitboard  b, Square s) { return b &  square_bb(s); }
-inline Bitboard  operator|(Bitboard b, Square s) { return b | square_bb(s); }
+inline Bitboard  operator|( Bitboard  b, Square s) { return b |  square_bb(s); }
-inline Bitboard  operator^(Bitboard b, Square s) { return b ^ square_bb(s); }
+inline Bitboard  operator^( Bitboard  b, Square s) { return b ^  square_bb(s); }
 inline Bitboard& operator|=(Bitboard& b, Square s) { return b |= square_bb(s); }
 inline Bitboard& operator^=(Bitboard& b, Square s) { return b ^= square_bb(s); }
-inline Bitboard operator&(Square s, Bitboard b) { return b & s; }
+inline Bitboard  operator&(Square s, Bitboard b) { return b & s; }
-inline Bitboard operator|(Square s, Bitboard b) { return b | s; }
+inline Bitboard  operator|(Square s, Bitboard b) { return b | s; }
-inline Bitboard operator^(Square s, Bitboard b) { return b ^ s; }
+inline Bitboard  operator^(Square s, Bitboard b) { return b ^ s; }
-inline Bitboard operator|(Square s1, Square s2) { return square_bb(s1) | s2; }
+inline Bitboard  operator|(Square s1, Square s2) { return square_bb(s1) | s2; }
-constexpr bool more_than_one(Bitboard b) { return b & (b - 1); }
+constexpr bool more_than_one(Bitboard b) {
-
+  return b & (b - 1);
 // rank_bb() and file_bb() return a bitboard representing all the squares on
 // the given file or rank.
 constexpr Bitboard rank_bb(Rank r) { return Rank1BB << (8 * r); }
 constexpr Bitboard rank_bb(Square s) { return rank_bb(rank_of(s)); }
 constexpr Bitboard file_bb(File f) { return FileABB << f; }
 constexpr Bitboard file_bb(Square s) { return file_bb(file_of(s)); }
 // Moves a bitboard one or two steps as specified by the direction D
 template<Direction D>
 constexpr Bitboard shift(Bitboard b) {
    return D == NORTH         ? b << 8
         : D == SOUTH         ? b >> 8
         : D == NORTH + NORTH ? b << 16
         : D == SOUTH + SOUTH ? b >> 16
         : D == EAST          ? (b & ~FileHBB) << 1
         : D == WEST          ? (b & ~FileABB) >> 1
         : D == NORTH_EAST    ? (b & ~FileHBB) << 9
         : D == NORTH_WEST    ? (b & ~FileABB) << 7
         : D == SOUTH_EAST    ? (b & ~FileHBB) >> 7
         : D == SOUTH_WEST    ? (b & ~FileABB) >> 9
                              : 0;
 }
-// Returns the squares attacked by pawns of the given color
+constexpr bool opposite_colors(Square s1, Square s2) {
-// from the squares in the given bitboard.
+  return (s1 + rank_of(s1) + s2 + rank_of(s2)) & 1;
 }
 /// rank_bb() and file_bb() return a bitboard representing all the squares on
 /// the given file or rank.
 constexpr Bitboard rank_bb(Rank r) {
  return Rank1BB << (8 * r);
 }
 constexpr Bitboard rank_bb(Square s) {
  return rank_bb(rank_of(s));
 }
 constexpr Bitboard file_bb(File f) {
  return FileABB << f;
 }
 constexpr Bitboard file_bb(Square s) {
  return file_bb(file_of(s));
 }
 /// shift() moves a bitboard one or two steps as specified by the direction D
 template<Direction D>
 constexpr Bitboard shift(Bitboard b) {
  return  D == NORTH      ?  b             << 8 : D == SOUTH      ?  b             >> 8
        : D == NORTH+NORTH?  b             <<16 : D == SOUTH+SOUTH?  b             >>16
        : D == EAST       ? (b & ~FileHBB) << 1 : D == WEST       ? (b & ~FileABB) >> 1
        : D == NORTH_EAST ? (b & ~FileHBB) << 9 : D == NORTH_WEST ? (b & ~FileABB) << 7
        : D == SOUTH_EAST ? (b & ~FileHBB) >> 7 : D == SOUTH_WEST ? (b & ~FileABB) >> 9
        : 0;
 }
 /// pawn_attacks_bb() returns the squares attacked by pawns of the given color
 /// from the squares in the given bitboard.
 template<Color C>
 constexpr Bitboard pawn_attacks_bb(Bitboard b) {
-    return C == WHITE ? shift<NORTH_WEST>(b) | shift<NORTH_EAST>(b)
+  return C == WHITE ? shift<NORTH_WEST>(b) | shift<NORTH_EAST>(b)
-                      : shift<SOUTH_WEST>(b) | shift<SOUTH_EAST>(b);
+                    : shift<SOUTH_WEST>(b) | shift<SOUTH_EAST>(b);
 }
 inline Bitboard pawn_attacks_bb(Color c, Square s) {
-    assert(is_ok(s));
+  assert(is_ok(s));
-    return PawnAttacks[c][s];
+  return PawnAttacks[c][s];
 }
-// Returns a bitboard representing an entire line (from board edge
+
-// to board edge) that intersects the two given squares. If the given squares
+/// pawn_double_attacks_bb() returns the squares doubly attacked by pawns of the
-// are not on a same file/rank/diagonal, the function returns 0. For instance,
+/// given color from the squares in the given bitboard.
-// line_bb(SQ_C4, SQ_F7) will return a bitboard with the A2-G8 diagonal.
+
 template<Color C>
 constexpr Bitboard pawn_double_attacks_bb(Bitboard b) {
  return C == WHITE ? shift<NORTH_WEST>(b) & shift<NORTH_EAST>(b)
                    : shift<SOUTH_WEST>(b) & shift<SOUTH_EAST>(b);
 }
 /// adjacent_files_bb() returns a bitboard representing all the squares on the
 /// adjacent files of a given square.
 constexpr Bitboard adjacent_files_bb(Square s) {
  return shift<EAST>(file_bb(s)) | shift<WEST>(file_bb(s));
 }
 /// line_bb() returns a bitboard representing an entire line (from board edge
 /// to board edge) that intersects the two given squares. If the given squares
 /// are not on a same file/rank/diagonal, the function returns 0. For instance,
 /// line_bb(SQ_C4, SQ_F7) will return a bitboard with the A2-G8 diagonal.
 inline Bitboard line_bb(Square s1, Square s2) {
-    assert(is_ok(s1) && is_ok(s2));
+  assert(is_ok(s1) && is_ok(s2));
-    return LineBB[s1][s2];
+
  return LineBB[s1][s2];
 }
-// Returns a bitboard representing the squares in the semi-open
+/// between_bb(s1, s2) returns a bitboard representing the squares in the semi-open
-// segment between the squares s1 and s2 (excluding s1 but including s2). If the
+/// segment between the squares s1 and s2 (excluding s1 but including s2). If the
-// given squares are not on a same file/rank/diagonal, it returns s2. For instance,
+/// given squares are not on a same file/rank/diagonal, it returns s2. For instance,
-// between_bb(SQ_C4, SQ_F7) will return a bitboard with squares D5, E6 and F7, but
+/// between_bb(SQ_C4, SQ_F7) will return a bitboard with squares D5, E6 and F7, but
-// between_bb(SQ_E6, SQ_F8) will return a bitboard with the square F8. This trick
+/// between_bb(SQ_E6, SQ_F8) will return a bitboard with the square F8. This trick
-// allows to generate non-king evasion moves faster: the defending piece must either
+/// allows to generate non-king evasion moves faster: the defending piece must either
-// interpose itself to cover the check or capture the checking piece.
+/// interpose itself to cover the check or capture the checking piece.
 inline Bitboard between_bb(Square s1, Square s2) {
-    assert(is_ok(s1) && is_ok(s2));
+  assert(is_ok(s1) && is_ok(s2));
-    return BetweenBB[s1][s2];
+
  return BetweenBB[s1][s2];
 }
 // Returns true if the squares s1, s2 and s3 are aligned either on a
 // straight or on a diagonal line.
 inline bool aligned(Square s1, Square s2, Square s3) { return line_bb(s1, s2) & s3; }
 /// forward_ranks_bb() returns a bitboard representing the squares on the ranks in
 /// front of the given one, from the point of view of the given color. For instance,
 /// forward_ranks_bb(BLACK, SQ_D3) will return the 16 squares on ranks 1 and 2.
-// distance() functions return the distance between x and y, defined as the
+constexpr Bitboard forward_ranks_bb(Color c, Square s) {
-// number of steps for a king in x to reach y.
+  return c == WHITE ? ~Rank1BB << 8 * relative_rank(WHITE, s)
-
+                    : ~Rank8BB >> 8 * relative_rank(BLACK, s);
 template<typename T1 = Square>
 inline int distance(Square x, Square y);
 template<>
 inline int distance<File>(Square x, Square y) {
    return std::abs(file_of(x) - file_of(y));
 }
-template<>
+
-inline int distance<Rank>(Square x, Square y) {
+/// forward_file_bb() returns a bitboard representing all the squares along the
-    return std::abs(rank_of(x) - rank_of(y));
+/// line in front of the given one, from the point of view of the given color.
 constexpr Bitboard forward_file_bb(Color c, Square s) {
  return forward_ranks_bb(c, s) & file_bb(s);
 }
-template<>
+
-inline int distance<Square>(Square x, Square y) {
+/// pawn_attack_span() returns a bitboard representing all the squares that can
-    return SquareDistance[x][y];
+/// be attacked by a pawn of the given color when it moves along its file, starting
 /// from the given square.
 constexpr Bitboard pawn_attack_span(Color c, Square s) {
  return forward_ranks_bb(c, s) & adjacent_files_bb(s);
 }
 /// passed_pawn_span() returns a bitboard which can be used to test if a pawn of
 /// the given color and on the given square is a passed pawn.
 constexpr Bitboard passed_pawn_span(Color c, Square s) {
  return pawn_attack_span(c, s) | forward_file_bb(c, s);
 }
 /// aligned() returns true if the squares s1, s2 and s3 are aligned either on a
 /// straight or on a diagonal line.
 inline bool aligned(Square s1, Square s2, Square s3) {
  return line_bb(s1, s2) & s3;
 }
 /// distance() functions return the distance between x and y, defined as the
 /// number of steps for a king in x to reach y.
 template<typename T1 = Square> inline int distance(Square x, Square y);
 template<> inline int distance<File>(Square x, Square y) { return std::abs(file_of(x) - file_of(y)); }
 template<> inline int distance<Rank>(Square x, Square y) { return std::abs(rank_of(x) - rank_of(y)); }
 template<> inline int distance<Square>(Square x, Square y) { return SquareDistance[x][y]; }
 inline int edge_distance(File f) { return std::min(f, File(FILE_H - f)); }
 inline int edge_distance(Rank r) { return std::min(r, Rank(RANK_8 - r)); }
 /// attacks_bb(Square) returns the pseudo attacks of the give piece type
 /// assuming an empty board.
 // Returns the pseudo attacks of the given piece type
 // assuming an empty board.
 template<PieceType Pt>
 inline Bitboard attacks_bb(Square s) {
-    assert((Pt != PAWN) && (is_ok(s)));
+  assert((Pt != PAWN) && (is_ok(s)));
-    return PseudoAttacks[Pt][s];
+
  return PseudoAttacks[Pt][s];
 }
-// Returns the attacks by the given piece
+/// attacks_bb(Square, Bitboard) returns the attacks by the given piece
-// assuming the board is occupied according to the passed Bitboard.
+/// assuming the board is occupied according to the passed Bitboard.
-// Sliding piece attacks do not continue passed an occupied square.
+/// Sliding piece attacks do not continue passed an occupied square.
 template<PieceType Pt>
 inline Bitboard attacks_bb(Square s, Bitboard occupied) {
-    assert((Pt != PAWN) && (is_ok(s)));
+  assert((Pt != PAWN) && (is_ok(s)));
-    switch (Pt)
+  switch (Pt)
-    {
+  {
-    case BISHOP :
+  case BISHOP: return BishopMagics[s].attacks[BishopMagics[s].index(occupied)];
-    case ROOK :
+  case ROOK  : return   RookMagics[s].attacks[  RookMagics[s].index(occupied)];
-        return Magics[s][Pt - BISHOP].attacks_bb(occupied);
+  case QUEEN : return attacks_bb<BISHOP>(s, occupied) | attacks_bb<ROOK>(s, occupied);
-    case QUEEN :
+  default    : return PseudoAttacks[Pt][s];
-        return attacks_bb<BISHOP>(s, occupied) | attacks_bb<ROOK>(s, occupied);
+  }
    default :
        return PseudoAttacks[Pt][s];
    }
 }
 // Returns the attacks by the given piece
 // assuming the board is occupied according to the passed Bitboard.
 // Sliding piece attacks do not continue passed an occupied square.
 inline Bitboard attacks_bb(PieceType pt, Square s, Bitboard occupied) {
-    assert((pt != PAWN) && (is_ok(s)));
+  assert((pt != PAWN) && (is_ok(s)));
-    switch (pt)
+  switch (pt)
-    {
+  {
-    case BISHOP :
+  case BISHOP: return attacks_bb<BISHOP>(s, occupied);
-        return attacks_bb<BISHOP>(s, occupied);
+  case ROOK  : return attacks_bb<  ROOK>(s, occupied);
-    case ROOK :
+  case QUEEN : return attacks_bb<BISHOP>(s, occupied) | attacks_bb<ROOK>(s, occupied);
-        return attacks_bb<ROOK>(s, occupied);
+  default    : return PseudoAttacks[pt][s];
-    case QUEEN :
+  }
        return attacks_bb<BISHOP>(s, occupied) | attacks_bb<ROOK>(s, occupied);
    default :
        return PseudoAttacks[pt][s];
    }
 }
-// Counts the number of non-zero bits in a bitboard.
+/// popcount() counts the number of non-zero bits in a bitboard
 inline int popcount(Bitboard b) {
 #ifndef USE_POPCNT
-    std::uint16_t indices[4];
+  union { Bitboard bb; uint16_t u[4]; } v = { b };
-    std::memcpy(indices, &b, sizeof(b));
+  return PopCnt16[v.u[0]] + PopCnt16[v.u[1]] + PopCnt16[v.u[2]] + PopCnt16[v.u[3]];
    return PopCnt16[indices[0]] + PopCnt16[indices[1]] + PopCnt16[indices[2]]
         + PopCnt16[indices[3]];
-#elif defined(_MSC_VER)
+#elif defined(_MSC_VER) || defined(__INTEL_COMPILER)
-    return int(_mm_popcnt_u64(b));
+  return (int)_mm_popcnt_u64(b);
-#else  // Assumed gcc or compatible compiler
+#else // Assumed gcc or compatible compiler
-    return __builtin_popcountll(b);
+  return __builtin_popcountll(b);
 #endif
 }
-// Returns the least significant bit in a non-zero bitboard.
+
 /// lsb() and msb() return the least/most significant bit in a non-zero bitboard
 #if defined(__GNUC__)  // GCC, Clang, ICC
 inline Square lsb(Bitboard b) {
-    assert(b);
+  assert(b);
-
+  return Square(__builtin_ctzll(b));
 #if defined(__GNUC__)  // GCC, Clang, ICX
    return Square(__builtin_ctzll(b));
 #elif defined(_MSC_VER)
    #ifdef _WIN64  // MSVC, WIN64
    unsigned long idx;
    _BitScanForward64(&idx, b);
    return Square(idx);
    #else  // MSVC, WIN32
    unsigned long idx;
    if (b & 0xffffffff)
    {
        _BitScanForward(&idx, int32_t(b));
        return Square(idx);
    }
    else
    {
        _BitScanForward(&idx, int32_t(b >> 32));
        return Square(idx + 32);
    }
    #endif
 #else  // Compiler is neither GCC nor MSVC compatible
    #error "Compiler not supported."
 #endif
 }
 // Returns the most significant bit in a non-zero bitboard.
 inline Square msb(Bitboard b) {
-    assert(b);
+  assert(b);
  return Square(63 ^ __builtin_clzll(b));
 }
-#if defined(__GNUC__)  // GCC, Clang, ICX
+#elif defined(_MSC_VER)  // MSVC
-    return Square(63 ^ __builtin_clzll(b));
+#ifdef _WIN64  // MSVC, WIN64
-#elif defined(_MSC_VER)
+inline Square lsb(Bitboard b) {
-    #ifdef _WIN64  // MSVC, WIN64
+  assert(b);
  unsigned long idx;
  _BitScanForward64(&idx, b);
  return (Square) idx;
 }
-    unsigned long idx;
+inline Square msb(Bitboard b) {
-    _BitScanReverse64(&idx, b);
+  assert(b);
-    return Square(idx);
+  unsigned long idx;
  _BitScanReverse64(&idx, b);
  return (Square) idx;
 }
-    #else  // MSVC, WIN32
+#else  // MSVC, WIN32
-    unsigned long idx;
+inline Square lsb(Bitboard b) {
  assert(b);
  unsigned long idx;
  if (b & 0xffffffff) {
      _BitScanForward(&idx, int32_t(b));
      return Square(idx);
  } else {
      _BitScanForward(&idx, int32_t(b >> 32));
      return Square(idx + 32);
  }
 }
 inline Square msb(Bitboard b) {
  assert(b);
  unsigned long idx;
  if (b >> 32) {
      _BitScanReverse(&idx, int32_t(b >> 32));
      return Square(idx + 32);
  } else {
      _BitScanReverse(&idx, int32_t(b));
      return Square(idx);
  }
 }
    if (b >> 32)
    {
        _BitScanReverse(&idx, int32_t(b >> 32));
        return Square(idx + 32);
    }
    else
    {
        _BitScanReverse(&idx, int32_t(b));
        return Square(idx);
    }
    #endif
 #else  // Compiler is neither GCC nor MSVC compatible
    #error "Compiler not supported."
 #endif
 }
-// Returns the bitboard of the least significant
+#else  // Compiler is neither GCC nor MSVC compatible
-// square of a non-zero bitboard. It is equivalent to square_bb(lsb(bb)).
+
 #error "Compiler not supported."
 #endif
 /// least_significant_square_bb() returns the bitboard of the least significant
 /// square of a non-zero bitboard. It is equivalent to square_bb(lsb(bb)).
 inline Bitboard least_significant_square_bb(Bitboard b) {
-    assert(b);
+  assert(b);
-    return b & -b;
+  return b & -b;
 }
-// Finds and clears the least significant bit in a non-zero bitboard.
+/// pop_lsb() finds and clears the least significant bit in a non-zero bitboard
 inline Square pop_lsb(Bitboard& b) {
-    assert(b);
+  assert(b);
-    const Square s = lsb(b);
+  const Square s = lsb(b);
-    b &= b - 1;
+  b &= b - 1;
-    return s;
+  return s;
 }
 }  // namespace Stockfish
-#endif  // #ifndef BITBOARD_H_INCLUDED
+/// frontmost_sq() returns the most advanced square for the given color,
 /// requires a non-zero bitboard.
 inline Square frontmost_sq(Color c, Bitboard b) {
  assert(b);
  return c == WHITE ? msb(b) : lsb(b);
 }
 } // namespace Stockfish
 #endif // #ifndef BITBOARD_H_INCLUDED
@@ -0,0 +1,747 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include <cassert>
 #include "bitboard.h"
 #include "endgame.h"
 #include "movegen.h"
 namespace Stockfish {
 namespace {
  // Used to drive the king towards the edge of the board
  // in KX vs K and KQ vs KR endgames.
  // Values range from 27 (center squares) to 90 (in the corners)
  inline int push_to_edge(Square s) {
      int rd = edge_distance(rank_of(s)), fd = edge_distance(file_of(s));
      return 90 - (7 * fd * fd / 2 + 7 * rd * rd / 2);
  }
  // Used to drive the king towards A1H8 corners in KBN vs K endgames.
  // Values range from 0 on A8H1 diagonal to 7 in A1H8 corners
  inline int push_to_corner(Square s) {
      return abs(7 - rank_of(s) - file_of(s));
  }
  // Drive a piece close to or away from another piece
  inline int push_close(Square s1, Square s2) { return 140 - 20 * distance(s1, s2); }
  inline int push_away(Square s1, Square s2) { return 120 - push_close(s1, s2); }
 #ifndef NDEBUG
  bool verify_material(const Position& pos, Color c, Value npm, int pawnsCnt) {
    return pos.non_pawn_material(c) == npm && pos.count<PAWN>(c) == pawnsCnt;
  }
 #endif
  // Map the square as if strongSide is white and strongSide's only pawn
  // is on the left half of the board.
  Square normalize(const Position& pos, Color strongSide, Square sq) {
    assert(pos.count<PAWN>(strongSide) == 1);
    if (file_of(pos.square<PAWN>(strongSide)) >= FILE_E)
        sq = flip_file(sq);
    return strongSide == WHITE ? sq : flip_rank(sq);
  }
 } // namespace
 namespace Endgames {
  std::pair<Map<Value>, Map<ScaleFactor>> maps;
  void init() {
    add<KPK>("KPK");
    add<KNNK>("KNNK");
    add<KBNK>("KBNK");
    add<KRKP>("KRKP");
    add<KRKB>("KRKB");
    add<KRKN>("KRKN");
    add<KQKP>("KQKP");
    add<KQKR>("KQKR");
    add<KNNKP>("KNNKP");
    add<KRPKR>("KRPKR");
    add<KRPKB>("KRPKB");
    add<KBPKB>("KBPKB");
    add<KBPKN>("KBPKN");
    add<KBPPKB>("KBPPKB");
    add<KRPPKRP>("KRPPKRP");
  }
 }
 /// Mate with KX vs K. This function is used to evaluate positions with
 /// king and plenty of material vs a lone king. It simply gives the
 /// attacking side a bonus for driving the defending king towards the edge
 /// of the board, and for keeping the distance between the two kings small.
 template<>
 Value Endgame<KXK>::operator()(const Position& pos) const {
  assert(verify_material(pos, weakSide, VALUE_ZERO, 0));
  assert(!pos.checkers()); // Eval is never called when in check
  // Stalemate detection with lone king
  if (pos.side_to_move() == weakSide && !MoveList<LEGAL>(pos).size())
      return VALUE_DRAW;
  Square strongKing = pos.square<KING>(strongSide);
  Square weakKing   = pos.square<KING>(weakSide);
  Value result =  pos.non_pawn_material(strongSide)
                + pos.count<PAWN>(strongSide) * PawnValueEg
                + push_to_edge(weakKing)
                + push_close(strongKing, weakKing);
  if (   pos.count<QUEEN>(strongSide)
      || pos.count<ROOK>(strongSide)
      ||(pos.count<BISHOP>(strongSide) && pos.count<KNIGHT>(strongSide))
      || (   (pos.pieces(strongSide, BISHOP) & ~DarkSquares)
          && (pos.pieces(strongSide, BISHOP) &  DarkSquares)))
      result = std::min(result + VALUE_KNOWN_WIN, VALUE_TB_WIN_IN_MAX_PLY - 1);
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// Mate with KBN vs K. This is similar to KX vs K, but we have to drive the
 /// defending king towards a corner square that our bishop attacks.
 template<>
 Value Endgame<KBNK>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, KnightValueMg + BishopValueMg, 0));
  assert(verify_material(pos, weakSide, VALUE_ZERO, 0));
  Square strongKing   = pos.square<KING>(strongSide);
  Square strongBishop = pos.square<BISHOP>(strongSide);
  Square weakKing     = pos.square<KING>(weakSide);
  // If our bishop does not attack A1/H8, we flip the enemy king square
  // to drive to opposite corners (A8/H1).
  Value result =  (VALUE_KNOWN_WIN + 3520)
                + push_close(strongKing, weakKing)
                + 420 * push_to_corner(opposite_colors(strongBishop, SQ_A1) ? flip_file(weakKing) : weakKing);
  assert(abs(result) < VALUE_TB_WIN_IN_MAX_PLY);
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// KP vs K. This endgame is evaluated with the help of a bitbase
 template<>
 Value Endgame<KPK>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, VALUE_ZERO, 1));
  assert(verify_material(pos, weakSide, VALUE_ZERO, 0));
  // Assume strongSide is white and the pawn is on files A-D
  Square strongKing = normalize(pos, strongSide, pos.square<KING>(strongSide));
  Square strongPawn = normalize(pos, strongSide, pos.square<PAWN>(strongSide));
  Square weakKing   = normalize(pos, strongSide, pos.square<KING>(weakSide));
  Color us = strongSide == pos.side_to_move() ? WHITE : BLACK;
  if (!Bitbases::probe(strongKing, strongPawn, weakKing, us))
      return VALUE_DRAW;
  Value result = VALUE_KNOWN_WIN + PawnValueEg + Value(rank_of(strongPawn));
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// KR vs KP. This is a somewhat tricky endgame to evaluate precisely without
 /// a bitbase. The function below returns drawish scores when the pawn is
 /// far advanced with support of the king, while the attacking king is far
 /// away.
 template<>
 Value Endgame<KRKP>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, RookValueMg, 0));
  assert(verify_material(pos, weakSide, VALUE_ZERO, 1));
  Square strongKing = pos.square<KING>(strongSide);
  Square weakKing   = pos.square<KING>(weakSide);
  Square strongRook = pos.square<ROOK>(strongSide);
  Square weakPawn   = pos.square<PAWN>(weakSide);
  Square queeningSquare = make_square(file_of(weakPawn), relative_rank(weakSide, RANK_8));
  Value result;
  // If the stronger side's king is in front of the pawn, it's a win
  if (forward_file_bb(strongSide, strongKing) & weakPawn)
      result = RookValueEg - distance(strongKing, weakPawn);
  // If the weaker side's king is too far from the pawn and the rook,
  // it's a win.
  else if (   distance(weakKing, weakPawn) >= 3 + (pos.side_to_move() == weakSide)
           && distance(weakKing, strongRook) >= 3)
      result = RookValueEg - distance(strongKing, weakPawn);
  // If the pawn is far advanced and supported by the defending king,
  // the position is drawish
  else if (   relative_rank(strongSide, weakKing) <= RANK_3
           && distance(weakKing, weakPawn) == 1
           && relative_rank(strongSide, strongKing) >= RANK_4
           && distance(strongKing, weakPawn) > 2 + (pos.side_to_move() == strongSide))
      result = Value(80) - 8 * distance(strongKing, weakPawn);
  else
      result =  Value(200) - 8 * (  distance(strongKing, weakPawn + pawn_push(weakSide))
                                  - distance(weakKing, weakPawn + pawn_push(weakSide))
                                  - distance(weakPawn, queeningSquare));
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// KR vs KB. This is very simple, and always returns drawish scores. The
 /// score is slightly bigger when the defending king is close to the edge.
 template<>
 Value Endgame<KRKB>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, RookValueMg, 0));
  assert(verify_material(pos, weakSide, BishopValueMg, 0));
  Value result = Value(push_to_edge(pos.square<KING>(weakSide)));
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// KR vs KN. The attacking side has slightly better winning chances than
 /// in KR vs KB, particularly if the king and the knight are far apart.
 template<>
 Value Endgame<KRKN>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, RookValueMg, 0));
  assert(verify_material(pos, weakSide, KnightValueMg, 0));
  Square weakKing   = pos.square<KING>(weakSide);
  Square weakKnight = pos.square<KNIGHT>(weakSide);
  Value result = Value(push_to_edge(weakKing) + push_away(weakKing, weakKnight));
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// KQ vs KP. In general, this is a win for the stronger side, but there are a
 /// few important exceptions. A pawn on 7th rank and on the A,C,F or H files
 /// with a king positioned next to it can be a draw, so in that case, we only
 /// use the distance between the kings.
 template<>
 Value Endgame<KQKP>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, QueenValueMg, 0));
  assert(verify_material(pos, weakSide, VALUE_ZERO, 1));
  Square strongKing = pos.square<KING>(strongSide);
  Square weakKing   = pos.square<KING>(weakSide);
  Square weakPawn   = pos.square<PAWN>(weakSide);
  Value result = Value(push_close(strongKing, weakKing));
  if (   relative_rank(weakSide, weakPawn) != RANK_7
      || distance(weakKing, weakPawn) != 1
      || ((FileBBB | FileDBB | FileEBB | FileGBB) & weakPawn))
      result += QueenValueEg - PawnValueEg;
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// KQ vs KR. This is almost identical to KX vs K: we give the attacking
 /// king a bonus for having the kings close together, and for forcing the
 /// defending king towards the edge. If we also take care to avoid null move for
 /// the defending side in the search, this is usually sufficient to win KQ vs KR.
 template<>
 Value Endgame<KQKR>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, QueenValueMg, 0));
  assert(verify_material(pos, weakSide, RookValueMg, 0));
  Square strongKing = pos.square<KING>(strongSide);
  Square weakKing   = pos.square<KING>(weakSide);
  Value result =  QueenValueEg
                - RookValueEg
                + push_to_edge(weakKing)
                + push_close(strongKing, weakKing);
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// KNN vs KP. Very drawish, but there are some mate opportunities if we can
 /// press the weakSide King to a corner before the pawn advances too much.
 template<>
 Value Endgame<KNNKP>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, 2 * KnightValueMg, 0));
  assert(verify_material(pos, weakSide, VALUE_ZERO, 1));
  Square weakKing = pos.square<KING>(weakSide);
  Square weakPawn = pos.square<PAWN>(weakSide);
  Value result =      PawnValueEg
               +  2 * push_to_edge(weakKing)
               - 10 * relative_rank(weakSide, weakPawn);
  return strongSide == pos.side_to_move() ? result : -result;
 }
 /// Some cases of trivial draws
 template<> Value Endgame<KNNK>::operator()(const Position&) const { return VALUE_DRAW; }
 /// KB and one or more pawns vs K. It checks for draws with rook pawns and
 /// a bishop of the wrong color. If such a draw is detected, SCALE_FACTOR_DRAW
 /// is returned. If not, the return value is SCALE_FACTOR_NONE, i.e. no scaling
 /// will be used.
 template<>
 ScaleFactor Endgame<KBPsK>::operator()(const Position& pos) const {
  assert(pos.non_pawn_material(strongSide) == BishopValueMg);
  assert(pos.count<PAWN>(strongSide) >= 1);
  // No assertions about the material of weakSide, because we want draws to
  // be detected even when the weaker side has some pawns.
  Bitboard strongPawns = pos.pieces(strongSide, PAWN);
  Bitboard allPawns = pos.pieces(PAWN);
  Square strongBishop = pos.square<BISHOP>(strongSide);
  Square weakKing = pos.square<KING>(weakSide);
  Square strongKing = pos.square<KING>(strongSide);
  // All strongSide pawns are on a single rook file?
  if (!(strongPawns & ~FileABB) || !(strongPawns & ~FileHBB))
  {
      Square queeningSquare = relative_square(strongSide, make_square(file_of(lsb(strongPawns)), RANK_8));
      if (   opposite_colors(queeningSquare, strongBishop)
          && distance(queeningSquare, weakKing) <= 1)
          return SCALE_FACTOR_DRAW;
  }
  // If all the pawns are on the same B or G file, then it's potentially a draw
  if ((!(allPawns & ~FileBBB) || !(allPawns & ~FileGBB))
      && pos.non_pawn_material(weakSide) == 0
      && pos.count<PAWN>(weakSide) >= 1)
  {
      // Get the least advanced weakSide pawn
      Square weakPawn = frontmost_sq(strongSide, pos.pieces(weakSide, PAWN));
      // There's potential for a draw if our pawn is blocked on the 7th rank,
      // the bishop cannot attack it or they only have one pawn left.
      if (   relative_rank(strongSide, weakPawn) == RANK_7
          && (strongPawns & (weakPawn + pawn_push(weakSide)))
          && (opposite_colors(strongBishop, weakPawn) || !more_than_one(strongPawns)))
      {
          int strongKingDist = distance(weakPawn, strongKing);
          int weakKingDist = distance(weakPawn, weakKing);
          // It's a draw if the weak king is on its back two ranks, within 2
          // squares of the blocking pawn and the strong king is not
          // closer. (I think this rule only fails in practically
          // unreachable positions such as 5k1K/6p1/6P1/8/8/3B4/8/8 w
          // and positions where qsearch will immediately correct the
          // problem such as 8/4k1p1/6P1/1K6/3B4/8/8/8 w).
          if (   relative_rank(strongSide, weakKing) >= RANK_7
              && weakKingDist <= 2
              && weakKingDist <= strongKingDist)
              return SCALE_FACTOR_DRAW;
      }
  }
  return SCALE_FACTOR_NONE;
 }
 /// KQ vs KR and one or more pawns. It tests for fortress draws with a rook on
 /// the third rank defended by a pawn.
 template<>
 ScaleFactor Endgame<KQKRPs>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, QueenValueMg, 0));
  assert(pos.count<ROOK>(weakSide) == 1);
  assert(pos.count<PAWN>(weakSide) >= 1);
  Square strongKing = pos.square<KING>(strongSide);
  Square weakKing   = pos.square<KING>(weakSide);
  Square weakRook   = pos.square<ROOK>(weakSide);
  if (    relative_rank(weakSide,   weakKing) <= RANK_2
      &&  relative_rank(weakSide, strongKing) >= RANK_4
      &&  relative_rank(weakSide,   weakRook) == RANK_3
      && (  pos.pieces(weakSide, PAWN)
          & attacks_bb<KING>(weakKing)
          & pawn_attacks_bb(strongSide, weakRook)))
          return SCALE_FACTOR_DRAW;
  return SCALE_FACTOR_NONE;
 }
 /// KRP vs KR. This function knows a handful of the most important classes of
 /// drawn positions, but is far from perfect. It would probably be a good idea
 /// to add more knowledge in the future.
 ///
 /// It would also be nice to rewrite the actual code for this function,
 /// which is mostly copied from Glaurung 1.x, and isn't very pretty.
 template<>
 ScaleFactor Endgame<KRPKR>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, RookValueMg, 1));
  assert(verify_material(pos, weakSide,   RookValueMg, 0));
  // Assume strongSide is white and the pawn is on files A-D
  Square strongKing = normalize(pos, strongSide, pos.square<KING>(strongSide));
  Square strongRook = normalize(pos, strongSide, pos.square<ROOK>(strongSide));
  Square strongPawn = normalize(pos, strongSide, pos.square<PAWN>(strongSide));
  Square weakKing = normalize(pos, strongSide, pos.square<KING>(weakSide));
  Square weakRook = normalize(pos, strongSide, pos.square<ROOK>(weakSide));
  File pawnFile = file_of(strongPawn);
  Rank pawnRank = rank_of(strongPawn);
  Square queeningSquare = make_square(pawnFile, RANK_8);
  int tempo = (pos.side_to_move() == strongSide);
  // If the pawn is not too far advanced and the defending king defends the
  // queening square, use the third-rank defence.
  if (   pawnRank <= RANK_5
      && distance(weakKing, queeningSquare) <= 1
      && strongKing <= SQ_H5
      && (rank_of(weakRook) == RANK_6 || (pawnRank <= RANK_3 && rank_of(strongRook) != RANK_6)))
      return SCALE_FACTOR_DRAW;
  // The defending side saves a draw by checking from behind in case the pawn
  // has advanced to the 6th rank with the king behind.
  if (   pawnRank == RANK_6
      && distance(weakKing, queeningSquare) <= 1
      && rank_of(strongKing) + tempo <= RANK_6
      && (rank_of(weakRook) == RANK_1 || (!tempo && distance<File>(weakRook, strongPawn) >= 3)))
      return SCALE_FACTOR_DRAW;
  if (   pawnRank >= RANK_6
      && weakKing == queeningSquare
      && rank_of(weakRook) == RANK_1
      && (!tempo || distance(strongKing, strongPawn) >= 2))
      return SCALE_FACTOR_DRAW;
  // White pawn on a7 and rook on a8 is a draw if black's king is on g7 or h7
  // and the black rook is behind the pawn.
  if (   strongPawn == SQ_A7
      && strongRook == SQ_A8
      && (weakKing == SQ_H7 || weakKing == SQ_G7)
      && file_of(weakRook) == FILE_A
      && (rank_of(weakRook) <= RANK_3 || file_of(strongKing) >= FILE_D || rank_of(strongKing) <= RANK_5))
      return SCALE_FACTOR_DRAW;
  // If the defending king blocks the pawn and the attacking king is too far
  // away, it's a draw.
  if (   pawnRank <= RANK_5
      && weakKing == strongPawn + NORTH
      && distance(strongKing, strongPawn) - tempo >= 2
      && distance(strongKing, weakRook) - tempo >= 2)
      return SCALE_FACTOR_DRAW;
  // Pawn on the 7th rank supported by the rook from behind usually wins if the
  // attacking king is closer to the queening square than the defending king,
  // and the defending king cannot gain tempi by threatening the attacking rook.
  if (   pawnRank == RANK_7
      && pawnFile != FILE_A
      && file_of(strongRook) == pawnFile
      && strongRook != queeningSquare
      && (distance(strongKing, queeningSquare) < distance(weakKing, queeningSquare) - 2 + tempo)
      && (distance(strongKing, queeningSquare) < distance(weakKing, strongRook) + tempo))
      return ScaleFactor(SCALE_FACTOR_MAX - 2 * distance(strongKing, queeningSquare));
  // Similar to the above, but with the pawn further back
  if (   pawnFile != FILE_A
      && file_of(strongRook) == pawnFile
      && strongRook < strongPawn
      && (distance(strongKing, queeningSquare) < distance(weakKing, queeningSquare) - 2 + tempo)
      && (distance(strongKing, strongPawn + NORTH) < distance(weakKing, strongPawn + NORTH) - 2 + tempo)
      && (  distance(weakKing, strongRook) + tempo >= 3
          || (    distance(strongKing, queeningSquare) < distance(weakKing, strongRook) + tempo
              && (distance(strongKing, strongPawn + NORTH) < distance(weakKing, strongPawn) + tempo))))
      return ScaleFactor(  SCALE_FACTOR_MAX
                         - 8 * distance(strongPawn, queeningSquare)
                         - 2 * distance(strongKing, queeningSquare));
  // If the pawn is not far advanced and the defending king is somewhere in
  // the pawn's path, it's probably a draw.
  if (pawnRank <= RANK_4 && weakKing > strongPawn)
  {
      if (file_of(weakKing) == file_of(strongPawn))
          return ScaleFactor(10);
      if (   distance<File>(weakKing, strongPawn) == 1
          && distance(strongKing, weakKing) > 2)
          return ScaleFactor(24 - 2 * distance(strongKing, weakKing));
  }
  return SCALE_FACTOR_NONE;
 }
 template<>
 ScaleFactor Endgame<KRPKB>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, RookValueMg, 1));
  assert(verify_material(pos, weakSide, BishopValueMg, 0));
  // Test for a rook pawn
  if (pos.pieces(PAWN) & (FileABB | FileHBB))
  {
      Square weakKing = pos.square<KING>(weakSide);
      Square weakBishop = pos.square<BISHOP>(weakSide);
      Square strongKing = pos.square<KING>(strongSide);
      Square strongPawn = pos.square<PAWN>(strongSide);
      Rank pawnRank = relative_rank(strongSide, strongPawn);
      Direction push = pawn_push(strongSide);
      // If the pawn is on the 5th rank and the pawn (currently) is on
      // the same color square as the bishop then there is a chance of
      // a fortress. Depending on the king position give a moderate
      // reduction or a stronger one if the defending king is near the
      // corner but not trapped there.
      if (pawnRank == RANK_5 && !opposite_colors(weakBishop, strongPawn))
      {
          int d = distance(strongPawn + 3 * push, weakKing);
          if (d <= 2 && !(d == 0 && weakKing == strongKing + 2 * push))
              return ScaleFactor(24);
          else
              return ScaleFactor(48);
      }
      // When the pawn has moved to the 6th rank we can be fairly sure
      // it's drawn if the bishop attacks the square in front of the
      // pawn from a reasonable distance and the defending king is near
      // the corner
      if (   pawnRank == RANK_6
          && distance(strongPawn + 2 * push, weakKing) <= 1
          && (attacks_bb<BISHOP>(weakBishop) & (strongPawn + push))
          && distance<File>(weakBishop, strongPawn) >= 2)
          return ScaleFactor(8);
  }
  return SCALE_FACTOR_NONE;
 }
 /// KRPP vs KRP. There is just a single rule: if the stronger side has no passed
 /// pawns and the defending king is actively placed, the position is drawish.
 template<>
 ScaleFactor Endgame<KRPPKRP>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, RookValueMg, 2));
  assert(verify_material(pos, weakSide,   RookValueMg, 1));
  Square strongPawn1 = lsb(pos.pieces(strongSide, PAWN));
  Square strongPawn2 = msb(pos.pieces(strongSide, PAWN));
  Square weakKing = pos.square<KING>(weakSide);
  // Does the stronger side have a passed pawn?
  if (pos.pawn_passed(strongSide, strongPawn1) || pos.pawn_passed(strongSide, strongPawn2))
      return SCALE_FACTOR_NONE;
  Rank pawnRank = std::max(relative_rank(strongSide, strongPawn1), relative_rank(strongSide, strongPawn2));
  if (   distance<File>(weakKing, strongPawn1) <= 1
      && distance<File>(weakKing, strongPawn2) <= 1
      && relative_rank(strongSide, weakKing) > pawnRank)
  {
      assert(pawnRank > RANK_1 && pawnRank < RANK_7);
      return ScaleFactor(7 * pawnRank);
  }
  return SCALE_FACTOR_NONE;
 }
 /// K and two or more pawns vs K. There is just a single rule here: if all pawns
 /// are on the same rook file and are blocked by the defending king, it's a draw.
 template<>
 ScaleFactor Endgame<KPsK>::operator()(const Position& pos) const {
  assert(pos.non_pawn_material(strongSide) == VALUE_ZERO);
  assert(pos.count<PAWN>(strongSide) >= 2);
  assert(verify_material(pos, weakSide, VALUE_ZERO, 0));
  Square weakKing = pos.square<KING>(weakSide);
  Bitboard strongPawns = pos.pieces(strongSide, PAWN);
  // If all pawns are ahead of the king on a single rook file, it's a draw.
  if (   !(strongPawns & ~(FileABB | FileHBB))
      && !(strongPawns & ~passed_pawn_span(weakSide, weakKing)))
      return SCALE_FACTOR_DRAW;
  return SCALE_FACTOR_NONE;
 }
 /// KBP vs KB. There are two rules: if the defending king is somewhere along the
 /// path of the pawn, and the square of the king is not of the same color as the
 /// stronger side's bishop, it's a draw. If the two bishops have opposite color,
 /// it's almost always a draw.
 template<>
 ScaleFactor Endgame<KBPKB>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, BishopValueMg, 1));
  assert(verify_material(pos, weakSide,   BishopValueMg, 0));
  Square strongPawn = pos.square<PAWN>(strongSide);
  Square strongBishop = pos.square<BISHOP>(strongSide);
  Square weakBishop = pos.square<BISHOP>(weakSide);
  Square weakKing = pos.square<KING>(weakSide);
  // Case 1: Defending king blocks the pawn, and cannot be driven away
  if (   (forward_file_bb(strongSide, strongPawn) & weakKing)
      && (   opposite_colors(weakKing, strongBishop)
          || relative_rank(strongSide, weakKing) <= RANK_6))
      return SCALE_FACTOR_DRAW;
  // Case 2: Opposite colored bishops
  if (opposite_colors(strongBishop, weakBishop))
      return SCALE_FACTOR_DRAW;
  return SCALE_FACTOR_NONE;
 }
 /// KBPP vs KB. It detects a few basic draws with opposite-colored bishops
 template<>
 ScaleFactor Endgame<KBPPKB>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, BishopValueMg, 2));
  assert(verify_material(pos, weakSide,   BishopValueMg, 0));
  Square strongBishop = pos.square<BISHOP>(strongSide);
  Square weakBishop   = pos.square<BISHOP>(weakSide);
  if (!opposite_colors(strongBishop, weakBishop))
      return SCALE_FACTOR_NONE;
  Square weakKing = pos.square<KING>(weakSide);
  Square strongPawn1 = lsb(pos.pieces(strongSide, PAWN));
  Square strongPawn2 = msb(pos.pieces(strongSide, PAWN));
  Square blockSq1, blockSq2;
  if (relative_rank(strongSide, strongPawn1) > relative_rank(strongSide, strongPawn2))
  {
      blockSq1 = strongPawn1 + pawn_push(strongSide);
      blockSq2 = make_square(file_of(strongPawn2), rank_of(strongPawn1));
  }
  else
  {
      blockSq1 = strongPawn2 + pawn_push(strongSide);
      blockSq2 = make_square(file_of(strongPawn1), rank_of(strongPawn2));
  }
  switch (distance<File>(strongPawn1, strongPawn2))
  {
  case 0:
    // Both pawns are on the same file. It's an easy draw if the defender firmly
    // controls some square in the frontmost pawn's path.
    if (   file_of(weakKing) == file_of(blockSq1)
        && relative_rank(strongSide, weakKing) >= relative_rank(strongSide, blockSq1)
        && opposite_colors(weakKing, strongBishop))
        return SCALE_FACTOR_DRAW;
    else
        return SCALE_FACTOR_NONE;
  case 1:
    // Pawns on adjacent files. It's a draw if the defender firmly controls the
    // square in front of the frontmost pawn's path, and the square diagonally
    // behind this square on the file of the other pawn.
    if (   weakKing == blockSq1
        && opposite_colors(weakKing, strongBishop)
        && (   weakBishop == blockSq2
            || (attacks_bb<BISHOP>(blockSq2, pos.pieces()) & pos.pieces(weakSide, BISHOP))
            || distance<Rank>(strongPawn1, strongPawn2) >= 2))
        return SCALE_FACTOR_DRAW;
    else if (   weakKing == blockSq2
             && opposite_colors(weakKing, strongBishop)
             && (   weakBishop == blockSq1
                 || (attacks_bb<BISHOP>(blockSq1, pos.pieces()) & pos.pieces(weakSide, BISHOP))))
        return SCALE_FACTOR_DRAW;
    else
        return SCALE_FACTOR_NONE;
  default:
    // The pawns are not on the same file or adjacent files. No scaling.
    return SCALE_FACTOR_NONE;
  }
 }
 /// KBP vs KN. There is a single rule: if the defending king is somewhere along
 /// the path of the pawn, and the square of the king is not of the same color as
 /// the stronger side's bishop, it's a draw.
 template<>
 ScaleFactor Endgame<KBPKN>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, BishopValueMg, 1));
  assert(verify_material(pos, weakSide, KnightValueMg, 0));
  Square strongPawn = pos.square<PAWN>(strongSide);
  Square strongBishop = pos.square<BISHOP>(strongSide);
  Square weakKing = pos.square<KING>(weakSide);
  if (   file_of(weakKing) == file_of(strongPawn)
      && relative_rank(strongSide, strongPawn) < relative_rank(strongSide, weakKing)
      && (   opposite_colors(weakKing, strongBishop)
          || relative_rank(strongSide, weakKing) <= RANK_6))
      return SCALE_FACTOR_DRAW;
  return SCALE_FACTOR_NONE;
 }
 /// KP vs KP. This is done by removing the weakest side's pawn and probing the
 /// KP vs K bitbase: if the weakest side has a draw without the pawn, it probably
 /// has at least a draw with the pawn as well. The exception is when the stronger
 /// side's pawn is far advanced and not on a rook file; in this case it is often
 /// possible to win (e.g. 8/4k3/3p4/3P4/6K1/8/8/8 w - - 0 1).
 template<>
 ScaleFactor Endgame<KPKP>::operator()(const Position& pos) const {
  assert(verify_material(pos, strongSide, VALUE_ZERO, 1));
  assert(verify_material(pos, weakSide,   VALUE_ZERO, 1));
  // Assume strongSide is white and the pawn is on files A-D
  Square strongKing = normalize(pos, strongSide, pos.square<KING>(strongSide));
  Square weakKing   = normalize(pos, strongSide, pos.square<KING>(weakSide));
  Square strongPawn = normalize(pos, strongSide, pos.square<PAWN>(strongSide));
  Color us = strongSide == pos.side_to_move() ? WHITE : BLACK;
  // If the pawn has advanced to the fifth rank or further, and is not a
  // rook pawn, it's too dangerous to assume that it's at least a draw.
  if (rank_of(strongPawn) >= RANK_5 && file_of(strongPawn) != FILE_A)
      return SCALE_FACTOR_NONE;
  // Probe the KPK bitbase with the weakest side's pawn removed. If it's a draw,
  // it's probably at least a draw even with the pawn.
  return Bitbases::probe(strongKing, strongPawn, weakKing, us) ? SCALE_FACTOR_NONE : SCALE_FACTOR_DRAW;
 }
 } // namespace Stockfish
@@ -0,0 +1,126 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef ENDGAME_H_INCLUDED
 #define ENDGAME_H_INCLUDED
 #include <memory>
 #include <string>
 #include <type_traits>
 #include <unordered_map>
 #include <utility>
 #include "position.h"
 #include "types.h"
 namespace Stockfish {
 /// EndgameCode lists all supported endgame functions by corresponding codes
 enum EndgameCode {
  EVALUATION_FUNCTIONS,
  KNNK,  // KNN vs K
  KNNKP, // KNN vs KP
  KXK,   // Generic "mate lone king" eval
  KBNK,  // KBN vs K
  KPK,   // KP vs K
  KRKP,  // KR vs KP
  KRKB,  // KR vs KB
  KRKN,  // KR vs KN
  KQKP,  // KQ vs KP
  KQKR,  // KQ vs KR
  SCALING_FUNCTIONS,
  KBPsK,   // KB and pawns vs K
  KQKRPs,  // KQ vs KR and pawns
  KRPKR,   // KRP vs KR
  KRPKB,   // KRP vs KB
  KRPPKRP, // KRPP vs KRP
  KPsK,    // K and pawns vs K
  KBPKB,   // KBP vs KB
  KBPPKB,  // KBPP vs KB
  KBPKN,   // KBP vs KN
  KPKP     // KP vs KP
 };
 /// Endgame functions can be of two types depending on whether they return a
 /// Value or a ScaleFactor.
 template<EndgameCode E> using
 eg_type = typename std::conditional<(E < SCALING_FUNCTIONS), Value, ScaleFactor>::type;
 /// Base and derived functors for endgame evaluation and scaling functions
 template<typename T>
 struct EndgameBase {
  explicit EndgameBase(Color c) : strongSide(c), weakSide(~c) {}
  virtual ~EndgameBase() = default;
  virtual T operator()(const Position&) const = 0;
  const Color strongSide, weakSide;
 };
 template<EndgameCode E, typename T = eg_type<E>>
 struct Endgame : public EndgameBase<T> {
  explicit Endgame(Color c) : EndgameBase<T>(c) {}
  T operator()(const Position&) const override;
 };
 /// The Endgames namespace handles the pointers to endgame evaluation and scaling
 /// base objects in two std::map. We use polymorphism to invoke the actual
 /// endgame function by calling its virtual operator().
 namespace Endgames {
  template<typename T> using Ptr = std::unique_ptr<EndgameBase<T>>;
  template<typename T> using Map = std::unordered_map<Key, Ptr<T>>;
  extern std::pair<Map<Value>, Map<ScaleFactor>> maps;
  void init();
  template<typename T>
  Map<T>& map() {
    return std::get<std::is_same<T, ScaleFactor>::value>(maps);
  }
  template<EndgameCode E, typename T = eg_type<E>>
  void add(const std::string& code) {
    StateInfo st;
    map<T>()[Position().set(code, WHITE, &st).material_key()] = Ptr<T>(new Endgame<E>(WHITE));
    map<T>()[Position().set(code, BLACK, &st).material_key()] = Ptr<T>(new Endgame<E>(BLACK));
  }
  template<typename T>
  const EndgameBase<T>* probe(Key key) {
    auto it = map<T>().find(key);
    return it != map<T>().end() ? it->second.get() : nullptr;
  }
 }
 } // namespace Stockfish
 #endif // #ifndef ENDGAME_H_INCLUDED
@@ -1,369 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "engine.h"
 #include <cassert>
 #include <deque>
 #include <iosfwd>
 #include <memory>
 #include <ostream>
 #include <sstream>
 #include <string_view>
 #include <utility>
 #include <vector>
 #include "evaluate.h"
 #include "misc.h"
 #include "nnue/network.h"
 #include "nnue/nnue_common.h"
 #include "perft.h"
 #include "position.h"
 #include "search.h"
 #include "syzygy/tbprobe.h"
 #include "types.h"
 #include "uci.h"
 #include "ucioption.h"
 namespace Stockfish {
 namespace NN = Eval::NNUE;
 constexpr auto StartFEN  = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
 constexpr int  MaxHashMB = Is64Bit ? 33554432 : 2048;
 Engine::Engine(std::optional<std::string> path) :
    binaryDirectory(path ? CommandLine::get_binary_directory(*path) : ""),
    numaContext(NumaConfig::from_system()),
    states(new std::deque<StateInfo>(1)),
    threads(),
    networks(
      numaContext,
      NN::Networks(
        NN::NetworkBig({EvalFileDefaultNameBig, "None", ""}, NN::EmbeddedNNUEType::BIG),
        NN::NetworkSmall({EvalFileDefaultNameSmall, "None", ""}, NN::EmbeddedNNUEType::SMALL))) {
    pos.set(StartFEN, false, &states->back());
    options.add(  //
      "Debug Log File", Option("", [](const Option& o) {
          start_logger(o);
          return std::nullopt;
      }));
    options.add(  //
      "NumaPolicy", Option("auto", [this](const Option& o) {
          set_numa_config_from_option(o);
          return numa_config_information_as_string() + "\n"
               + thread_allocation_information_as_string();
      }));
    options.add(  //
      "Threads", Option(1, 1, 1024, [this](const Option&) {
          resize_threads();
          return thread_allocation_information_as_string();
      }));
    options.add(  //
      "Hash", Option(16, 1, MaxHashMB, [this](const Option& o) {
          set_tt_size(o);
          return std::nullopt;
      }));
    options.add(  //
      "Clear Hash", Option([this](const Option&) {
          search_clear();
          return std::nullopt;
      }));
    options.add(  //
      "Ponder", Option(false));
    options.add(  //
      "MultiPV", Option(1, 1, MAX_MOVES));
    options.add("Skill Level", Option(20, 0, 20));
    options.add("Move Overhead", Option(10, 0, 5000));
    options.add("nodestime", Option(0, 0, 10000));
    options.add("UCI_Chess960", Option(false));
    options.add("UCI_LimitStrength", Option(false));
    options.add("UCI_Elo",
                Option(Stockfish::Search::Skill::LowestElo, Stockfish::Search::Skill::LowestElo,
                       Stockfish::Search::Skill::HighestElo));
    options.add("UCI_ShowWDL", Option(false));
    options.add(  //
      "SyzygyPath", Option("", [](const Option& o) {
          Tablebases::init(o);
          return std::nullopt;
      }));
    options.add("SyzygyProbeDepth", Option(1, 1, 100));
    options.add("Syzygy50MoveRule", Option(true));
    options.add("SyzygyProbeLimit", Option(7, 0, 7));
    options.add(  //
      "EvalFile", Option(EvalFileDefaultNameBig, [this](const Option& o) {
          load_big_network(o);
          return std::nullopt;
      }));
    options.add(  //
      "EvalFileSmall", Option(EvalFileDefaultNameSmall, [this](const Option& o) {
          load_small_network(o);
          return std::nullopt;
      }));
    load_networks();
    resize_threads();
 }
 std::uint64_t Engine::perft(const std::string& fen, Depth depth, bool isChess960) {
    verify_networks();
    return Benchmark::perft(fen, depth, isChess960);
 }
 void Engine::go(Search::LimitsType& limits) {
    assert(limits.perft == 0);
    verify_networks();
    threads.start_thinking(options, pos, states, limits);
 }
 void Engine::stop() { threads.stop = true; }
 void Engine::search_clear() {
    wait_for_search_finished();
    tt.clear(threads);
    threads.clear();
    // @TODO wont work with multiple instances
    Tablebases::init(options["SyzygyPath"]);  // Free mapped files
 }
 void Engine::set_on_update_no_moves(std::function<void(const Engine::InfoShort&)>&& f) {
    updateContext.onUpdateNoMoves = std::move(f);
 }
 void Engine::set_on_update_full(std::function<void(const Engine::InfoFull&)>&& f) {
    updateContext.onUpdateFull = std::move(f);
 }
 void Engine::set_on_iter(std::function<void(const Engine::InfoIter&)>&& f) {
    updateContext.onIter = std::move(f);
 }
 void Engine::set_on_bestmove(std::function<void(std::string_view, std::string_view)>&& f) {
    updateContext.onBestmove = std::move(f);
 }
 void Engine::set_on_verify_networks(std::function<void(std::string_view)>&& f) {
    onVerifyNetworks = std::move(f);
 }
 void Engine::wait_for_search_finished() { threads.main_thread()->wait_for_search_finished(); }
 void Engine::set_position(const std::string& fen, const std::vector<std::string>& moves) {
    // Drop the old state and create a new one
    states = StateListPtr(new std::deque<StateInfo>(1));
    pos.set(fen, options["UCI_Chess960"], &states->back());
    for (const auto& move : moves)
    {
        auto m = UCIEngine::to_move(pos, move);
        if (m == Move::none())
            break;
        states->emplace_back();
        pos.do_move(m, states->back());
    }
 }
 // modifiers
 void Engine::set_numa_config_from_option(const std::string& o) {
    if (o == "auto" || o == "system")
    {
        numaContext.set_numa_config(NumaConfig::from_system());
    }
    else if (o == "hardware")
    {
        // Don't respect affinity set in the system.
        numaContext.set_numa_config(NumaConfig::from_system(false));
    }
    else if (o == "none")
    {
        numaContext.set_numa_config(NumaConfig{});
    }
    else
    {
        numaContext.set_numa_config(NumaConfig::from_string(o));
    }
    // Force reallocation of threads in case affinities need to change.
    resize_threads();
    threads.ensure_network_replicated();
 }
 void Engine::resize_threads() {
    threads.wait_for_search_finished();
    threads.set(numaContext.get_numa_config(), {options, threads, tt, networks}, updateContext);
    // Reallocate the hash with the new threadpool size
    set_tt_size(options["Hash"]);
    threads.ensure_network_replicated();
 }
 void Engine::set_tt_size(size_t mb) {
    wait_for_search_finished();
    tt.resize(mb, threads);
 }
 void Engine::set_ponderhit(bool b) { threads.main_manager()->ponder = b; }
 // network related
 void Engine::verify_networks() const {
    networks->big.verify(options["EvalFile"], onVerifyNetworks);
    networks->small.verify(options["EvalFileSmall"], onVerifyNetworks);
 }
 void Engine::load_networks() {
    networks.modify_and_replicate([this](NN::Networks& networks_) {
        networks_.big.load(binaryDirectory, options["EvalFile"]);
        networks_.small.load(binaryDirectory, options["EvalFileSmall"]);
    });
    threads.clear();
    threads.ensure_network_replicated();
 }
 void Engine::load_big_network(const std::string& file) {
    networks.modify_and_replicate(
      [this, &file](NN::Networks& networks_) { networks_.big.load(binaryDirectory, file); });
    threads.clear();
    threads.ensure_network_replicated();
 }
 void Engine::load_small_network(const std::string& file) {
    networks.modify_and_replicate(
      [this, &file](NN::Networks& networks_) { networks_.small.load(binaryDirectory, file); });
    threads.clear();
    threads.ensure_network_replicated();
 }
 void Engine::save_network(const std::pair<std::optional<std::string>, std::string> files[2]) {
    networks.modify_and_replicate([&files](NN::Networks& networks_) {
        networks_.big.save(files[0].first);
        networks_.small.save(files[1].first);
    });
 }
 // utility functions
 void Engine::trace_eval() const {
    StateListPtr trace_states(new std::deque<StateInfo>(1));
    Position     p;
    p.set(pos.fen(), options["UCI_Chess960"], &trace_states->back());
    verify_networks();
    sync_cout << "\n" << Eval::trace(p, *networks) << sync_endl;
 }
 const OptionsMap& Engine::get_options() const { return options; }
 OptionsMap&       Engine::get_options() { return options; }
 std::string Engine::fen() const { return pos.fen(); }
 void Engine::flip() { pos.flip(); }
 std::string Engine::visualize() const {
    std::stringstream ss;
    ss << pos;
    return ss.str();
 }
 int Engine::get_hashfull(int maxAge) const { return tt.hashfull(maxAge); }
 std::vector<std::pair<size_t, size_t>> Engine::get_bound_thread_count_by_numa_node() const {
    auto                                   counts = threads.get_bound_thread_count_by_numa_node();
    const NumaConfig&                      cfg    = numaContext.get_numa_config();
    std::vector<std::pair<size_t, size_t>> ratios;
    NumaIndex                              n = 0;
    for (; n < counts.size(); ++n)
        ratios.emplace_back(counts[n], cfg.num_cpus_in_numa_node(n));
    if (!counts.empty())
        for (; n < cfg.num_numa_nodes(); ++n)
            ratios.emplace_back(0, cfg.num_cpus_in_numa_node(n));
    return ratios;
 }
 std::string Engine::get_numa_config_as_string() const {
    return numaContext.get_numa_config().to_string();
 }
 std::string Engine::numa_config_information_as_string() const {
    auto cfgStr = get_numa_config_as_string();
    return "Available processors: " + cfgStr;
 }
 std::string Engine::thread_binding_information_as_string() const {
    auto              boundThreadsByNode = get_bound_thread_count_by_numa_node();
    std::stringstream ss;
    if (boundThreadsByNode.empty())
        return ss.str();
    bool isFirst = true;
    for (auto&& [current, total] : boundThreadsByNode)
    {
        if (!isFirst)
            ss << ":";
        ss << current << "/" << total;
        isFirst = false;
    }
    return ss.str();
 }
 std::string Engine::thread_allocation_information_as_string() const {
    std::stringstream ss;
    size_t threadsSize = threads.size();
    ss << "Using " << threadsSize << (threadsSize > 1 ? " threads" : " thread");
    auto boundThreadsByNodeStr = thread_binding_information_as_string();
    if (boundThreadsByNodeStr.empty())
        return ss.str();
    ss << " with NUMA node thread binding: ";
    ss << boundThreadsByNodeStr;
    return ss.str();
 }
 }
@@ -1,130 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef ENGINE_H_INCLUDED
 #define ENGINE_H_INCLUDED
 #include <cstddef>
 #include <cstdint>
 #include <functional>
 #include <optional>
 #include <string>
 #include <string_view>
 #include <utility>
 #include <vector>
 #include "nnue/network.h"
 #include "numa.h"
 #include "position.h"
 #include "search.h"
 #include "syzygy/tbprobe.h"  // for Stockfish::Depth
 #include "thread.h"
 #include "tt.h"
 #include "ucioption.h"
 namespace Stockfish {
 class Engine {
   public:
    using InfoShort = Search::InfoShort;
    using InfoFull  = Search::InfoFull;
    using InfoIter  = Search::InfoIteration;
    Engine(std::optional<std::string> path = std::nullopt);
    // Cannot be movable due to components holding backreferences to fields
    Engine(const Engine&)            = delete;
    Engine(Engine&&)                 = delete;
    Engine& operator=(const Engine&) = delete;
    Engine& operator=(Engine&&)      = delete;
    ~Engine() { wait_for_search_finished(); }
    std::uint64_t perft(const std::string& fen, Depth depth, bool isChess960);
    // non blocking call to start searching
    void go(Search::LimitsType&);
    // non blocking call to stop searching
    void stop();
    // blocking call to wait for search to finish
    void wait_for_search_finished();
    // set a new position, moves are in UCI format
    void set_position(const std::string& fen, const std::vector<std::string>& moves);
    // modifiers
    void set_numa_config_from_option(const std::string& o);
    void resize_threads();
    void set_tt_size(size_t mb);
    void set_ponderhit(bool);
    void search_clear();
    void set_on_update_no_moves(std::function<void(const InfoShort&)>&&);
    void set_on_update_full(std::function<void(const InfoFull&)>&&);
    void set_on_iter(std::function<void(const InfoIter&)>&&);
    void set_on_bestmove(std::function<void(std::string_view, std::string_view)>&&);
    void set_on_verify_networks(std::function<void(std::string_view)>&&);
    // network related
    void verify_networks() const;
    void load_networks();
    void load_big_network(const std::string& file);
    void load_small_network(const std::string& file);
    void save_network(const std::pair<std::optional<std::string>, std::string> files[2]);
    // utility functions
    void trace_eval() const;
    const OptionsMap& get_options() const;
    OptionsMap&       get_options();
    int get_hashfull(int maxAge = 0) const;
    std::string                            fen() const;
    void                                   flip();
    std::string                            visualize() const;
    std::vector<std::pair<size_t, size_t>> get_bound_thread_count_by_numa_node() const;
    std::string                            get_numa_config_as_string() const;
    std::string                            numa_config_information_as_string() const;
    std::string                            thread_allocation_information_as_string() const;
    std::string                            thread_binding_information_as_string() const;
   private:
    const std::string binaryDirectory;
    NumaReplicationContext numaContext;
    Position     pos;
    StateListPtr states;
    OptionsMap                               options;
    ThreadPool                               threads;
    TranspositionTable                       tt;
    LazyNumaReplicated<Eval::NNUE::Networks> networks;
    Search::SearchManager::UpdateContext  updateContext;
    std::function<void(std::string_view)> onVerifyNetworks;
 };
 }  // namespace Stockfish
 #endif  // #ifndef ENGINE_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -20,6 +20,7 @@
 #define EVALUATE_H_INCLUDED
 #include <string>
 #include <optional>
 #include "types.h"
@@ -29,28 +30,39 @@ class Position;
 namespace Eval {
-// The default net name MUST follow the format nn-[SHA256 first 12 digits].nnue
+  std::string trace(Position& pos);
-// for the build process (profile-build and fishtest) to work. Do not change the
+  Value evaluate(const Position& pos);
 // name of the macro or the location where this macro is defined, as it is used
 // in the Makefile/Fishtest.
 #define EvalFileDefaultNameBig "nn-1c0000000000.nnue"
 #define EvalFileDefaultNameSmall "nn-37f18f62d772.nnue"
-namespace NNUE {
+  // The default net name MUST follow the format nn-[SHA256 first 12 digits].nnue
-struct Networks;
+  // for the build process (profile-build and fishtest) to work. Do not change the
-struct AccumulatorCaches;
+  // name of the macro, as it is used in the Makefile.
-}
+  #define EvalFileDefaultName   "nn-3c0aa92af1da.nnue"
-std::string trace(Position& pos, const Eval::NNUE::Networks& networks);
+  namespace NNUE {
    enum struct UseNNUEMode
    {
      False,
      True,
      Pure
    };
-int   simple_eval(const Position& pos, Color c);
+    extern UseNNUEMode useNNUE;
-bool  use_smallnet(const Position& pos);
+    extern std::string currentEvalFileName;
 Value evaluate(const NNUE::Networks&          networks,
               const Position&                pos,
               Eval::NNUE::AccumulatorCaches& caches,
               int                            optimism);
 }  // namespace Eval
-}  // namespace Stockfish
+    std::string trace(Position& pos);
    Value evaluate(const Position& pos, bool adjusted = false);
-#endif  // #ifndef EVALUATE_H_INCLUDED
+    void init();
    void verify();
    bool load_eval(std::string name, std::istream& stream);
    bool save_eval(std::ostream& stream);
    bool save_eval(const std::optional<std::string>& filename);
  } // namespace NNUE
 } // namespace Eval
 } // namespace Stockfish
 #endif // #ifndef EVALUATE_H_INCLUDED
@@ -1,165 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef HISTORY_H_INCLUDED
 #define HISTORY_H_INCLUDED
 #include <algorithm>
 #include <array>
 #include <cassert>
 #include <cmath>
 #include <cstdint>
 #include <cstdlib>
 #include <limits>
 #include <type_traits>  // IWYU pragma: keep
 #include "misc.h"
 #include "position.h"
 namespace Stockfish {
 constexpr int PAWN_HISTORY_SIZE        = 512;    // has to be a power of 2
 constexpr int CORRECTION_HISTORY_SIZE  = 32768;  // has to be a power of 2
 constexpr int CORRECTION_HISTORY_LIMIT = 1024;
 constexpr int LOW_PLY_HISTORY_SIZE     = 4;
 static_assert((PAWN_HISTORY_SIZE & (PAWN_HISTORY_SIZE - 1)) == 0,
              "PAWN_HISTORY_SIZE has to be a power of 2");
 static_assert((CORRECTION_HISTORY_SIZE & (CORRECTION_HISTORY_SIZE - 1)) == 0,
              "CORRECTION_HISTORY_SIZE has to be a power of 2");
 enum PawnHistoryType {
    Normal,
    Correction
 };
 template<PawnHistoryType T = Normal>
 inline int pawn_structure_index(const Position& pos) {
    return pos.pawn_key() & ((T == Normal ? PAWN_HISTORY_SIZE : CORRECTION_HISTORY_SIZE) - 1);
 }
 inline int minor_piece_index(const Position& pos) {
    return pos.minor_piece_key() & (CORRECTION_HISTORY_SIZE - 1);
 }
 template<Color c>
 inline int non_pawn_index(const Position& pos) {
    return pos.non_pawn_key(c) & (CORRECTION_HISTORY_SIZE - 1);
 }
 // StatsEntry is the container of various numerical statistics. We use a class
 // instead of a naked value to directly call history update operator<<() on
 // the entry. The first template parameter T is the base type of the array,
 // and the second template parameter D limits the range of updates in [-D, D]
 // when we update values with the << operator
 template<typename T, int D>
 class StatsEntry {
    static_assert(std::is_arithmetic<T>::value, "Not an arithmetic type");
    static_assert(D <= std::numeric_limits<T>::max(), "D overflows T");
    T entry;
   public:
    StatsEntry& operator=(const T& v) {
        entry = v;
        return *this;
    }
    operator const T&() const { return entry; }
    void operator<<(int bonus) {
        // Make sure that bonus is in range [-D, D]
        int clampedBonus = std::clamp(bonus, -D, D);
        entry += clampedBonus - entry * std::abs(clampedBonus) / D;
        assert(std::abs(entry) <= D);
    }
 };
 enum StatsType {
    NoCaptures,
    Captures
 };
 template<typename T, int D, std::size_t... Sizes>
 using Stats = MultiArray<StatsEntry<T, D>, Sizes...>;
 // ButterflyHistory records how often quiet moves have been successful or unsuccessful
 // during the current search, and is used for reduction and move ordering decisions.
 // It uses 2 tables (one for each color) indexed by the move's from and to squares,
 // see https://www.chessprogramming.org/Butterfly_Boards (~11 elo)
 using ButterflyHistory = Stats<std::int16_t, 7183, COLOR_NB, int(SQUARE_NB) * int(SQUARE_NB)>;
 // LowPlyHistory is adressed by play and move's from and to squares, used
 // to improve move ordering near the root
 using LowPlyHistory =
  Stats<std::int16_t, 7183, LOW_PLY_HISTORY_SIZE, int(SQUARE_NB) * int(SQUARE_NB)>;
 // CapturePieceToHistory is addressed by a move's [piece][to][captured piece type]
 using CapturePieceToHistory = Stats<std::int16_t, 10692, PIECE_NB, SQUARE_NB, PIECE_TYPE_NB>;
 // PieceToHistory is like ButterflyHistory but is addressed by a move's [piece][to]
 using PieceToHistory = Stats<std::int16_t, 30000, PIECE_NB, SQUARE_NB>;
 // ContinuationHistory is the combined history of a given pair of moves, usually
 // the current one given a previous one. The nested history table is based on
 // PieceToHistory instead of ButterflyBoards.
 // (~63 elo)
 using ContinuationHistory = MultiArray<PieceToHistory, PIECE_NB, SQUARE_NB>;
 // PawnHistory is addressed by the pawn structure and a move's [piece][to]
 using PawnHistory = Stats<std::int16_t, 8192, PAWN_HISTORY_SIZE, PIECE_NB, SQUARE_NB>;
 // Correction histories record differences between the static evaluation of
 // positions and their search score. It is used to improve the static evaluation
 // used by some search heuristics.
 // see https://www.chessprogramming.org/Static_Evaluation_Correction_History
 enum CorrHistType {
    Pawn,          // By color and pawn structure
    Minor,         // By color and positions of minor pieces (Knight, Bishop)
    NonPawn,       // By non-pawn material positions and color
    PieceTo,       // By [piece][to] move
    Continuation,  // Combined history of move pairs
 };
 namespace Detail {
 template<CorrHistType>
 struct CorrHistTypedef {
    using type = Stats<std::int16_t, CORRECTION_HISTORY_LIMIT, CORRECTION_HISTORY_SIZE, COLOR_NB>;
 };
 template<>
 struct CorrHistTypedef<PieceTo> {
    using type = Stats<std::int16_t, CORRECTION_HISTORY_LIMIT, PIECE_NB, SQUARE_NB>;
 };
 template<>
 struct CorrHistTypedef<Continuation> {
    using type = MultiArray<CorrHistTypedef<PieceTo>::type, PIECE_NB, SQUARE_NB>;
 };
 }
 template<CorrHistType T>
 using CorrectionHistory = typename Detail::CorrHistTypedef<T>::type;
 }  // namespace Stockfish
 #endif  // #ifndef HISTORY_H_INCLUDED
@@ -26,9 +26,7 @@
      defined(__SSSE3__)    || \
      defined(__SSE4_1__)   || \
      defined(__SSE4_2__)   || \
-      defined(__neon__)     || \
+      defined(__neon__)
      defined(__ARM_NEON)   || \
      defined(__ALTIVEC__)
 # define INCBIN_ALIGNMENT_INDEX 4
 #elif ULONG_MAX != 0xffffffffu
 # define INCBIN_ALIGNMENT_INDEX 3
@@ -66,9 +64,6 @@
    X
 #define INCBIN_INVOKE(N, ...) \
    INCBIN_EVAL(N(__VA_ARGS__))
 /* Variable argument count for overloading by arity */
 #define INCBIN_VA_ARG_COUNTER(_1, _2, _3, N, ...) N
 #define INCBIN_VA_ARGC(...) INCBIN_VA_ARG_COUNTER(__VA_ARGS__, 3, 2, 1, 0)
 /* Green Hills uses a different directive for including binary data */
 #if defined(__ghs__)
@@ -122,49 +117,28 @@
 #endif
 /**
- * @brief Optionally override the linker section into which size and data is
+ * @brief Optionally override the linker section into which data is emitted.
- * emitted.
+ *
- * 
+ * @warning If you use this facility, you'll have to deal with platform-specific linker output
- * @warning If you use this facility, you might have to deal with
+ * section naming on your own
- * platform-specific linker output section naming on your own.
+ *
 * Overriding the default linker output section, e.g for esp8266/Arduino:
 * @code
 * #define INCBIN_OUTPUT_SECTION ".irom.text"
 * #include "incbin.h"
 * INCBIN(Foo, "foo.txt");
 * // Data is emitted into program memory that never gets copied to RAM
 * @endcode
 */
 #if !defined(INCBIN_OUTPUT_SECTION)
 #  if defined(__APPLE__)
-#    define INCBIN_OUTPUT_SECTION ".const_data"
+#    define INCBIN_OUTPUT_SECTION         ".const_data"
 #  else
-#    define INCBIN_OUTPUT_SECTION ".rodata"
+#    define INCBIN_OUTPUT_SECTION         ".rodata"
 #  endif
 #endif
 /**
 * @brief Optionally override the linker section into which data is emitted.
 *
 * @warning If you use this facility, you might have to deal with
 * platform-specific linker output section naming on your own.
 */
 #if !defined(INCBIN_OUTPUT_DATA_SECTION)
 #  define INCBIN_OUTPUT_DATA_SECTION INCBIN_OUTPUT_SECTION
 #endif
 /**
 * @brief Optionally override the linker section into which size is emitted.
 *
 * @warning If you use this facility, you might have to deal with
 * platform-specific linker output section naming on your own.
 * 
 * @note This is useful for Harvard architectures where program memory cannot
 * be directly read from the program without special instructions. With this you
 * can chose to put the size variable in RAM rather than ROM.
 */
 #if !defined(INCBIN_OUTPUT_SIZE_SECTION)
 #  define INCBIN_OUTPUT_SIZE_SECTION INCBIN_OUTPUT_SECTION
 #endif
 #if defined(__APPLE__)
 #  include "TargetConditionals.h"
 #  if defined(TARGET_OS_IPHONE) && !defined(INCBIN_SILENCE_BITCODE_WARNING)
 #    warning "incbin is incompatible with bitcode. Using the library will break upload to App Store if you have bitcode enabled. Add `#define INCBIN_SILENCE_BITCODE_WARNING` before including this header to silence this warning."
 #  endif
 /* The directives are different for Apple branded compilers */
 #  define INCBIN_SECTION         INCBIN_OUTPUT_SECTION "\n"
 #  define INCBIN_GLOBAL(NAME)    ".globl " INCBIN_MANGLE INCBIN_STRINGIZE(INCBIN_PREFIX) #NAME "\n"
@@ -205,17 +179,27 @@
 /**
 * @brief Specify the prefix to use for symbol names.
 *
- * @note By default this is "g".
+ * By default this is `g', producing symbols of the form:
 * @code
 * #include "incbin.h"
 * INCBIN(Foo, "foo.txt");
 *
 * // Now you have the following symbols:
 * // const unsigned char gFooData[];
 * // const unsigned char *const gFooEnd;
 * // const unsigned int gFooSize;
 * @endcode
 *
 * If however you specify a prefix before including: e.g:
 * @code
 * #define INCBIN_PREFIX incbin
 * #include "incbin.h"
 * INCBIN(Foo, "foo.txt");
 *
 * // Now you have the following symbols instead:
- * // const unsigned char incbinFoo<data>[];
+ * // const unsigned char incbinFooData[];
- * // const unsigned char *const incbinFoo<end>;
+ * // const unsigned char *const incbinFooEnd;
- * // const unsigned int incbinFoo<size>;
+ * // const unsigned int incbinFooSize;
 * @endcode
 */
 #if !defined(INCBIN_PREFIX)
@@ -229,8 +213,18 @@
 * - INCBIN_STYLE_CAMEL "CamelCase"
 * - INCBIN_STYLE_SNAKE "snake_case"
 *
- * @note By default this is INCBIN_STYLE_CAMEL
+ * Default option is *INCBIN_STYLE_CAMEL* producing symbols of the form:
 * @code
 * #include "incbin.h"
 * INCBIN(Foo, "foo.txt");
 *
 * // Now you have the following symbols:
 * // const unsigned char <prefix>FooData[];
 * // const unsigned char *const <prefix>FooEnd;
 * // const unsigned int <prefix>FooSize;
 * @endcode
 *
 * If however you specify a style before including: e.g:
 * @code
 * #define INCBIN_STYLE INCBIN_STYLE_SNAKE
 * #include "incbin.h"
@@ -294,38 +288,23 @@
 * The symbol names are a concatenation of `INCBIN_PREFIX' before *NAME*; with
 * "Data", as well as "End" and "Size" after. An example is provided below.
 *
 * @param TYPE Optional array type. Omitting this picks a default of `unsigned char`.
 * @param NAME The name given for the binary data
 *
 * @code
 * INCBIN_EXTERN(Foo);
 *
 * // Now you have the following symbols:
- * // extern const unsigned char <prefix>Foo<data>[];
+ * // extern const unsigned char <prefix>FooData[];
- * // extern const unsigned char *const <prefix>Foo<end>;
+ * // extern const unsigned char *const <prefix>FooEnd;
- * // extern const unsigned int <prefix>Foo<size>;
+ * // extern const unsigned int <prefix>FooSize;
 * @endcode
 * 
 * You may specify a custom optional data type as well as the first argument.
 * @code
 * INCBIN_EXTERN(custom_type, Foo);
 * 
 * // Now you have the following symbols:
 * // extern const custom_type <prefix>Foo<data>[];
 * // extern const custom_type *const <prefix>Foo<end>;
 * // extern const unsigned int <prefix>Foo<size>;
 * @endcode
 */
-#define INCBIN_EXTERN(...) \
+#define INCBIN_EXTERN(NAME) \
-    INCBIN_CONCATENATE(INCBIN_EXTERN_, INCBIN_VA_ARGC(__VA_ARGS__))(__VA_ARGS__)
+    INCBIN_EXTERNAL const INCBIN_ALIGN unsigned char \
 #define INCBIN_EXTERN_1(NAME, ...) \
    INCBIN_EXTERN_2(unsigned char, NAME)
 #define INCBIN_EXTERN_2(TYPE, NAME) \
    INCBIN_EXTERNAL const INCBIN_ALIGN TYPE \
        INCBIN_CONCATENATE( \
            INCBIN_CONCATENATE(INCBIN_PREFIX, NAME), \
            INCBIN_STYLE_IDENT(DATA))[]; \
-    INCBIN_EXTERNAL const INCBIN_ALIGN TYPE *const \
+    INCBIN_EXTERNAL const INCBIN_ALIGN unsigned char *const \
    INCBIN_CONCATENATE( \
        INCBIN_CONCATENATE(INCBIN_PREFIX, NAME), \
        INCBIN_STYLE_IDENT(END)); \
@@ -334,29 +313,6 @@
            INCBIN_CONCATENATE(INCBIN_PREFIX, NAME), \
            INCBIN_STYLE_IDENT(SIZE))
 /**
 * @brief Externally reference textual data included in another translation unit.
 *
 * Produces three external symbols that reference the textual data included in
 * another translation unit.
 *
 * The symbol names are a concatenation of `INCBIN_PREFIX' before *NAME*; with
 * "Data", as well as "End" and "Size" after. An example is provided below.
 *
 * @param NAME The name given for the textual data
 *
 * @code
 * INCBIN_EXTERN(Foo);
 *
 * // Now you have the following symbols:
 * // extern const char <prefix>Foo<data>[];
 * // extern const char *const <prefix>Foo<end>;
 * // extern const unsigned int <prefix>Foo<size>;
 * @endcode
 */
 #define INCTXT_EXTERN(NAME) \
    INCBIN_EXTERN_2(char, NAME)
 /**
 * @brief Include a binary file into the current translation unit.
 *
@@ -366,7 +322,6 @@
 * The symbol names are a concatenation of `INCBIN_PREFIX' before *NAME*; with
 * "Data", as well as "End" and "Size" after. An example is provided below.
 *
 * @param TYPE Optional array type. Omitting this picks a default of `unsigned char`.
 * @param NAME The name to associate with this binary data (as an identifier.)
 * @param FILENAME The file to include (as a string literal.)
 *
@@ -374,20 +329,9 @@
 * INCBIN(Icon, "icon.png");
 *
 * // Now you have the following symbols:
- * // const unsigned char <prefix>Icon<data>[];
+ * // const unsigned char <prefix>IconData[];
- * // const unsigned char *const <prefix>Icon<end>;
+ * // const unsigned char *const <prefix>IconEnd;
- * // const unsigned int <prefix>Icon<size>;
+ * // const unsigned int <prefix>IconSize;
 * @endcode
 * 
 * You may specify a custom optional data type as well as the first argument.
 * These macros are specialized by arity.
 * @code
 * INCBIN(custom_type, Icon, "icon.png");
 *
 * // Now you have the following symbols:
 * // const custom_type <prefix>Icon<data>[];
 * // const custom_type *const <prefix>Icon<end>;
 * // const unsigned int <prefix>Icon<size>;
 * @endcode
 *
 * @warning This must be used in global scope
@@ -397,28 +341,15 @@
 * please @see INCBIN_EXTERN.
 */
 #ifdef _MSC_VER
-#  define INCBIN(NAME, FILENAME) \
+#define INCBIN(NAME, FILENAME) \
-      INCBIN_EXTERN(NAME)
+    INCBIN_EXTERN(NAME)
 #else
-#  define INCBIN(...) \
+#define INCBIN(NAME, FILENAME) \
     INCBIN_CONCATENATE(INCBIN_, INCBIN_VA_ARGC(__VA_ARGS__))(__VA_ARGS__)
 #  if defined(__GNUC__)
 #    define INCBIN_1(...) _Pragma("GCC error \"Single argument INCBIN not allowed\"")
 #  elif defined(__clang__)
 #    define INCBIN_1(...) _Pragma("clang error \"Single argument INCBIN not allowed\"")
 #  else
 #    define INCBIN_1(...) /* Cannot do anything here */
 #  endif
 #  define INCBIN_2(NAME, FILENAME) \
      INCBIN_3(unsigned char, NAME, FILENAME)
 #  define INCBIN_3(TYPE, NAME, FILENAME) INCBIN_COMMON(TYPE, NAME, FILENAME, /* No terminator for binary data */)
 #  define INCBIN_COMMON(TYPE, NAME, FILENAME, TERMINATOR) \
    __asm__(INCBIN_SECTION \
            INCBIN_GLOBAL_LABELS(NAME, DATA) \
            INCBIN_ALIGN_HOST \
            INCBIN_MANGLE INCBIN_STRINGIZE(INCBIN_PREFIX) #NAME INCBIN_STYLE_STRING(DATA) ":\n" \
            INCBIN_MACRO " \"" FILENAME "\"\n" \
                TERMINATOR \
            INCBIN_GLOBAL_LABELS(NAME, END) \
            INCBIN_ALIGN_BYTE \
            INCBIN_MANGLE INCBIN_STRINGIZE(INCBIN_PREFIX) #NAME INCBIN_STYLE_STRING(END) ":\n" \
@@ -431,46 +362,7 @@
            INCBIN_ALIGN_HOST \
            ".text\n" \
    ); \
-    INCBIN_EXTERN(TYPE, NAME)
+    INCBIN_EXTERN(NAME)
 #endif
 /**
 * @brief Include a textual file into the current translation unit.
 * 
 * This behaves the same as INCBIN except it produces char compatible arrays
 * and implicitly adds a null-terminator byte, thus the size of data included
 * by this is one byte larger than that of INCBIN.
 *
 * Includes a textual file into the current translation unit, producing three
 * symbols for objects that encode the data and size respectively.
 *
 * The symbol names are a concatenation of `INCBIN_PREFIX' before *NAME*; with
 * "Data", as well as "End" and "Size" after. An example is provided below.
 *
 * @param NAME The name to associate with this binary data (as an identifier.)
 * @param FILENAME The file to include (as a string literal.)
 *
 * @code
 * INCTXT(Readme, "readme.txt");
 *
 * // Now you have the following symbols:
 * // const char <prefix>Readme<data>[];
 * // const char *const <prefix>Readme<end>;
 * // const unsigned int <prefix>Readme<size>;
 * @endcode
 *
 * @warning This must be used in global scope
 * @warning The identifiers may be different if INCBIN_STYLE is not default
 *
 * To externally reference the data included by this in another translation unit
 * please @see INCBIN_EXTERN.
 */
 #if defined(_MSC_VER)
 #  define INCTXT(NAME, FILENAME) \
     INCBIN_EXTERN(NAME)
 #else
 #  define INCTXT(NAME, FILENAME) \
     INCBIN_COMMON(char, NAME, FILENAME, INCBIN_BYTE "0\n")
 #endif
-
+#endif
 #endif
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -18,27 +18,38 @@
 #include <iostream>
 #include "nnue/evaluate_nnue.h"
 #include "bitboard.h"
-#include "misc.h"
+#include "endgame.h"
 #include "position.h"
-#include "types.h"
+#include "psqt.h"
 #include "search.h"
 #include "syzygy/tbprobe.h"
 #include "thread.h"
 #include "tt.h"
 #include "uci.h"
 #include "tune.h"
 using namespace Stockfish;
 int main(int argc, char* argv[]) {
-    std::cout << engine_info() << std::endl;
+  std::cout << engine_info() << std::endl;
-    Bitboards::init();
+  CommandLine::init(argc, argv);
-    Position::init();
+  UCI::init(Options);
  Tune::init();
  PSQT::init();
  Bitboards::init();
  Position::init();
  Bitbases::init();
  Endgames::init();
  Threads.set(size_t(Options["Threads"]));
  Search::clear(); // After threads are up
  Eval::NNUE::init();
-    UCIEngine uci(argc, argv);
+  UCI::loop(argc, argv);
-    Tune::init(uci.engine_options());
+  Threads.set(0);
-
+  return 0;
    uci.loop();
    return 0;
 }
@@ -0,0 +1,229 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include <cassert>
 #include <cstring>   // For std::memset
 #include "material.h"
 #include "thread.h"
 using namespace std;
 namespace Stockfish {
 namespace {
  #define S(mg, eg) make_score(mg, eg)
  // Polynomial material imbalance parameters
  // One Score parameter for each pair (our piece, another of our pieces)
  constexpr Score QuadraticOurs[][PIECE_TYPE_NB] = {
    // OUR PIECE 2
    // bishop pair    pawn         knight       bishop       rook           queen
    {S(1419, 1455)                                                                  }, // Bishop pair
    {S( 101,   28), S( 37,  39)                                                     }, // Pawn
    {S(  57,   64), S(249, 187), S(-49, -62)                                        }, // Knight      OUR PIECE 1
    {S(   0,    0), S(118, 137), S( 10,  27), S(  0,   0)                           }, // Bishop
    {S( -63,  -68), S( -5,   3), S(100,  81), S(132, 118), S(-246, -244)            }, // Rook
    {S(-210, -211), S( 37,  14), S(147, 141), S(161, 105), S(-158, -174), S(-9,-31) }  // Queen
  };
  // One Score parameter for each pair (our piece, their piece)
  constexpr Score QuadraticTheirs[][PIECE_TYPE_NB] = {
    // THEIR PIECE
    // bishop pair   pawn         knight       bishop       rook         queen
    {                                                                               }, // Bishop pair
    {S(  33,  30)                                                                   }, // Pawn
    {S(  46,  18), S(106,  84)                                                      }, // Knight      OUR PIECE
    {S(  75,  35), S( 59,  44), S( 60,  15)                                         }, // Bishop
    {S(  26,  35), S(  6,  22), S( 38,  39), S(-12,  -2)                            }, // Rook
    {S(  97,  93), S(100, 163), S(-58, -91), S(112, 192), S(276, 225)               }  // Queen
  };
  #undef S
  // Endgame evaluation and scaling functions are accessed directly and not through
  // the function maps because they correspond to more than one material hash key.
  Endgame<KXK>    EvaluateKXK[] = { Endgame<KXK>(WHITE),    Endgame<KXK>(BLACK) };
  Endgame<KBPsK>  ScaleKBPsK[]  = { Endgame<KBPsK>(WHITE),  Endgame<KBPsK>(BLACK) };
  Endgame<KQKRPs> ScaleKQKRPs[] = { Endgame<KQKRPs>(WHITE), Endgame<KQKRPs>(BLACK) };
  Endgame<KPsK>   ScaleKPsK[]   = { Endgame<KPsK>(WHITE),   Endgame<KPsK>(BLACK) };
  Endgame<KPKP>   ScaleKPKP[]   = { Endgame<KPKP>(WHITE),   Endgame<KPKP>(BLACK) };
  // Helper used to detect a given material distribution
  bool is_KXK(const Position& pos, Color us) {
    return  !more_than_one(pos.pieces(~us))
          && pos.non_pawn_material(us) >= RookValueMg;
  }
  bool is_KBPsK(const Position& pos, Color us) {
    return   pos.non_pawn_material(us) == BishopValueMg
          && pos.count<PAWN>(us) >= 1;
  }
  bool is_KQKRPs(const Position& pos, Color us) {
    return  !pos.count<PAWN>(us)
          && pos.non_pawn_material(us) == QueenValueMg
          && pos.count<ROOK>(~us) == 1
          && pos.count<PAWN>(~us) >= 1;
  }
  /// imbalance() calculates the imbalance by comparing the piece count of each
  /// piece type for both colors.
  template<Color Us>
  Score imbalance(const int pieceCount[][PIECE_TYPE_NB]) {
    constexpr Color Them = ~Us;
    Score bonus = SCORE_ZERO;
    // Second-degree polynomial material imbalance, by Tord Romstad
    for (int pt1 = NO_PIECE_TYPE; pt1 <= QUEEN; ++pt1)
    {
        if (!pieceCount[Us][pt1])
            continue;
        int v = QuadraticOurs[pt1][pt1] * pieceCount[Us][pt1];
        for (int pt2 = NO_PIECE_TYPE; pt2 < pt1; ++pt2)
            v +=  QuadraticOurs[pt1][pt2] * pieceCount[Us][pt2]
                + QuadraticTheirs[pt1][pt2] * pieceCount[Them][pt2];
        bonus += pieceCount[Us][pt1] * v;
    }
    return bonus;
  }
 } // namespace
 namespace Material {
 /// Material::probe() looks up the current position's material configuration in
 /// the material hash table. It returns a pointer to the Entry if the position
 /// is found. Otherwise a new Entry is computed and stored there, so we don't
 /// have to recompute all when the same material configuration occurs again.
 Entry* probe(const Position& pos) {
  Key key = pos.material_key();
  Entry* e = pos.this_thread()->materialTable[key];
  if (e->key == key)
      return e;
  std::memset(e, 0, sizeof(Entry));
  e->key = key;
  e->factor[WHITE] = e->factor[BLACK] = (uint8_t)SCALE_FACTOR_NORMAL;
  Value npm_w = pos.non_pawn_material(WHITE);
  Value npm_b = pos.non_pawn_material(BLACK);
  Value npm   = std::clamp(npm_w + npm_b, EndgameLimit, MidgameLimit);
  // Map total non-pawn material into [PHASE_ENDGAME, PHASE_MIDGAME]
  e->gamePhase = Phase(((npm - EndgameLimit) * PHASE_MIDGAME) / (MidgameLimit - EndgameLimit));
  // Let's look if we have a specialized evaluation function for this particular
  // material configuration. Firstly we look for a fixed configuration one, then
  // for a generic one if the previous search failed.
  if ((e->evaluationFunction = Endgames::probe<Value>(key)) != nullptr)
      return e;
  for (Color c : { WHITE, BLACK })
      if (is_KXK(pos, c))
      {
          e->evaluationFunction = &EvaluateKXK[c];
          return e;
      }
  // OK, we didn't find any special evaluation function for the current material
  // configuration. Is there a suitable specialized scaling function?
  const auto* sf = Endgames::probe<ScaleFactor>(key);
  if (sf)
  {
      e->scalingFunction[sf->strongSide] = sf; // Only strong color assigned
      return e;
  }
  // We didn't find any specialized scaling function, so fall back on generic
  // ones that refer to more than one material distribution. Note that in this
  // case we don't return after setting the function.
  for (Color c : { WHITE, BLACK })
  {
    if (is_KBPsK(pos, c))
        e->scalingFunction[c] = &ScaleKBPsK[c];
    else if (is_KQKRPs(pos, c))
        e->scalingFunction[c] = &ScaleKQKRPs[c];
  }
  if (npm_w + npm_b == VALUE_ZERO && pos.pieces(PAWN)) // Only pawns on the board
  {
      if (!pos.count<PAWN>(BLACK))
      {
          assert(pos.count<PAWN>(WHITE) >= 2);
          e->scalingFunction[WHITE] = &ScaleKPsK[WHITE];
      }
      else if (!pos.count<PAWN>(WHITE))
      {
          assert(pos.count<PAWN>(BLACK) >= 2);
          e->scalingFunction[BLACK] = &ScaleKPsK[BLACK];
      }
      else if (pos.count<PAWN>(WHITE) == 1 && pos.count<PAWN>(BLACK) == 1)
      {
          // This is a special case because we set scaling functions
          // for both colors instead of only one.
          e->scalingFunction[WHITE] = &ScaleKPKP[WHITE];
          e->scalingFunction[BLACK] = &ScaleKPKP[BLACK];
      }
  }
  // Zero or just one pawn makes it difficult to win, even with a small material
  // advantage. This catches some trivial draws like KK, KBK and KNK and gives a
  // drawish scale factor for cases such as KRKBP and KmmKm (except for KBBKN).
  if (!pos.count<PAWN>(WHITE) && npm_w - npm_b <= BishopValueMg)
      e->factor[WHITE] = uint8_t(npm_w <  RookValueMg   ? SCALE_FACTOR_DRAW :
                                 npm_b <= BishopValueMg ? 4 : 14);
  if (!pos.count<PAWN>(BLACK) && npm_b - npm_w <= BishopValueMg)
      e->factor[BLACK] = uint8_t(npm_b <  RookValueMg   ? SCALE_FACTOR_DRAW :
                                 npm_w <= BishopValueMg ? 4 : 14);
  // Evaluate the material imbalance. We use PIECE_TYPE_NONE as a place holder
  // for the bishop pair "extended piece", which allows us to be more flexible
  // in defining bishop pair bonuses.
  const int pieceCount[COLOR_NB][PIECE_TYPE_NB] = {
  { pos.count<BISHOP>(WHITE) > 1, pos.count<PAWN>(WHITE), pos.count<KNIGHT>(WHITE),
    pos.count<BISHOP>(WHITE)    , pos.count<ROOK>(WHITE), pos.count<QUEEN >(WHITE) },
  { pos.count<BISHOP>(BLACK) > 1, pos.count<PAWN>(BLACK), pos.count<KNIGHT>(BLACK),
    pos.count<BISHOP>(BLACK)    , pos.count<ROOK>(BLACK), pos.count<QUEEN >(BLACK) } };
  e->score = (imbalance<WHITE>(pieceCount) - imbalance<BLACK>(pieceCount)) / 16;
  return e;
 }
 } // namespace Material
 } // namespace Stockfish
@@ -0,0 +1,71 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef MATERIAL_H_INCLUDED
 #define MATERIAL_H_INCLUDED
 #include "endgame.h"
 #include "misc.h"
 #include "position.h"
 #include "types.h"
 namespace Stockfish::Material {
 /// Material::Entry contains various information about a material configuration.
 /// It contains a material imbalance evaluation, a function pointer to a special
 /// endgame evaluation function (which in most cases is NULL, meaning that the
 /// standard evaluation function will be used), and scale factors.
 ///
 /// The scale factors are used to scale the evaluation score up or down. For
 /// instance, in KRB vs KR endgames, the score is scaled down by a factor of 4,
 /// which will result in scores of absolute value less than one pawn.
 struct Entry {
  Score imbalance() const { return score; }
  Phase game_phase() const { return (Phase)gamePhase; }
  bool specialized_eval_exists() const { return evaluationFunction != nullptr; }
  Value evaluate(const Position& pos) const { return (*evaluationFunction)(pos); }
  // scale_factor() takes a position and a color as input and returns a scale factor
  // for the given color. We have to provide the position in addition to the color
  // because the scale factor may also be a function which should be applied to
  // the position. For instance, in KBP vs K endgames, the scaling function looks
  // for rook pawns and wrong-colored bishops.
  ScaleFactor scale_factor(const Position& pos, Color c) const {
    ScaleFactor sf = scalingFunction[c] ? (*scalingFunction[c])(pos)
                                        :  SCALE_FACTOR_NONE;
    return sf != SCALE_FACTOR_NONE ? sf : ScaleFactor(factor[c]);
  }
  Key key;
  const EndgameBase<Value>* evaluationFunction;
  const EndgameBase<ScaleFactor>* scalingFunction[COLOR_NB]; // Could be one for each
                                                             // side (e.g. KPKP, KBPsK)
  Score score;
  int16_t gamePhase;
  uint8_t factor[COLOR_NB];
 };
 typedef HashTable<Entry, 8192> Table;
 Entry* probe(const Position& pos);
 } // namespace Stockfish::Material
 #endif // #ifndef MATERIAL_H_INCLUDED
@@ -1,268 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "memory.h"
 #include <cstdlib>
 #if __has_include("features.h")
    #include <features.h>
 #endif
 #if defined(__linux__) && !defined(__ANDROID__)
    #include <sys/mman.h>
 #endif
 #if defined(__APPLE__) || defined(__ANDROID__) || defined(__OpenBSD__) \
  || (defined(__GLIBCXX__) && !defined(_GLIBCXX_HAVE_ALIGNED_ALLOC) && !defined(_WIN32)) \
  || defined(__e2k__)
    #define POSIXALIGNEDALLOC
    #include <stdlib.h>
 #endif
 #ifdef _WIN32
    #if _WIN32_WINNT < 0x0601
        #undef _WIN32_WINNT
        #define _WIN32_WINNT 0x0601  // Force to include needed API prototypes
    #endif
    #ifndef NOMINMAX
        #define NOMINMAX
    #endif
    #include <ios>       // std::hex, std::dec
    #include <iostream>  // std::cerr
    #include <ostream>   // std::endl
    #include <windows.h>
 // The needed Windows API for processor groups could be missed from old Windows
 // versions, so instead of calling them directly (forcing the linker to resolve
 // the calls at compile time), try to load them at runtime. To do this we need
 // first to define the corresponding function pointers.
 extern "C" {
 using OpenProcessToken_t      = bool (*)(HANDLE, DWORD, PHANDLE);
 using LookupPrivilegeValueA_t = bool (*)(LPCSTR, LPCSTR, PLUID);
 using AdjustTokenPrivileges_t =
  bool (*)(HANDLE, BOOL, PTOKEN_PRIVILEGES, DWORD, PTOKEN_PRIVILEGES, PDWORD);
 }
 #endif
 namespace Stockfish {
 // Wrappers for systems where the c++17 implementation does not guarantee the
 // availability of aligned_alloc(). Memory allocated with std_aligned_alloc()
 // must be freed with std_aligned_free().
 void* std_aligned_alloc(size_t alignment, size_t size) {
 #if defined(_ISOC11_SOURCE)
    return aligned_alloc(alignment, size);
 #elif defined(POSIXALIGNEDALLOC)
    void* mem = nullptr;
    posix_memalign(&mem, alignment, size);
    return mem;
 #elif defined(_WIN32) && !defined(_M_ARM) && !defined(_M_ARM64)
    return _mm_malloc(size, alignment);
 #elif defined(_WIN32)
    return _aligned_malloc(size, alignment);
 #else
    return std::aligned_alloc(alignment, size);
 #endif
 }
 void std_aligned_free(void* ptr) {
 #if defined(POSIXALIGNEDALLOC)
    free(ptr);
 #elif defined(_WIN32) && !defined(_M_ARM) && !defined(_M_ARM64)
    _mm_free(ptr);
 #elif defined(_WIN32)
    _aligned_free(ptr);
 #else
    free(ptr);
 #endif
 }
 // aligned_large_pages_alloc() will return suitably aligned memory,
 // if possible using large pages.
 #if defined(_WIN32)
 static void* aligned_large_pages_alloc_windows([[maybe_unused]] size_t allocSize) {
    #if !defined(_WIN64)
    return nullptr;
    #else
    HANDLE hProcessToken{};
    LUID   luid{};
    void*  mem = nullptr;
    const size_t largePageSize = GetLargePageMinimum();
    if (!largePageSize)
        return nullptr;
    // Dynamically link OpenProcessToken, LookupPrivilegeValue and AdjustTokenPrivileges
    HMODULE hAdvapi32 = GetModuleHandle(TEXT("advapi32.dll"));
    if (!hAdvapi32)
        hAdvapi32 = LoadLibrary(TEXT("advapi32.dll"));
    auto OpenProcessToken_f =
      OpenProcessToken_t((void (*)()) GetProcAddress(hAdvapi32, "OpenProcessToken"));
    if (!OpenProcessToken_f)
        return nullptr;
    auto LookupPrivilegeValueA_f =
      LookupPrivilegeValueA_t((void (*)()) GetProcAddress(hAdvapi32, "LookupPrivilegeValueA"));
    if (!LookupPrivilegeValueA_f)
        return nullptr;
    auto AdjustTokenPrivileges_f =
      AdjustTokenPrivileges_t((void (*)()) GetProcAddress(hAdvapi32, "AdjustTokenPrivileges"));
    if (!AdjustTokenPrivileges_f)
        return nullptr;
    // We need SeLockMemoryPrivilege, so try to enable it for the process
    if (!OpenProcessToken_f(  // OpenProcessToken()
          GetCurrentProcess(), TOKEN_ADJUST_PRIVILEGES | TOKEN_QUERY, &hProcessToken))
        return nullptr;
    if (LookupPrivilegeValueA_f(nullptr, "SeLockMemoryPrivilege", &luid))
    {
        TOKEN_PRIVILEGES tp{};
        TOKEN_PRIVILEGES prevTp{};
        DWORD            prevTpLen = 0;
        tp.PrivilegeCount           = 1;
        tp.Privileges[0].Luid       = luid;
        tp.Privileges[0].Attributes = SE_PRIVILEGE_ENABLED;
        // Try to enable SeLockMemoryPrivilege. Note that even if AdjustTokenPrivileges()
        // succeeds, we still need to query GetLastError() to ensure that the privileges
        // were actually obtained.
        if (AdjustTokenPrivileges_f(hProcessToken, FALSE, &tp, sizeof(TOKEN_PRIVILEGES), &prevTp,
                                    &prevTpLen)
            && GetLastError() == ERROR_SUCCESS)
        {
            // Round up size to full pages and allocate
            allocSize = (allocSize + largePageSize - 1) & ~size_t(largePageSize - 1);
            mem       = VirtualAlloc(nullptr, allocSize, MEM_RESERVE | MEM_COMMIT | MEM_LARGE_PAGES,
                                     PAGE_READWRITE);
            // Privilege no longer needed, restore previous state
            AdjustTokenPrivileges_f(hProcessToken, FALSE, &prevTp, 0, nullptr, nullptr);
        }
    }
    CloseHandle(hProcessToken);
    return mem;
    #endif
 }
 void* aligned_large_pages_alloc(size_t allocSize) {
    // Try to allocate large pages
    void* mem = aligned_large_pages_alloc_windows(allocSize);
    // Fall back to regular, page-aligned, allocation if necessary
    if (!mem)
        mem = VirtualAlloc(nullptr, allocSize, MEM_RESERVE | MEM_COMMIT, PAGE_READWRITE);
    return mem;
 }
 #else
 void* aligned_large_pages_alloc(size_t allocSize) {
    #if defined(__linux__)
    constexpr size_t alignment = 2 * 1024 * 1024;  // 2MB page size assumed
    #else
    constexpr size_t alignment = 4096;  // small page size assumed
    #endif
    // Round up to multiples of alignment
    size_t size = ((allocSize + alignment - 1) / alignment) * alignment;
    void*  mem  = std_aligned_alloc(alignment, size);
    #if defined(MADV_HUGEPAGE)
    madvise(mem, size, MADV_HUGEPAGE);
    #endif
    return mem;
 }
 #endif
 bool has_large_pages() {
 #if defined(_WIN32)
    constexpr size_t page_size = 2 * 1024 * 1024;  // 2MB page size assumed
    void*            mem       = aligned_large_pages_alloc_windows(page_size);
    if (mem == nullptr)
    {
        return false;
    }
    else
    {
        aligned_large_pages_free(mem);
        return true;
    }
 #elif defined(__linux__)
    #if defined(MADV_HUGEPAGE)
    return true;
    #else
    return false;
    #endif
 #else
    return false;
 #endif
 }
 // aligned_large_pages_free() will free the previously memory allocated
 // by aligned_large_pages_alloc(). The effect is a nop if mem == nullptr.
 #if defined(_WIN32)
 void aligned_large_pages_free(void* mem) {
    if (mem && !VirtualFree(mem, 0, MEM_RELEASE))
    {
        DWORD err = GetLastError();
        std::cerr << "Failed to free large page memory. Error code: 0x" << std::hex << err
                  << std::dec << std::endl;
        exit(EXIT_FAILURE);
    }
 }
 #else
 void aligned_large_pages_free(void* mem) { std_aligned_free(mem); }
 #endif
 }  // namespace Stockfish
@@ -1,218 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef MEMORY_H_INCLUDED
 #define MEMORY_H_INCLUDED
 #include <algorithm>
 #include <cstddef>
 #include <cstdint>
 #include <memory>
 #include <new>
 #include <type_traits>
 #include <utility>
 #include "types.h"
 namespace Stockfish {
 void* std_aligned_alloc(size_t alignment, size_t size);
 void  std_aligned_free(void* ptr);
 // Memory aligned by page size, min alignment: 4096 bytes
 void* aligned_large_pages_alloc(size_t size);
 void  aligned_large_pages_free(void* mem);
 bool has_large_pages();
 // Frees memory which was placed there with placement new.
 // Works for both single objects and arrays of unknown bound.
 template<typename T, typename FREE_FUNC>
 void memory_deleter(T* ptr, FREE_FUNC free_func) {
    if (!ptr)
        return;
    // Explicitly needed to call the destructor
    if constexpr (!std::is_trivially_destructible_v<T>)
        ptr->~T();
    free_func(ptr);
    return;
 }
 // Frees memory which was placed there with placement new.
 // Works for both single objects and arrays of unknown bound.
 template<typename T, typename FREE_FUNC>
 void memory_deleter_array(T* ptr, FREE_FUNC free_func) {
    if (!ptr)
        return;
    // Move back on the pointer to where the size is allocated
    const size_t array_offset = std::max(sizeof(size_t), alignof(T));
    char*        raw_memory   = reinterpret_cast<char*>(ptr) - array_offset;
    if constexpr (!std::is_trivially_destructible_v<T>)
    {
        const size_t size = *reinterpret_cast<size_t*>(raw_memory);
        // Explicitly call the destructor for each element in reverse order
        for (size_t i = size; i-- > 0;)
            ptr[i].~T();
    }
    free_func(raw_memory);
 }
 // Allocates memory for a single object and places it there with placement new
 template<typename T, typename ALLOC_FUNC, typename... Args>
 inline std::enable_if_t<!std::is_array_v<T>, T*> memory_allocator(ALLOC_FUNC alloc_func,
                                                                  Args&&... args) {
    void* raw_memory = alloc_func(sizeof(T));
    ASSERT_ALIGNED(raw_memory, alignof(T));
    return new (raw_memory) T(std::forward<Args>(args)...);
 }
 // Allocates memory for an array of unknown bound and places it there with placement new
 template<typename T, typename ALLOC_FUNC>
 inline std::enable_if_t<std::is_array_v<T>, std::remove_extent_t<T>*>
 memory_allocator(ALLOC_FUNC alloc_func, size_t num) {
    using ElementType = std::remove_extent_t<T>;
    const size_t array_offset = std::max(sizeof(size_t), alignof(ElementType));
    // Save the array size in the memory location
    char* raw_memory =
      reinterpret_cast<char*>(alloc_func(array_offset + num * sizeof(ElementType)));
    ASSERT_ALIGNED(raw_memory, alignof(T));
    new (raw_memory) size_t(num);
    for (size_t i = 0; i < num; ++i)
        new (raw_memory + array_offset + i * sizeof(ElementType)) ElementType();
    // Need to return the pointer at the start of the array so that
    // the indexing in unique_ptr<T[]> works.
    return reinterpret_cast<ElementType*>(raw_memory + array_offset);
 }
 //
 //
 // aligned large page unique ptr
 //
 //
 template<typename T>
 struct LargePageDeleter {
    void operator()(T* ptr) const { return memory_deleter<T>(ptr, aligned_large_pages_free); }
 };
 template<typename T>
 struct LargePageArrayDeleter {
    void operator()(T* ptr) const { return memory_deleter_array<T>(ptr, aligned_large_pages_free); }
 };
 template<typename T>
 using LargePagePtr =
  std::conditional_t<std::is_array_v<T>,
                     std::unique_ptr<T, LargePageArrayDeleter<std::remove_extent_t<T>>>,
                     std::unique_ptr<T, LargePageDeleter<T>>>;
 // make_unique_large_page for single objects
 template<typename T, typename... Args>
 std::enable_if_t<!std::is_array_v<T>, LargePagePtr<T>> make_unique_large_page(Args&&... args) {
    static_assert(alignof(T) <= 4096,
                  "aligned_large_pages_alloc() may fail for such a big alignment requirement of T");
    T* obj = memory_allocator<T>(aligned_large_pages_alloc, std::forward<Args>(args)...);
    return LargePagePtr<T>(obj);
 }
 // make_unique_large_page for arrays of unknown bound
 template<typename T>
 std::enable_if_t<std::is_array_v<T>, LargePagePtr<T>> make_unique_large_page(size_t num) {
    using ElementType = std::remove_extent_t<T>;
    static_assert(alignof(ElementType) <= 4096,
                  "aligned_large_pages_alloc() may fail for such a big alignment requirement of T");
    ElementType* memory = memory_allocator<T>(aligned_large_pages_alloc, num);
    return LargePagePtr<T>(memory);
 }
 //
 //
 // aligned unique ptr
 //
 //
 template<typename T>
 struct AlignedDeleter {
    void operator()(T* ptr) const { return memory_deleter<T>(ptr, std_aligned_free); }
 };
 template<typename T>
 struct AlignedArrayDeleter {
    void operator()(T* ptr) const { return memory_deleter_array<T>(ptr, std_aligned_free); }
 };
 template<typename T>
 using AlignedPtr =
  std::conditional_t<std::is_array_v<T>,
                     std::unique_ptr<T, AlignedArrayDeleter<std::remove_extent_t<T>>>,
                     std::unique_ptr<T, AlignedDeleter<T>>>;
 // make_unique_aligned for single objects
 template<typename T, typename... Args>
 std::enable_if_t<!std::is_array_v<T>, AlignedPtr<T>> make_unique_aligned(Args&&... args) {
    const auto func = [](size_t size) { return std_aligned_alloc(alignof(T), size); };
    T*         obj  = memory_allocator<T>(func, std::forward<Args>(args)...);
    return AlignedPtr<T>(obj);
 }
 // make_unique_aligned for arrays of unknown bound
 template<typename T>
 std::enable_if_t<std::is_array_v<T>, AlignedPtr<T>> make_unique_aligned(size_t num) {
    using ElementType = std::remove_extent_t<T>;
    const auto   func   = [](size_t size) { return std_aligned_alloc(alignof(ElementType), size); };
    ElementType* memory = memory_allocator<T>(func, num);
    return AlignedPtr<T>(memory);
 }
 // Get the first aligned element of an array.
 // ptr must point to an array of size at least `sizeof(T) * N + alignment` bytes,
 // where N is the number of elements in the array.
 template<uintptr_t Alignment, typename T>
 T* align_ptr_up(T* ptr) {
    static_assert(alignof(T) < Alignment);
    const uintptr_t ptrint = reinterpret_cast<uintptr_t>(reinterpret_cast<char*>(ptr));
    return reinterpret_cast<T*>(
      reinterpret_cast<char*>((ptrint + (Alignment - 1)) / Alignment * Alignment));
 }
 }  // namespace Stockfish
 #endif  // #ifndef MEMORY_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -20,297 +20,689 @@
 #define MISC_H_INCLUDED
 #include <algorithm>
 #include <array>
 #include <cassert>
 #include <chrono>
-#include <cstddef>
+#include <functional>
-#include <cstdint>
+#include <mutex>
-#include <cstdio>
+#include <ostream>
 #include <iosfwd>
 #include <optional>
 #include <string>
 #include <string_view>
 #include <vector>
 #include <iostream>
-#define stringify2(x) #x
+#include <cstdint>
-#define stringify(x) stringify2(x)
+#include <cmath>
 #include <cctype>
 #include <sstream>
 #include <deque>
 #include "types.h"
 namespace Stockfish {
 std::string engine_version_info();
 std::string engine_info(bool to_uci = false);
 std::string compiler_info();
-
+void prefetch(void* addr);
 // Preloads the given address in L1/L2 cache. This is a non-blocking
 // function that doesn't stall the CPU waiting for data to be loaded from memory,
 // which can be quite slow.
 void prefetch(const void* addr);
 void start_logger(const std::string& fname);
 void* std_aligned_alloc(size_t alignment, size_t size);
 void std_aligned_free(void* ptr);
 void* aligned_large_pages_alloc(size_t size); // memory aligned by page size, min alignment: 4096 bytes
 void aligned_large_pages_free(void* mem); // nop if mem == nullptr
-size_t str_to_size_t(const std::string& s);
+void dbg_hit_on(bool b);
-
+void dbg_hit_on(bool c, bool b);
-#if defined(__linux__)
+void dbg_mean_of(int v);
 struct PipeDeleter {
    void operator()(FILE* file) const {
        if (file != nullptr)
        {
            pclose(file);
        }
    }
 };
 #endif
 // Reads the file as bytes.
 // Returns std::nullopt if the file does not exist.
 std::optional<std::string> read_file_to_string(const std::string& path);
 void dbg_hit_on(bool cond, int slot = 0);
 void dbg_mean_of(int64_t value, int slot = 0);
 void dbg_stdev_of(int64_t value, int slot = 0);
 void dbg_extremes_of(int64_t value, int slot = 0);
 void dbg_correl_of(int64_t value1, int64_t value2, int slot = 0);
 void dbg_print();
-using TimePoint = std::chrono::milliseconds::rep;  // A value in milliseconds
+/// Debug macro to write to std::err if NDEBUG flag is set, and do nothing otherwise
 #if defined(NDEBUG)
 #define debug 1 && std::cerr
 #else
 #define debug 0 && std::cerr
 #endif
 inline void hit_any_key() {
 #ifndef NDEBUG
  debug << "Hit any key to continue..." << std::endl << std::flush;
  system("read");   // on Windows, should be system("pause");
 #endif
 }
 typedef std::chrono::milliseconds::rep TimePoint; // A value in milliseconds
 static_assert(sizeof(TimePoint) == sizeof(int64_t), "TimePoint should be 64 bits");
 inline TimePoint now() {
-    return std::chrono::duration_cast<std::chrono::milliseconds>(
+  return std::chrono::duration_cast<std::chrono::milliseconds>
-             std::chrono::steady_clock::now().time_since_epoch())
+        (std::chrono::steady_clock::now().time_since_epoch()).count();
      .count();
 }
-inline std::vector<std::string_view> split(std::string_view s, std::string_view delimiter) {
+template<class Entry, int Size>
-    std::vector<std::string_view> res;
+struct HashTable {
  Entry* operator[](Key key) { return &table[(uint32_t)key & (Size - 1)]; }
-    if (s.empty())
+private:
-        return res;
+  std::vector<Entry> table = std::vector<Entry>(Size); // Allocate on the heap
    size_t begin = 0;
    for (;;)
    {
        const size_t end = s.find(delimiter, begin);
        if (end == std::string::npos)
            break;
        res.emplace_back(s.substr(begin, end - begin));
        begin = end + delimiter.size();
    }
    res.emplace_back(s.substr(begin));
    return res;
 }
 void remove_whitespace(std::string& s);
 bool is_whitespace(std::string_view s);
 enum SyncCout {
    IO_LOCK,
    IO_UNLOCK
 };
 enum SyncCout { IO_LOCK, IO_UNLOCK };
 std::ostream& operator<<(std::ostream&, SyncCout);
 #define sync_cout std::cout << IO_LOCK
 #define sync_endl std::endl << IO_UNLOCK
 void sync_cout_start();
 void sync_cout_end();
-// True if and only if the binary is compiled on a little-endian machine
+// align_ptr_up() : get the first aligned element of an array.
-static inline const std::uint16_t Le             = 1;
+// ptr must point to an array of size at least `sizeof(T) * N + alignment` bytes,
-static inline const bool          IsLittleEndian = *reinterpret_cast<const char*>(&Le) == 1;
+// where N is the number of elements in the array.
-
+template <uintptr_t Alignment, typename T>
-
+T* align_ptr_up(T* ptr)
-template<typename T, std::size_t MaxSize>
+{
-class ValueList {
+  static_assert(alignof(T) < Alignment);
   public:
    std::size_t size() const { return size_; }
    void        push_back(const T& value) { values_[size_++] = value; }
    const T*    begin() const { return values_; }
    const T*    end() const { return values_ + size_; }
    const T&    operator[](int index) const { return values_[index]; }
   private:
    T           values_[MaxSize];
    std::size_t size_ = 0;
 };
 template<typename T, std::size_t Size, std::size_t... Sizes>
 class MultiArray;
 namespace Detail {
 template<typename T, std::size_t Size, std::size_t... Sizes>
 struct MultiArrayHelper {
    using ChildType = MultiArray<T, Sizes...>;
 };
 template<typename T, std::size_t Size>
 struct MultiArrayHelper<T, Size> {
    using ChildType = T;
 };
  const uintptr_t ptrint = reinterpret_cast<uintptr_t>(reinterpret_cast<char*>(ptr));
  return reinterpret_cast<T*>(reinterpret_cast<char*>((ptrint + (Alignment - 1)) / Alignment * Alignment));
 }
 // MultiArray is a generic N-dimensional array.
 // The template parameters (Size and Sizes) encode the dimensions of the array.
 template<typename T, std::size_t Size, std::size_t... Sizes>
 class MultiArray {
    using ChildType = typename Detail::MultiArrayHelper<T, Size, Sizes...>::ChildType;
    using ArrayType = std::array<ChildType, Size>;
    ArrayType data_;
-   public:
+// IsLittleEndian : true if and only if the binary is compiled on a little endian machine
-    using value_type             = typename ArrayType::value_type;
+static inline const union { uint32_t i; char c[4]; } Le = { 0x01020304 };
-    using size_type              = typename ArrayType::size_type;
+static inline const bool IsLittleEndian = (Le.c[0] == 4);
    using difference_type        = typename ArrayType::difference_type;
    using reference              = typename ArrayType::reference;
    using const_reference        = typename ArrayType::const_reference;
    using pointer                = typename ArrayType::pointer;
    using const_pointer          = typename ArrayType::const_pointer;
    using iterator               = typename ArrayType::iterator;
    using const_iterator         = typename ArrayType::const_iterator;
    using reverse_iterator       = typename ArrayType::reverse_iterator;
    using const_reverse_iterator = typename ArrayType::const_reverse_iterator;
    constexpr auto&       at(size_type index) noexcept { return data_.at(index); }
    constexpr const auto& at(size_type index) const noexcept { return data_.at(index); }
-    constexpr auto&       operator[](size_type index) noexcept { return data_[index]; }
+// RunningAverage : a class to calculate a running average of a series of values.
-    constexpr const auto& operator[](size_type index) const noexcept { return data_[index]; }
+// For efficiency, all computations are done with integers.
 class RunningAverage {
  public:
-    constexpr auto&       front() noexcept { return data_.front(); }
+      // Reset the running average to rational value p / q
-    constexpr const auto& front() const noexcept { return data_.front(); }
+      void set(int64_t p, int64_t q)
-    constexpr auto&       back() noexcept { return data_.back(); }
+        { average = p * PERIOD * RESOLUTION / q; }
    constexpr const auto& back() const noexcept { return data_.back(); }
-    auto*       data() { return data_.data(); }
+      // Update average with value v
-    const auto* data() const { return data_.data(); }
+      void update(int64_t v)
        { average = RESOLUTION * v + (PERIOD - 1) * average / PERIOD; }
-    constexpr auto begin() noexcept { return data_.begin(); }
+      // Test if average is strictly greater than rational a / b
-    constexpr auto end() noexcept { return data_.end(); }
+      bool is_greater(int64_t a, int64_t b) const
-    constexpr auto begin() const noexcept { return data_.begin(); }
+        { return b * average > a * (PERIOD * RESOLUTION); }
    constexpr auto end() const noexcept { return data_.end(); }
    constexpr auto cbegin() const noexcept { return data_.cbegin(); }
    constexpr auto cend() const noexcept { return data_.cend(); }
-    constexpr auto rbegin() noexcept { return data_.rbegin(); }
+      int64_t value() const
-    constexpr auto rend() noexcept { return data_.rend(); }
+        { return average / (PERIOD * RESOLUTION); }
    constexpr auto rbegin() const noexcept { return data_.rbegin(); }
    constexpr auto rend() const noexcept { return data_.rend(); }
    constexpr auto crbegin() const noexcept { return data_.crbegin(); }
    constexpr auto crend() const noexcept { return data_.crend(); }
-    constexpr bool      empty() const noexcept { return data_.empty(); }
+  private :
-    constexpr size_type size() const noexcept { return data_.size(); }
+      static constexpr int64_t PERIOD     = 4096;
-    constexpr size_type max_size() const noexcept { return data_.max_size(); }
+      static constexpr int64_t RESOLUTION = 1024;
-
+      int64_t average;
    template<typename U>
    void fill(const U& v) {
        static_assert(std::is_assignable_v<T, U>, "Cannot assign fill value to entry type");
        for (auto& ele : data_)
        {
            if constexpr (sizeof...(Sizes) == 0)
                ele = v;
            else
                ele.fill(v);
        }
    }
    constexpr void swap(MultiArray<T, Size, Sizes...>& other) noexcept { data_.swap(other.data_); }
 };
 template <typename T, std::size_t MaxSize>
 class ValueList {
-// xorshift64star Pseudo-Random Number Generator
+public:
-// This class is based on original code written and dedicated
+  std::size_t size() const { return size_; }
-// to the public domain by Sebastiano Vigna (2014).
+  void resize(std::size_t newSize) { size_ = newSize; }
-// It has the following characteristics:
+  void push_back(const T& value) { values_[size_++] = value; }
-//
+  T& operator[](std::size_t index) { return values_[index]; }
-//  -  Outputs 64-bit numbers
+  T* begin() { return values_; }
-//  -  Passes Dieharder and SmallCrush test batteries
+  T* end() { return values_ + size_; }
-//  -  Does not require warm-up, no zeroland to escape
+  const T& operator[](std::size_t index) const { return values_[index]; }
-//  -  Internal state is a single 64-bit integer
+  const T* begin() const { return values_; }
-//  -  Period is 2^64 - 1
+  const T* end() const { return values_ + size_; }
-//  -  Speed: 1.60 ns/call (Core i7 @3.40GHz)
+
-//
+  void swap(ValueList& other) {
-// For further analysis see
+    const std::size_t maxSize = std::max(size_, other.size_);
-//   <http://vigna.di.unimi.it/ftp/papers/xorshift.pdf>
+    for (std::size_t i = 0; i < maxSize; ++i) {
      std::swap(values_[i], other.values_[i]);
    }
    std::swap(size_, other.size_);
  }
 private:
  T values_[MaxSize];
  std::size_t size_ = 0;
 };
 // This logger allows printing many parts in a region atomically
 // but doesn't block the threads trying to append to other regions.
 // Instead if some region tries to pring while other region holds
 // the lock the messages are queued to be printed as soon as the
 // current region releases the lock.
 struct SynchronizedRegionLogger
 {
  using RegionId = std::uint64_t;
  struct Region
  {
    friend struct SynchronizedRegionLogger;
    Region() :
      logger(nullptr), region_id(0), is_held(false)
    {
    }
    Region(const Region&) = delete;
    Region& operator=(const Region&) = delete;
    Region(Region&& other) :
      logger(other.logger), region_id(other.region_id), is_held(other.is_held)
    {
      other.logger = nullptr;
      other.is_held = false;
    }
    Region& operator=(Region&& other) {
      if (is_held && logger != nullptr)
      {
        logger->release_region(region_id);
      }
      logger = other.logger;
      region_id = other.region_id;
      is_held = other.is_held;
      other.is_held = false;
      return *this;
    }
    ~Region() { unlock(); }
    void unlock() {
      if (is_held) {
        is_held = false;
        if (logger != nullptr)
          logger->release_region(region_id);
      }
    }
    Region& operator << (std::ostream&(*pManip)(std::ostream&)) {
      if (logger != nullptr)
        logger->write(region_id, pManip);
      return *this;
    }
    template <typename T>
    Region& operator << (const T& value) {
      if (logger != nullptr)
        logger->write(region_id, value);
      return *this;
    }
  private:
    SynchronizedRegionLogger* logger;
    RegionId region_id;
    bool is_held;
    Region(SynchronizedRegionLogger& log, RegionId id) :
      logger(&log), region_id(id), is_held(true)
    {
    }
  };
 private:
  struct RegionBookkeeping
  {
    RegionBookkeeping(RegionId rid) : id(rid), is_held(true) {}
    std::vector<std::string> pending_parts;
    RegionId id;
    bool is_held;
  };
  RegionId init_next_region()
  {
    static RegionId next_id = 0;
    std::lock_guard lock(mutex);
    const auto id = next_id++;
    regions.emplace_back(id);
    return id;
  }
  void write(RegionId id, std::ostream&(*pManip)(std::ostream&)) {
    std::lock_guard lock(mutex);
    if (regions.empty())
      return;
    if (id == regions.front().id) {
      // We can just directly print to the output because
      // we are at the front of the region queue.
      out << *pManip;
    } else {
      // We have to schedule the print until previous regions are
      // processed
      auto* region = find_region_nolock(id);
      if (region == nullptr)
        return;
      std::stringstream ss;
      ss << *pManip;
      region->pending_parts.emplace_back(std::move(ss).str());
    }
  }
  template <typename T>
  void write(RegionId id, const T& value) {
    std::lock_guard lock(mutex);
    if (regions.empty())
      return;
    if (id == regions.front().id) {
      // We can just directly print to the output because
      // we are at the front of the region queue.
      out << value;
    } else {
      // We have to schedule the print until previous regions are
      // processed
      auto* region = find_region_nolock(id);
      if (region == nullptr)
        return;
      std::stringstream ss;
      ss << value;
      region->pending_parts.emplace_back(std::move(ss).str());
    }
  }
  std::ostream& out;
  std::deque<RegionBookkeeping> regions;
  std::mutex mutex;
  RegionBookkeeping* find_region_nolock(RegionId id) {
    // Linear search because the amount of concurrent regions should be small.
    auto it = std::find_if(
      regions.begin(),
      regions.end(),
      [id](const RegionBookkeeping& r) { return r.id == id; });
    if (it == regions.end())
      return nullptr;
    else
      return &*it;
  }
  void release_region(RegionId id) {
    std::lock_guard lock(mutex);
    auto* region = find_region_nolock(id);
    if (region == nullptr)
      return;
    region->is_held = false;
    process_backlog_nolock();
  }
  void process_backlog_nolock()
  {
    while(!regions.empty()) {
      auto& region = regions.front();
      for(auto& part : region.pending_parts) {
        out << part;
      }
      // If the region is still held then we don't
      // want to start printing stuff from the next region.
      if (region.is_held)
        break;
      regions.pop_front();
    }
  }
 public:
  SynchronizedRegionLogger(std::ostream& s) :
    out(s)
  {
  }
  [[nodiscard]] Region new_region() {
    const auto id = init_next_region();
    return Region(*this, id);
  }
 };
 extern SynchronizedRegionLogger sync_region_cout;
 /// sigmoid(t, x0, y0, C, P, Q) implements a sigmoid-like function using only integers,
 /// with the following properties:
 ///
 ///  -  sigmoid is centered in (x0, y0)
 ///  -  sigmoid has amplitude [-P/Q , P/Q] instead of [-1 , +1]
 ///  -  limit is (y0 - P/Q) when t tends to -infinity
 ///  -  limit is (y0 + P/Q) when t tends to +infinity
 ///  -  the slope can be adjusted using C > 0, smaller C giving a steeper sigmoid
 ///  -  the slope of the sigmoid when t = x0 is P/(Q*C)
 ///  -  sigmoid is increasing with t when P > 0 and Q > 0
 ///  -  to get a decreasing sigmoid, change sign of P
 ///  -  mean value of the sigmoid is y0
 ///
 /// Use <https://www.desmos.com/calculator/jhh83sqq92> to draw the sigmoid
 inline int64_t sigmoid(int64_t t, int64_t x0,
                                  int64_t y0,
                                  int64_t  C,
                                  int64_t  P,
                                  int64_t  Q)
 {
   assert(C > 0);
   assert(Q != 0);
   return y0 + P * (t-x0) / (Q * (std::abs(t-x0) + C)) ;
 }
 /// xorshift64star Pseudo-Random Number Generator
 /// This class is based on original code written and dedicated
 /// to the public domain by Sebastiano Vigna (2014).
 /// It has the following characteristics:
 ///
 ///  -  Outputs 64-bit numbers
 ///  -  Passes Dieharder and SmallCrush test batteries
 ///  -  Does not require warm-up, no zeroland to escape
 ///  -  Internal state is a single 64-bit integer
 ///  -  Period is 2^64 - 1
 ///  -  Speed: 1.60 ns/call (Core i7 @3.40GHz)
 ///
 /// For further analysis see
 ///   <http://vigna.di.unimi.it/ftp/papers/xorshift.pdf>
 static uint64_t string_hash(const std::string& str)
 {
  uint64_t h = 525201411107845655ull;
  for (auto c : str) {
    h ^= static_cast<uint64_t>(c);
    h *= 0x5bd1e9955bd1e995ull;
    h ^= h >> 47;
  }
  return h;
 }
 class PRNG {
-    uint64_t s;
+  uint64_t s;
-    uint64_t rand64() {
+  uint64_t rand64() {
-        s ^= s >> 12, s ^= s << 25, s ^= s >> 27;
+    s ^= s >> 12, s ^= s << 25, s ^= s >> 27;
-        return s * 2685821657736338717LL;
+    return s * 2685821657736338717LL;
  }
 public:
  PRNG() { set_seed_from_time(); }
  PRNG(uint64_t seed) : s(seed) { assert(seed); }
  PRNG(const std::string& seed) { set_seed(seed); }
  template<typename T> T rand() { return T(rand64()); }
  /// Special generator used to fast init magic numbers.
  /// Output values only have 1/8th of their bits set on average.
  template<typename T> T sparse_rand()
  { return T(rand64() & rand64() & rand64()); }
  // Returns a random number from 0 to n-1. (Not uniform distribution, but this is enough in reality)
  uint64_t rand(uint64_t n) { return rand<uint64_t>() % n; }
  // Return the random seed used internally.
  uint64_t get_seed() const { return s; }
  void set_seed(uint64_t seed) { s = seed; }
  uint64_t next_random_seed()
  {
    uint64_t seed = 0;
    for(int i = 0; i < 64; ++i)
    {
      const auto off = rand64() % 64;
      seed |= (rand64() & (uint64_t(1) << off)) >> off;
      seed <<= 1;
    }
    return seed;
  }
-   public:
+  void set_seed_from_time()
-    PRNG(uint64_t seed) :
+  {
-        s(seed) {
+      set_seed(std::chrono::system_clock::now().time_since_epoch().count());
-        assert(seed);
+  }
    }
-    template<typename T>
+  void set_seed(const std::string& str)
-    T rand() {
+  {
-        return T(rand64());
+    if (str.empty())
    {
      set_seed_from_time();
    }
-
+    else if (std::all_of(str.begin(), str.end(), [](char c) { return std::isdigit(c);} )) {
-    // Special generator used to fast init magic numbers.
+      set_seed(std::stoull(str));
    // Output values only have 1/8th of their bits set on average.
    template<typename T>
    T sparse_rand() {
        return T(rand64() & rand64() & rand64());
    }
    else
    {
      set_seed(string_hash(str));
    }
  }
 };
 // Display a random seed. (For debugging)
 inline std::ostream& operator<<(std::ostream& os, PRNG& prng)
 {
  os << "PRNG::seed = " << std::hex << prng.get_seed() << std::dec;
  return os;
 }
 inline uint64_t mul_hi64(uint64_t a, uint64_t b) {
 #if defined(__GNUC__) && defined(IS_64BIT)
-    __extension__ using uint128 = unsigned __int128;
+    __extension__ typedef unsigned __int128 uint128;
-    return (uint128(a) * uint128(b)) >> 64;
+    return ((uint128)a * (uint128)b) >> 64;
 #else
-    uint64_t aL = uint32_t(a), aH = a >> 32;
+    uint64_t aL = (uint32_t)a, aH = a >> 32;
-    uint64_t bL = uint32_t(b), bH = b >> 32;
+    uint64_t bL = (uint32_t)b, bH = b >> 32;
    uint64_t c1 = (aL * bL) >> 32;
    uint64_t c2 = aH * bL + c1;
-    uint64_t c3 = aL * bH + uint32_t(c2);
+    uint64_t c3 = aL * bH + (uint32_t)c2;
    return aH * bH + (c2 >> 32) + (c3 >> 32);
 #endif
 }
 // This bitset can be accessed concurrently, provided
 // the concurrent accesses are performed on distinct
 // instances of underlying type. That means the cuncurrent
 // accesses need to be spaced by at least
 // bits_per_bucket bits.
 // But at least best_concurrent_access_stride bits
 // is recommended to prevent false sharing.
 template <uint64_t N>
 struct LargeBitset
 {
 private:
    constexpr static uint64_t cache_line_size = 64;
-struct CommandLine {
+public:
-   public:
+    using UnderlyingType = uint64_t;
    CommandLine(int _argc, char** _argv) :
        argc(_argc),
        argv(_argv) {}
-    static std::string get_binary_directory(std::string argv0);
+    constexpr static uint64_t num_bits = N;
-    static std::string get_working_directory();
+    constexpr static uint64_t bits_per_bucket = 8 * sizeof(uint64_t);
    constexpr static uint64_t num_buckets = (num_bits + bits_per_bucket - 1) / bits_per_bucket;
    constexpr static uint64_t best_concurrent_access_stride = 8 * cache_line_size;
-    int    argc;
+    LargeBitset()
-    char** argv;
+    {
        std::fill(std::begin(bits), std::end(bits), 0);
    }
    void set(uint64_t idx)
    {
        const uint64_t bucket = idx / bits_per_bucket;
        const uint64_t bit = uint64_t(1) << (idx % bits_per_bucket);
        bits[bucket] |= bit;
    }
    bool test(uint64_t idx) const
    {
        const uint64_t bucket = idx / bits_per_bucket;
        const uint64_t bit = uint64_t(1) << (idx % bits_per_bucket);
        return bits[bucket] & bit;
    }
    uint64_t count() const
    {
        uint64_t c = 0;
        uint64_t i = 0;
        for (; i < num_buckets - 3; i += 4)
        {
            uint64_t c0 = popcount(bits[i+0]);
            uint64_t c1 = popcount(bits[i+1]);
            uint64_t c2 = popcount(bits[i+2]);
            uint64_t c3 = popcount(bits[i+3]);
            c0 += c1;
            c2 += c3;
            c += c0 + c2;
        }
        for (; i < num_buckets; ++i)
        {
            c += popcount(bits[i]);
        }
        return c;
    }
 private:
    alignas(cache_line_size) UnderlyingType bits[num_buckets];
 };
-namespace Utility {
+/// Under Windows it is not possible for a process to run on more than one
 /// logical processor group. This usually means to be limited to use max 64
 /// cores. To overcome this, some special platform specific API should be
 /// called to set group affinity for each thread. Original code from Texel by
 /// Peter Österlund.
-template<typename T, typename Predicate>
+namespace WinProcGroup {
-void move_to_front(std::vector<T>& vec, Predicate pred) {
+  void bindThisThread(size_t idx);
-    auto it = std::find_if(vec.begin(), vec.end(), pred);
+}
-    if (it != vec.end())
+// Returns a string that represents the current time. (Used for log output when learning evaluation function)
 std::string now_string();
 void sleep(int ms);
 namespace Algo {
    // Fisher-Yates
    template <typename Rng, typename T>
    void shuffle(std::vector<T>& buf, Rng&& prng)
    {
-        std::rotate(vec.begin(), it, it + 1);
+        const auto size = buf.size();
        for (uint64_t i = 0; i < size; ++i)
            std::swap(buf[i], buf[prng.rand(size - i) + i]);
    }
    // split the string
    inline std::vector<std::string> split(const std::string& input, char delimiter) {
        std::istringstream stream(input);
        std::string field;
        std::vector<std::string> fields;
        while (std::getline(stream, field, delimiter)) {
            fields.push_back(field);
        }
        return fields;
    }
 }
 // --------------------
 //       Path
 // --------------------
 // Something like Path class in C#. File name manipulation.
 // Match with the C# method name.
 struct Path
 {
 	// Combine the path name and file name and return it.
 	// If the folder name is not an empty string, append it if there is no'/' or'\\' at the end.
 	static std::string combine(const std::string& folder, const std::string& filename)
 	{
 		if (folder.length() >= 1 && *folder.rbegin() != '/' && *folder.rbegin() != '\\')
 			return folder + "/" + filename;
 		return folder + filename;
 	}
 	// Get the file name part (excluding the folder name) from the full path expression.
 	static std::string get_file_name(const std::string& path)
 	{
 		// I don't know which "\" or "/" is used.
 		auto path_index1 = path.find_last_of("\\") + 1;
 		auto path_index2 = path.find_last_of("/") + 1;
 		auto path_index = std::max(path_index1, path_index2);
 		return path.substr(path_index);
 	}
 };
 // It is ignored when new even though alignas is specified & because it is ignored when the STL container allocates memory,
 // A custom allocator used for that.
 template <typename T>
 class AlignedAllocator {
 public:
  using value_type = T;
  AlignedAllocator() {}
  AlignedAllocator(const AlignedAllocator&) {}
  AlignedAllocator(AlignedAllocator&&) {}
  template <typename U> AlignedAllocator(const AlignedAllocator<U>&) {}
  T* allocate(std::size_t n) { return (T*)std_aligned_alloc(alignof(T), n * sizeof(T)); }
  void deallocate(T* p, std::size_t ) { std_aligned_free(p); }
 };
 template <typename T>
 class CacheLineAlignedAllocator {
 public:
    using value_type = T;
    constexpr static uint64_t cache_line_size = 64;
    CacheLineAlignedAllocator() {}
    CacheLineAlignedAllocator(const CacheLineAlignedAllocator&) {}
    CacheLineAlignedAllocator(CacheLineAlignedAllocator&&) {}
    template <typename U> CacheLineAlignedAllocator(const CacheLineAlignedAllocator<U>&) {}
    T* allocate(std::size_t n) { return (T*)std_aligned_alloc(cache_line_size, n * sizeof(T)); }
    void deallocate(T* p, std::size_t) { std_aligned_free(p); }
 };
 // --------------------
 //  Dependency Wrapper
 // --------------------
 namespace Dependency
 {
  // In the Linux environment, if you getline() the text file is'\r\n'
  // Since'\r' remains at the end, write a wrapper to remove this'\r'.
  // So when calling getline() on fstream,
  // just write getline() instead of std::getline() and use this function.
  extern bool getline(std::ifstream& fs, std::string& s);
 }
-}  // namespace Stockfish
+namespace CommandLine {
  void init(int argc, char* argv[]);
-#endif  // #ifndef MISC_H_INCLUDED
+  extern std::string binaryDirectory;  // path of the executable directory
  extern std::string workingDirectory; // path of the working directory
 }
 } // namespace Stockfish
 #endif // #ifndef MISC_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -16,75 +16,82 @@
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "movegen.h"
 #include <cassert>
 #include <initializer_list>
-#include "bitboard.h"
+#include "movegen.h"
 #include "position.h"
 namespace Stockfish {
 namespace {
-template<GenType Type, Direction D, bool Enemy>
+  template<GenType Type, Direction D>
-ExtMove* make_promotions(ExtMove* moveList, [[maybe_unused]] Square to) {
+  ExtMove* make_promotions(ExtMove* moveList, Square to) {
-    constexpr bool all = Type == EVASIONS || Type == NON_EVASIONS;
+    if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
        *moveList++ = make<PROMOTION>(to - D, to, QUEEN);
-    if constexpr (Type == CAPTURES || all)
+    if (Type == QUIETS || Type == EVASIONS || Type == NON_EVASIONS)
        *moveList++ = Move::make<PROMOTION>(to - D, to, QUEEN);
    if constexpr ((Type == CAPTURES && Enemy) || (Type == QUIETS && !Enemy) || all)
    {
-        *moveList++ = Move::make<PROMOTION>(to - D, to, ROOK);
+        *moveList++ = make<PROMOTION>(to - D, to, ROOK);
-        *moveList++ = Move::make<PROMOTION>(to - D, to, BISHOP);
+        *moveList++ = make<PROMOTION>(to - D, to, BISHOP);
-        *moveList++ = Move::make<PROMOTION>(to - D, to, KNIGHT);
+        *moveList++ = make<PROMOTION>(to - D, to, KNIGHT);
    }
    return moveList;
-}
+  }
-template<Color Us, GenType Type>
+  template<Color Us, GenType Type>
-ExtMove* generate_pawn_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
+  ExtMove* generate_pawn_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
    constexpr Color     Them     = ~Us;
-    constexpr Bitboard  TRank7BB = (Us == WHITE ? Rank7BB : Rank2BB);
+    constexpr Bitboard  TRank7BB = (Us == WHITE ? Rank7BB    : Rank2BB);
-    constexpr Bitboard  TRank3BB = (Us == WHITE ? Rank3BB : Rank6BB);
+    constexpr Bitboard  TRank3BB = (Us == WHITE ? Rank3BB    : Rank6BB);
    constexpr Direction Up       = pawn_push(Us);
    constexpr Direction UpRight  = (Us == WHITE ? NORTH_EAST : SOUTH_WEST);
    constexpr Direction UpLeft   = (Us == WHITE ? NORTH_WEST : SOUTH_EAST);
    const Bitboard emptySquares = ~pos.pieces();
-    const Bitboard enemies      = Type == EVASIONS ? pos.checkers() : pos.pieces(Them);
+    const Bitboard enemies      =  Type == EVASIONS ? pos.checkers()
                                                    : pos.pieces(Them);
-    Bitboard pawnsOn7    = pos.pieces(Us, PAWN) & TRank7BB;
+    Bitboard pawnsOn7    = pos.pieces(Us, PAWN) &  TRank7BB;
    Bitboard pawnsNotOn7 = pos.pieces(Us, PAWN) & ~TRank7BB;
    // Single and double pawn pushes, no promotions
-    if constexpr (Type != CAPTURES)
+    if (Type != CAPTURES)
    {
-        Bitboard b1 = shift<Up>(pawnsNotOn7) & emptySquares;
+        Bitboard b1 = shift<Up>(pawnsNotOn7)   & emptySquares;
        Bitboard b2 = shift<Up>(b1 & TRank3BB) & emptySquares;
-        if constexpr (Type == EVASIONS)  // Consider only blocking squares
+        if (Type == EVASIONS) // Consider only blocking squares
        {
            b1 &= target;
            b2 &= target;
        }
        if (Type == QUIET_CHECKS)
        {
            // To make a quiet check, you either make a direct check by pushing a pawn
            // or push a blocker pawn that is not on the same file as the enemy king.
            // Discovered check promotion has been already generated amongst the captures.
            Square ksq = pos.square<KING>(Them);
            Bitboard dcCandidatePawns = pos.blockers_for_king(Them) & ~file_bb(ksq);
            b1 &= pawn_attacks_bb(Them, ksq) | shift<   Up>(dcCandidatePawns);
            b2 &= pawn_attacks_bb(Them, ksq) | shift<Up+Up>(dcCandidatePawns);
        }
        while (b1)
        {
-            Square to   = pop_lsb(b1);
+            Square to = pop_lsb(b1);
-            *moveList++ = Move(to - Up, to);
+            *moveList++ = make_move(to - Up, to);
        }
        while (b2)
        {
-            Square to   = pop_lsb(b2);
+            Square to = pop_lsb(b2);
-            *moveList++ = Move(to - Up - Up, to);
+            *moveList++ = make_move(to - Up - Up, to);
        }
    }
@@ -92,38 +99,38 @@ ExtMove* generate_pawn_moves(const Position& pos, ExtMove* moveList, Bitboard ta
    if (pawnsOn7)
    {
        Bitboard b1 = shift<UpRight>(pawnsOn7) & enemies;
-        Bitboard b2 = shift<UpLeft>(pawnsOn7) & enemies;
+        Bitboard b2 = shift<UpLeft >(pawnsOn7) & enemies;
-        Bitboard b3 = shift<Up>(pawnsOn7) & emptySquares;
+        Bitboard b3 = shift<Up     >(pawnsOn7) & emptySquares;
-        if constexpr (Type == EVASIONS)
+        if (Type == EVASIONS)
            b3 &= target;
        while (b1)
-            moveList = make_promotions<Type, UpRight, true>(moveList, pop_lsb(b1));
+            moveList = make_promotions<Type, UpRight>(moveList, pop_lsb(b1));
        while (b2)
-            moveList = make_promotions<Type, UpLeft, true>(moveList, pop_lsb(b2));
+            moveList = make_promotions<Type, UpLeft >(moveList, pop_lsb(b2));
        while (b3)
-            moveList = make_promotions<Type, Up, false>(moveList, pop_lsb(b3));
+            moveList = make_promotions<Type, Up     >(moveList, pop_lsb(b3));
    }
    // Standard and en passant captures
-    if constexpr (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
+    if (Type == CAPTURES || Type == EVASIONS || Type == NON_EVASIONS)
    {
        Bitboard b1 = shift<UpRight>(pawnsNotOn7) & enemies;
-        Bitboard b2 = shift<UpLeft>(pawnsNotOn7) & enemies;
+        Bitboard b2 = shift<UpLeft >(pawnsNotOn7) & enemies;
        while (b1)
        {
-            Square to   = pop_lsb(b1);
+            Square to = pop_lsb(b1);
-            *moveList++ = Move(to - UpRight, to);
+            *moveList++ = make_move(to - UpRight, to);
        }
        while (b2)
        {
-            Square to   = pop_lsb(b2);
+            Square to = pop_lsb(b2);
-            *moveList++ = Move(to - UpLeft, to);
+            *moveList++ = make_move(to - UpLeft, to);
        }
        if (pos.ep_square() != SQ_NONE)
@@ -139,16 +146,16 @@ ExtMove* generate_pawn_moves(const Position& pos, ExtMove* moveList, Bitboard ta
            assert(b1);
            while (b1)
-                *moveList++ = Move::make<EN_PASSANT>(pop_lsb(b1), pos.ep_square());
+                *moveList++ = make<EN_PASSANT>(pop_lsb(b1), pos.ep_square());
        }
    }
    return moveList;
-}
+  }
-template<Color Us, PieceType Pt>
+  template<Color Us, PieceType Pt, bool Checks>
-ExtMove* generate_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
+  ExtMove* generate_moves(const Position& pos, ExtMove* moveList, Bitboard target) {
    static_assert(Pt != KING && Pt != PAWN, "Unsupported piece type in generate_moves()");
@@ -156,101 +163,114 @@ ExtMove* generate_moves(const Position& pos, ExtMove* moveList, Bitboard target)
    while (bb)
    {
-        Square   from = pop_lsb(bb);
+        Square from = pop_lsb(bb);
-        Bitboard b    = attacks_bb<Pt>(from, pos.pieces()) & target;
+        Bitboard b = attacks_bb<Pt>(from, pos.pieces()) & target;
        // To check, you either move freely a blocker or make a direct check.
        if (Checks && (Pt == QUEEN || !(pos.blockers_for_king(~Us) & from)))
            b &= pos.check_squares(Pt);
        while (b)
-            *moveList++ = Move(from, pop_lsb(b));
+            *moveList++ = make_move(from, pop_lsb(b));
    }
    return moveList;
-}
+  }
-template<Color Us, GenType Type>
+  template<Color Us, GenType Type>
-ExtMove* generate_all(const Position& pos, ExtMove* moveList) {
+  ExtMove* generate_all(const Position& pos, ExtMove* moveList) {
    static_assert(Type != LEGAL, "Unsupported type in generate_all()");
    constexpr bool Checks = Type == QUIET_CHECKS; // Reduce template instantiations
    const Square ksq = pos.square<KING>(Us);
-    Bitboard     target;
+    Bitboard target;
    // Skip generating non-king moves when in double check
    if (Type != EVASIONS || !more_than_one(pos.checkers()))
    {
-        target = Type == EVASIONS     ? between_bb(ksq, lsb(pos.checkers()))
+        target = Type == EVASIONS     ?  between_bb(ksq, lsb(pos.checkers()))
-               : Type == NON_EVASIONS ? ~pos.pieces(Us)
+               : Type == NON_EVASIONS ? ~pos.pieces( Us)
-               : Type == CAPTURES     ? pos.pieces(~Us)
+               : Type == CAPTURES     ?  pos.pieces(~Us)
-                                      : ~pos.pieces();  // QUIETS
+                                      : ~pos.pieces(   ); // QUIETS || QUIET_CHECKS
        moveList = generate_pawn_moves<Us, Type>(pos, moveList, target);
-        moveList = generate_moves<Us, KNIGHT>(pos, moveList, target);
+        moveList = generate_moves<Us, KNIGHT, Checks>(pos, moveList, target);
-        moveList = generate_moves<Us, BISHOP>(pos, moveList, target);
+        moveList = generate_moves<Us, BISHOP, Checks>(pos, moveList, target);
-        moveList = generate_moves<Us, ROOK>(pos, moveList, target);
+        moveList = generate_moves<Us,   ROOK, Checks>(pos, moveList, target);
-        moveList = generate_moves<Us, QUEEN>(pos, moveList, target);
+        moveList = generate_moves<Us,  QUEEN, Checks>(pos, moveList, target);
    }
-    Bitboard b = attacks_bb<KING>(ksq) & (Type == EVASIONS ? ~pos.pieces(Us) : target);
+    if (!Checks || pos.blockers_for_king(~Us) & ksq)
    {
        Bitboard b = attacks_bb<KING>(ksq) & (Type == EVASIONS ? ~pos.pieces(Us) : target);
        if (Checks)
            b &= ~attacks_bb<QUEEN>(pos.square<KING>(~Us));
-    while (b)
+        while (b)
-        *moveList++ = Move(ksq, pop_lsb(b));
+            *moveList++ = make_move(ksq, pop_lsb(b));
-    if ((Type == QUIETS || Type == NON_EVASIONS) && pos.can_castle(Us & ANY_CASTLING))
+        if ((Type == QUIETS || Type == NON_EVASIONS) && pos.can_castle(Us & ANY_CASTLING))
-        for (CastlingRights cr : {Us & KING_SIDE, Us & QUEEN_SIDE})
+            for (CastlingRights cr : { Us & KING_SIDE, Us & QUEEN_SIDE } )
-            if (!pos.castling_impeded(cr) && pos.can_castle(cr))
+                if (!pos.castling_impeded(cr) && pos.can_castle(cr))
-                *moveList++ = Move::make<CASTLING>(ksq, pos.castling_rook_square(cr));
+                    *moveList++ = make<CASTLING>(ksq, pos.castling_rook_square(cr));
    }
    return moveList;
-}
+  }
-}  // namespace
+} // namespace
-// <CAPTURES>     Generates all pseudo-legal captures plus queen promotions
+/// <CAPTURES>     Generates all pseudo-legal captures plus queen promotions
-// <QUIETS>       Generates all pseudo-legal non-captures and underpromotions
+/// <QUIETS>       Generates all pseudo-legal non-captures and underpromotions
-// <EVASIONS>     Generates all pseudo-legal check evasions
+/// <EVASIONS>     Generates all pseudo-legal check evasions when the side to move is in check
-// <NON_EVASIONS> Generates all pseudo-legal captures and non-captures
+/// <QUIET_CHECKS> Generates all pseudo-legal non-captures giving check, except castling and promotions
-//
+/// <NON_EVASIONS> Generates all pseudo-legal captures and non-captures
-// Returns a pointer to the end of the move list.
+///
 /// Returns a pointer to the end of the move list.
 template<GenType Type>
 ExtMove* generate(const Position& pos, ExtMove* moveList) {
-    static_assert(Type != LEGAL, "Unsupported type in generate()");
+  static_assert(Type != LEGAL, "Unsupported type in generate()");
-    assert((Type == EVASIONS) == bool(pos.checkers()));
+  assert((Type == EVASIONS) == (bool)pos.checkers());
-    Color us = pos.side_to_move();
+  Color us = pos.side_to_move();
-    return us == WHITE ? generate_all<WHITE, Type>(pos, moveList)
+  return us == WHITE ? generate_all<WHITE, Type>(pos, moveList)
-                       : generate_all<BLACK, Type>(pos, moveList);
+                     : generate_all<BLACK, Type>(pos, moveList);
 }
 // Explicit template instantiations
 template ExtMove* generate<CAPTURES>(const Position&, ExtMove*);
 template ExtMove* generate<QUIETS>(const Position&, ExtMove*);
 template ExtMove* generate<EVASIONS>(const Position&, ExtMove*);
 template ExtMove* generate<QUIET_CHECKS>(const Position&, ExtMove*);
 template ExtMove* generate<NON_EVASIONS>(const Position&, ExtMove*);
-// generate<LEGAL> generates all the legal moves in the given position
+/// generate<LEGAL> generates all the legal moves in the given position
 template<>
 ExtMove* generate<LEGAL>(const Position& pos, ExtMove* moveList) {
-    Color    us     = pos.side_to_move();
+  Color us = pos.side_to_move();
-    Bitboard pinned = pos.blockers_for_king(us) & pos.pieces(us);
+  Bitboard pinned = pos.blockers_for_king(us) & pos.pieces(us);
-    Square   ksq    = pos.square<KING>(us);
+  Square ksq = pos.square<KING>(us);
-    ExtMove* cur    = moveList;
+  ExtMove* cur = moveList;
-    moveList =
+  moveList = pos.checkers() ? generate<EVASIONS    >(pos, moveList)
-      pos.checkers() ? generate<EVASIONS>(pos, moveList) : generate<NON_EVASIONS>(pos, moveList);
+                            : generate<NON_EVASIONS>(pos, moveList);
-    while (cur != moveList)
+  while (cur != moveList)
-        if (((pinned & cur->from_sq()) || cur->from_sq() == ksq || cur->type_of() == EN_PASSANT)
+      if (  ((pinned && pinned & from_sq(*cur)) || from_sq(*cur) == ksq || type_of(*cur) == EN_PASSANT)
-            && !pos.legal(*cur))
+          && !pos.legal(*cur))
-            *cur = *(--moveList);
+          *cur = (--moveList)->move;
-        else
+      else
-            ++cur;
+          ++cur;
-    return moveList;
+  return moveList;
 }
-}  // namespace Stockfish
+} // namespace Stockfish
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -19,8 +19,7 @@
 #ifndef MOVEGEN_H_INCLUDED
 #define MOVEGEN_H_INCLUDED
-#include <algorithm>  // IWYU pragma: keep
+#include <algorithm>
 #include <cstddef>
 #include "types.h"
@@ -29,45 +28,53 @@ namespace Stockfish {
 class Position;
 enum GenType {
-    CAPTURES,
+  CAPTURES,
-    QUIETS,
+  QUIETS,
-    EVASIONS,
+  QUIET_CHECKS,
-    NON_EVASIONS,
+  EVASIONS,
-    LEGAL
+  NON_EVASIONS,
  LEGAL
 };
-struct ExtMove: public Move {
+struct ExtMove {
-    int value;
+  Move move;
  int value;
-    void operator=(Move m) { data = m.raw(); }
+  operator Move() const { return move; }
  void operator=(Move m) { move = m; }
-    // Inhibit unwanted implicit conversions to Move
+  // Inhibit unwanted implicit conversions to Move
-    // with an ambiguity that yields to a compile error.
+  // with an ambiguity that yields to a compile error.
-    operator float() const = delete;
+  operator float() const = delete;
 };
-inline bool operator<(const ExtMove& f, const ExtMove& s) { return f.value < s.value; }
+inline bool operator<(const ExtMove& f, const ExtMove& s) {
  return f.value < s.value;
 }
 template<GenType>
 ExtMove* generate(const Position& pos, ExtMove* moveList);
-// The MoveList struct wraps the generate() function and returns a convenient
+/// The MoveList struct is a simple wrapper around generate(). It sometimes comes
-// list of moves. Using MoveList is sometimes preferable to directly calling
+/// in handy to use this class instead of the low level generate() function.
 // the lower level generate() function.
 template<GenType T>
 struct MoveList {
-    explicit MoveList(const Position& pos) :
+  explicit MoveList(const Position& pos) : last(generate<T>(pos, moveList)) {}
-        last(generate<T>(pos, moveList)) {}
+  const ExtMove* begin() const { return moveList; }
-    const ExtMove* begin() const { return moveList; }
+  const ExtMove* end() const { return last; }
-    const ExtMove* end() const { return last; }
+  size_t size() const { return last - moveList; }
-    size_t         size() const { return last - moveList; }
+  bool contains(Move move) const {
-    bool           contains(Move move) const { return std::find(begin(), end(), move) != end(); }
+    return std::find(begin(), end(), move) != end();
  }
-   private:
+  // returns the i th element
-    ExtMove moveList[MAX_MOVES], *last;
+  const ExtMove at(size_t i) const { assert(0 <= i && i < size()); return begin()[i]; }
 private:
  ExtMove moveList[MAX_MOVES], *last;
 };
-}  // namespace Stockfish
+} // namespace Stockfish
-#endif  // #ifndef MOVEGEN_H_INCLUDED
+#endif // #ifndef MOVEGEN_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -16,305 +16,291 @@
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "movepick.h"
 #include <cassert>
 #include <limits>
 #include "bitboard.h"
-#include "misc.h"
+#include "movepick.h"
 #include "position.h"
 namespace Stockfish {
 namespace {
-enum Stages {
+  enum Stages {
-    // generate main search moves
+    MAIN_TT, CAPTURE_INIT, GOOD_CAPTURE, REFUTATION, QUIET_INIT, QUIET, BAD_CAPTURE,
-    MAIN_TT,
+    EVASION_TT, EVASION_INIT, EVASION,
-    CAPTURE_INIT,
+    PROBCUT_TT, PROBCUT_INIT, PROBCUT,
-    GOOD_CAPTURE,
+    QSEARCH_TT, QCAPTURE_INIT, QCAPTURE, QCHECK_INIT, QCHECK
-    QUIET_INIT,
+  };
    GOOD_QUIET,
    BAD_CAPTURE,
    BAD_QUIET,
-    // generate evasion moves
+  // partial_insertion_sort() sorts moves in descending order up to and including
-    EVASION_TT,
+  // a given limit. The order of moves smaller than the limit is left unspecified.
-    EVASION_INIT,
+  void partial_insertion_sort(ExtMove* begin, ExtMove* end, int limit) {
    EVASION,
    // generate probcut moves
    PROBCUT_TT,
    PROBCUT_INIT,
    PROBCUT,
    // generate qsearch moves
    QSEARCH_TT,
    QCAPTURE_INIT,
    QCAPTURE
 };
 // Sort moves in descending order up to and including a given limit.
 // The order of moves smaller than the limit is left unspecified.
 void partial_insertion_sort(ExtMove* begin, ExtMove* end, int limit) {
    for (ExtMove *sortedEnd = begin, *p = begin + 1; p < end; ++p)
        if (p->value >= limit)
        {
            ExtMove tmp = *p, *q;
-            *p          = *++sortedEnd;
+            *p = *++sortedEnd;
            for (q = sortedEnd; q != begin && *(q - 1) < tmp; --q)
                *q = *(q - 1);
            *q = tmp;
        }
  }
 } // namespace
 /// Constructors of the MovePicker class. As arguments we pass information
 /// to help it to return the (presumably) good moves first, to decide which
 /// moves to return (in the quiescence search, for instance, we only want to
 /// search captures, promotions, and some checks) and how important good move
 /// ordering is at the current node.
 /// MovePicker constructor for the main search
 MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const ButterflyHistory* mh,
                                                             const CapturePieceToHistory* cph,
                                                             const PieceToHistory** ch,
                                                             Move cm,
                                                             const Move* killers)
           : pos(p), mainHistory(mh), captureHistory(cph), continuationHistory(ch),
             ttMove(ttm), refutations{{killers[0], 0}, {killers[1], 0}, {cm, 0}}, depth(d)
 {
  assert(d > 0);
  stage = (pos.checkers() ? EVASION_TT : MAIN_TT) +
          !(ttm && pos.pseudo_legal(ttm));
 }
-}  // namespace
+/// MovePicker constructor for quiescence search
 MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const ButterflyHistory* mh,
                                                             const CapturePieceToHistory* cph,
                                                             const PieceToHistory** ch,
                                                             Square rs)
           : pos(p), mainHistory(mh), captureHistory(cph), continuationHistory(ch), ttMove(ttm), recaptureSquare(rs), depth(d)
 {
  assert(d <= 0);
-
+  stage = (pos.checkers() ? EVASION_TT : QSEARCH_TT) +
-// Constructors of the MovePicker class. As arguments, we pass information
+          !(   ttm
-// to decide which class of moves to emit, to help sorting the (presumably)
+            && (pos.checkers() || depth > DEPTH_QS_RECAPTURES || to_sq(ttm) == recaptureSquare)
-// good moves first, and how important move ordering is at the current node.
+            && pos.pseudo_legal(ttm));
 // MovePicker constructor for the main search and for the quiescence search
 MovePicker::MovePicker(const Position&              p,
                       Move                         ttm,
                       Depth                        d,
                       const ButterflyHistory*      mh,
                       const LowPlyHistory*         lph,
                       const CapturePieceToHistory* cph,
                       const PieceToHistory**       ch,
                       const PawnHistory*           ph,
                       int                          pl) :
    pos(p),
    mainHistory(mh),
    lowPlyHistory(lph),
    captureHistory(cph),
    continuationHistory(ch),
    pawnHistory(ph),
    ttMove(ttm),
    depth(d),
    ply(pl) {
    if (pos.checkers())
        stage = EVASION_TT + !(ttm && pos.pseudo_legal(ttm));
    else
        stage = (depth > 0 ? MAIN_TT : QSEARCH_TT) + !(ttm && pos.pseudo_legal(ttm));
 }
-// MovePicker constructor for ProbCut: we generate captures with Static Exchange
+/// MovePicker constructor for ProbCut: we generate captures with SEE greater
-// Evaluation (SEE) greater than or equal to the given threshold.
+/// than or equal to the given threshold.
-MovePicker::MovePicker(const Position& p, Move ttm, int th, const CapturePieceToHistory* cph) :
+MovePicker::MovePicker(const Position& p, Move ttm, Value th, Depth d, const CapturePieceToHistory* cph)
-    pos(p),
+           : pos(p), captureHistory(cph), ttMove(ttm), threshold(th), depth(d)
-    captureHistory(cph),
+{
-    ttMove(ttm),
+  assert(!pos.checkers());
    threshold(th) {
    assert(!pos.checkers());
-    stage = PROBCUT_TT
+  stage = PROBCUT_TT + !(ttm && pos.capture(ttm)
-          + !(ttm && pos.capture_stage(ttm) && pos.pseudo_legal(ttm) && pos.see_ge(ttm, threshold));
+                             && pos.pseudo_legal(ttm)
                             && pos.see_ge(ttm, threshold));
 }
-// Assigns a numerical value to each move in a list, used for sorting.
+/// MovePicker::score() assigns a numerical value to each move in a list, used
-// Captures are ordered by Most Valuable Victim (MVV), preferring captures
+/// for sorting. Captures are ordered by Most Valuable Victim (MVV), preferring
-// with a good history. Quiets moves are ordered using the history tables.
+/// captures with a good history. Quiets moves are ordered using the histories.
 template<GenType Type>
 void MovePicker::score() {
-    static_assert(Type == CAPTURES || Type == QUIETS || Type == EVASIONS, "Wrong type");
+  static_assert(Type == CAPTURES || Type == QUIETS || Type == EVASIONS, "Wrong type");
-    [[maybe_unused]] Bitboard threatenedByPawn, threatenedByMinor, threatenedByRook,
+  Bitboard threatened, threatenedByPawn, threatenedByMinor, threatenedByRook;
-      threatenedPieces;
+  if constexpr (Type == QUIETS)
-    if constexpr (Type == QUIETS)
+  {
-    {
+      Color us = pos.side_to_move();
-        Color us = pos.side_to_move();
+      // squares threatened by pawns
      threatenedByPawn  = pos.attacks_by<PAWN>(~us);
      // squares threatened by minors or pawns
      threatenedByMinor = pos.attacks_by<KNIGHT>(~us) | pos.attacks_by<BISHOP>(~us) | threatenedByPawn;
      // squares threatened by rooks, minors or pawns
      threatenedByRook  = pos.attacks_by<ROOK>(~us) | threatenedByMinor;
-        threatenedByPawn = pos.attacks_by<PAWN>(~us);
+      // pieces threatened by pieces of lesser material value
-        threatenedByMinor =
+      threatened =  (pos.pieces(us, QUEEN) & threatenedByRook)
-          pos.attacks_by<KNIGHT>(~us) | pos.attacks_by<BISHOP>(~us) | threatenedByPawn;
+                  | (pos.pieces(us, ROOK)  & threatenedByMinor)
-        threatenedByRook = pos.attacks_by<ROOK>(~us) | threatenedByMinor;
+                  | (pos.pieces(us, KNIGHT, BISHOP) & threatenedByPawn);
  }
  else
  {
      // Silence unused variable warnings
      (void) threatened;
      (void) threatenedByPawn;
      (void) threatenedByMinor;
      (void) threatenedByRook;
  }
-        // Pieces threatened by pieces of lesser material value
+  for (auto& m : *this)
-        threatenedPieces = (pos.pieces(us, QUEEN) & threatenedByRook)
+      if constexpr (Type == CAPTURES)
-                         | (pos.pieces(us, ROOK) & threatenedByMinor)
+          m.value =  6 * int(PieceValue[MG][pos.piece_on(to_sq(m))])
-                         | (pos.pieces(us, KNIGHT, BISHOP) & threatenedByPawn);
+                   +     (*captureHistory)[pos.moved_piece(m)][to_sq(m)][type_of(pos.piece_on(to_sq(m)))];
    }
-    for (auto& m : *this)
+      else if constexpr (Type == QUIETS)
-        if constexpr (Type == CAPTURES)
+          m.value =      (*mainHistory)[pos.side_to_move()][from_to(m)]
-            m.value =
+                   + 2 * (*continuationHistory[0])[pos.moved_piece(m)][to_sq(m)]
-              7 * int(PieceValue[pos.piece_on(m.to_sq())])
+                   +     (*continuationHistory[1])[pos.moved_piece(m)][to_sq(m)]
-              + (*captureHistory)[pos.moved_piece(m)][m.to_sq()][type_of(pos.piece_on(m.to_sq()))];
+                   +     (*continuationHistory[3])[pos.moved_piece(m)][to_sq(m)]
                   +     (*continuationHistory[5])[pos.moved_piece(m)][to_sq(m)]
                   +     (threatened & from_sq(m) ?
                           (type_of(pos.moved_piece(m)) == QUEEN && !(to_sq(m) & threatenedByRook)  ? 50000
                          : type_of(pos.moved_piece(m)) == ROOK  && !(to_sq(m) & threatenedByMinor) ? 25000
                          :                                         !(to_sq(m) & threatenedByPawn)  ? 15000
                          :                                                                           0)
                          :                                                                           0);
-        else if constexpr (Type == QUIETS)
+      else // Type == EVASIONS
-        {
+      {
-            Piece     pc   = pos.moved_piece(m);
+          if (pos.capture(m))
-            PieceType pt   = type_of(pc);
+              m.value =  PieceValue[MG][pos.piece_on(to_sq(m))]
-            Square    from = m.from_sq();
+                       - Value(type_of(pos.moved_piece(m)));
-            Square    to   = m.to_sq();
+          else
-
+              m.value =      (*mainHistory)[pos.side_to_move()][from_to(m)]
-            // histories
+                       + 2 * (*continuationHistory[0])[pos.moved_piece(m)][to_sq(m)]
-            m.value = 2 * (*mainHistory)[pos.side_to_move()][m.from_to()];
+                       - (1 << 28);
-            m.value += 2 * (*pawnHistory)[pawn_structure_index(pos)][pc][to];
+      }
            m.value += (*continuationHistory[0])[pc][to];
            m.value += (*continuationHistory[1])[pc][to];
            m.value += (*continuationHistory[2])[pc][to];
            m.value += (*continuationHistory[3])[pc][to];
            m.value += (*continuationHistory[4])[pc][to] / 3;
            m.value += (*continuationHistory[5])[pc][to];
            // bonus for checks
            m.value += bool(pos.check_squares(pt) & to) * 16384;
            // bonus for escaping from capture
            m.value += threatenedPieces & from ? (pt == QUEEN && !(to & threatenedByRook)   ? 51700
                                                  : pt == ROOK && !(to & threatenedByMinor) ? 25600
                                                  : !(to & threatenedByPawn)                ? 14450
                                                                                            : 0)
                                               : 0;
            // malus for putting piece en prise
            m.value -= (pt == QUEEN ? bool(to & threatenedByRook) * 49000
                        : pt == ROOK && bool(to & threatenedByMinor) ? 24335
                                                                     : 0);
            if (ply < LOW_PLY_HISTORY_SIZE)
                m.value += 8 * (*lowPlyHistory)[ply][m.from_to()] / (1 + 2 * ply);
        }
        else  // Type == EVASIONS
        {
            if (pos.capture_stage(m))
                m.value = PieceValue[pos.piece_on(m.to_sq())] + (1 << 28);
            else
                m.value = (*mainHistory)[pos.side_to_move()][m.from_to()]
                        + (*continuationHistory[0])[pos.moved_piece(m)][m.to_sq()]
                        + (*pawnHistory)[pawn_structure_index(pos)][pos.moved_piece(m)][m.to_sq()];
        }
 }
-// Returns the next move satisfying a predicate function.
+/// MovePicker::select() returns the next move satisfying a predicate function.
-// This never returns the TT move, as it was emitted before.
+/// It never returns the TT move.
-template<typename Pred>
+template<MovePicker::PickType T, typename Pred>
 Move MovePicker::select(Pred filter) {
-    for (; cur < endMoves; ++cur)
+  while (cur < endMoves)
-        if (*cur != ttMove && filter())
+  {
-            return *cur++;
+      if (T == Best)
          std::swap(*cur, *std::max_element(cur, endMoves));
-    return Move::none();
+      if (*cur != ttMove && filter())
          return *cur++;
      cur++;
  }
  return MOVE_NONE;
 }
-// This is the most important method of the MovePicker class. We emit one
+/// MovePicker::next_move() is the most important method of the MovePicker class. It
-// new pseudo-legal move on every call until there are no more moves left,
+/// returns a new pseudo-legal move every time it is called until there are no more
-// picking the move with the highest score from a list of generated moves.
+/// moves left, picking the move with the highest score from a list of generated moves.
-Move MovePicker::next_move() {
+Move MovePicker::next_move(bool skipQuiets) {
    auto quiet_threshold = [](Depth d) { return -3560 * d; };
 top:
-    switch (stage)
+  switch (stage) {
    {
-    case MAIN_TT :
+  case MAIN_TT:
-    case EVASION_TT :
+  case EVASION_TT:
-    case QSEARCH_TT :
+  case QSEARCH_TT:
-    case PROBCUT_TT :
+  case PROBCUT_TT:
-        ++stage;
+      ++stage;
-        return ttMove;
+      return ttMove;
-    case CAPTURE_INIT :
+  case CAPTURE_INIT:
-    case PROBCUT_INIT :
+  case PROBCUT_INIT:
-    case QCAPTURE_INIT :
+  case QCAPTURE_INIT:
-        cur = endBadCaptures = moves;
+      cur = endBadCaptures = moves;
-        endMoves             = generate<CAPTURES>(pos, cur);
+      endMoves = generate<CAPTURES>(pos, cur);
-        score<CAPTURES>();
+      score<CAPTURES>();
-        partial_insertion_sort(cur, endMoves, std::numeric_limits<int>::min());
+      partial_insertion_sort(cur, endMoves, -3000 * depth);
-        ++stage;
+      ++stage;
-        goto top;
+      goto top;
-    case GOOD_CAPTURE :
+  case GOOD_CAPTURE:
-        if (select([&]() {
+      if (select<Next>([&](){
-                // Move losing capture to endBadCaptures to be tried later
+                       return pos.see_ge(*cur, Value(-69 * cur->value / 1024)) ?
-                return pos.see_ge(*cur, -cur->value / 18) ? true
+                              // Move losing capture to endBadCaptures to be tried later
-                                                          : (*endBadCaptures++ = *cur, false);
+                              true : (*endBadCaptures++ = *cur, false); }))
-            }))
+          return *(cur - 1);
            return *(cur - 1);
-        ++stage;
+      // Prepare the pointers to loop over the refutations array
-        [[fallthrough]];
+      cur = std::begin(refutations);
      endMoves = std::end(refutations);
-    case QUIET_INIT :
+      // If the countermove is the same as a killer, skip it
-        if (!skipQuiets)
+      if (   refutations[0].move == refutations[2].move
-        {
+          || refutations[1].move == refutations[2].move)
-            cur      = endBadCaptures;
+          --endMoves;
            endMoves = beginBadQuiets = endBadQuiets = generate<QUIETS>(pos, cur);
-            score<QUIETS>();
+      ++stage;
-            partial_insertion_sort(cur, endMoves, quiet_threshold(depth));
+      [[fallthrough]];
        }
-        ++stage;
+  case REFUTATION:
-        [[fallthrough]];
+      if (select<Next>([&](){ return    *cur != MOVE_NONE
                                    && !pos.capture(*cur)
                                    &&  pos.pseudo_legal(*cur); }))
          return *(cur - 1);
      ++stage;
      [[fallthrough]];
-    case GOOD_QUIET :
+  case QUIET_INIT:
-        if (!skipQuiets && select([]() { return true; }))
+      if (!skipQuiets)
-        {
+      {
-            if ((cur - 1)->value > -7998 || (cur - 1)->value <= quiet_threshold(depth))
+          cur = endBadCaptures;
-                return *(cur - 1);
+          endMoves = generate<QUIETS>(pos, cur);
-            // Remaining quiets are bad
+          score<QUIETS>();
-            beginBadQuiets = cur - 1;
+          partial_insertion_sort(cur, endMoves, -3000 * depth);
-        }
+      }
-        // Prepare the pointers to loop over the bad captures
+      ++stage;
-        cur      = moves;
+      [[fallthrough]];
        endMoves = endBadCaptures;
-        ++stage;
+  case QUIET:
-        [[fallthrough]];
+      if (   !skipQuiets
          && select<Next>([&](){return   *cur != refutations[0].move
                                      && *cur != refutations[1].move
                                      && *cur != refutations[2].move;}))
          return *(cur - 1);
-    case BAD_CAPTURE :
+      // Prepare the pointers to loop over the bad captures
-        if (select([]() { return true; }))
+      cur = moves;
-            return *(cur - 1);
+      endMoves = endBadCaptures;
-        // Prepare the pointers to loop over the bad quiets
+      ++stage;
-        cur      = beginBadQuiets;
+      [[fallthrough]];
        endMoves = endBadQuiets;
-        ++stage;
+  case BAD_CAPTURE:
-        [[fallthrough]];
+      return select<Next>([](){ return true; });
-    case BAD_QUIET :
+  case EVASION_INIT:
-        if (!skipQuiets)
+      cur = moves;
-            return select([]() { return true; });
+      endMoves = generate<EVASIONS>(pos, cur);
-        return Move::none();
+      score<EVASIONS>();
      ++stage;
      [[fallthrough]];
-    case EVASION_INIT :
+  case EVASION:
-        cur      = moves;
+      return select<Best>([](){ return true; });
        endMoves = generate<EVASIONS>(pos, cur);
-        score<EVASIONS>();
+  case PROBCUT:
-        partial_insertion_sort(cur, endMoves, std::numeric_limits<int>::min());
+      return select<Next>([&](){ return pos.see_ge(*cur, threshold); });
        ++stage;
        [[fallthrough]];
-    case EVASION :
+  case QCAPTURE:
-    case QCAPTURE :
+      if (select<Next>([&](){ return   depth > DEPTH_QS_RECAPTURES
-        return select([]() { return true; });
+                                    || to_sq(*cur) == recaptureSquare; }))
          return *(cur - 1);
-    case PROBCUT :
+      // If we did not find any move and we do not try checks, we have finished
-        return select([&]() { return pos.see_ge(*cur, threshold); });
+      if (depth != DEPTH_QS_CHECKS)
-    }
+          return MOVE_NONE;
-    assert(false);
+      ++stage;
-    return Move::none();  // Silence warning
+      [[fallthrough]];
  case QCHECK_INIT:
      cur = moves;
      endMoves = generate<QUIET_CHECKS>(pos, cur);
      ++stage;
      [[fallthrough]];
  case QCHECK:
      return select<Next>([](){ return true; });
  }
  assert(false);
  return MOVE_NONE; // Silence warning
 }
-void MovePicker::skip_quiet_moves() { skipQuiets = true; }
+} // namespace Stockfish
 }  // namespace Stockfish
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -19,62 +19,135 @@
 #ifndef MOVEPICK_H_INCLUDED
 #define MOVEPICK_H_INCLUDED
-#include "history.h"
+#include <array>
 #include <limits>
 #include <type_traits>
 #include "movegen.h"
 #include "position.h"
 #include "types.h"
 namespace Stockfish {
-class Position;
+/// StatsEntry stores the stat table value. It is usually a number but could
 /// be a move or even a nested history. We use a class instead of naked value
 /// to directly call history update operator<<() on the entry so to use stats
 /// tables at caller sites as simple multi-dim arrays.
 template<typename T, int D>
 class StatsEntry {
-// The MovePicker class is used to pick one pseudo-legal move at a time from the
+  T entry;
 // current position. The most important method is next_move(), which emits one
 // new pseudo-legal move on every call, until there are no moves left, when
 // Move::none() is returned. In order to improve the efficiency of the alpha-beta
 // algorithm, MovePicker attempts to return the moves which are most likely to get
 // a cut-off first.
 class MovePicker {
-   public:
+public:
-    MovePicker(const MovePicker&)            = delete;
+  void operator=(const T& v) { entry = v; }
-    MovePicker& operator=(const MovePicker&) = delete;
+  T* operator&() { return &entry; }
-    MovePicker(const Position&,
+  T* operator->() { return &entry; }
-               Move,
+  operator const T&() const { return entry; }
               Depth,
               const ButterflyHistory*,
               const LowPlyHistory*,
               const CapturePieceToHistory*,
               const PieceToHistory**,
               const PawnHistory*,
               int);
    MovePicker(const Position&, Move, int, const CapturePieceToHistory*);
    Move next_move();
    void skip_quiet_moves();
-   private:
+  void operator<<(int bonus) {
-    template<typename Pred>
+    assert(abs(bonus) <= D); // Ensure range is [-D, D]
-    Move select(Pred);
+    static_assert(D <= std::numeric_limits<T>::max(), "D overflows T");
    template<GenType>
    void     score();
    ExtMove* begin() { return cur; }
    ExtMove* end() { return endMoves; }
-    const Position&              pos;
+    entry += bonus - entry * abs(bonus) / D;
-    const ButterflyHistory*      mainHistory;
+
-    const LowPlyHistory*         lowPlyHistory;
+    assert(abs(entry) <= D);
-    const CapturePieceToHistory* captureHistory;
+  }
    const PieceToHistory**       continuationHistory;
    const PawnHistory*           pawnHistory;
    Move                         ttMove;
    ExtMove *                    cur, *endMoves, *endBadCaptures, *beginBadQuiets, *endBadQuiets;
    int                          stage;
    int                          threshold;
    Depth                        depth;
    int                          ply;
    bool                         skipQuiets = false;
    ExtMove                      moves[MAX_MOVES];
 };
-}  // namespace Stockfish
+/// Stats is a generic N-dimensional array used to store various statistics.
 /// The first template parameter T is the base type of the array, the second
 /// template parameter D limits the range of updates in [-D, D] when we update
 /// values with the << operator, while the last parameters (Size and Sizes)
 /// encode the dimensions of the array.
 template <typename T, int D, int Size, int... Sizes>
 struct Stats : public std::array<Stats<T, D, Sizes...>, Size>
 {
  typedef Stats<T, D, Size, Sizes...> stats;
-#endif  // #ifndef MOVEPICK_H_INCLUDED
+  void fill(const T& v) {
    // For standard-layout 'this' points to first struct member
    assert(std::is_standard_layout<stats>::value);
    typedef StatsEntry<T, D> entry;
    entry* p = reinterpret_cast<entry*>(this);
    std::fill(p, p + sizeof(*this) / sizeof(entry), v);
  }
 };
 template <typename T, int D, int Size>
 struct Stats<T, D, Size> : public std::array<StatsEntry<T, D>, Size> {};
 /// In stats table, D=0 means that the template parameter is not used
 enum StatsParams { NOT_USED = 0 };
 enum StatsType { NoCaptures, Captures };
 /// ButterflyHistory records how often quiet moves have been successful or
 /// unsuccessful during the current search, and is used for reduction and move
 /// ordering decisions. It uses 2 tables (one for each color) indexed by
 /// the move's from and to squares, see www.chessprogramming.org/Butterfly_Boards
 typedef Stats<int16_t, 14365, COLOR_NB, int(SQUARE_NB) * int(SQUARE_NB)> ButterflyHistory;
 /// CounterMoveHistory stores counter moves indexed by [piece][to] of the previous
 /// move, see www.chessprogramming.org/Countermove_Heuristic
 typedef Stats<Move, NOT_USED, PIECE_NB, SQUARE_NB> CounterMoveHistory;
 /// CapturePieceToHistory is addressed by a move's [piece][to][captured piece type]
 typedef Stats<int16_t, 10692, PIECE_NB, SQUARE_NB, PIECE_TYPE_NB> CapturePieceToHistory;
 /// PieceToHistory is like ButterflyHistory but is addressed by a move's [piece][to]
 typedef Stats<int16_t, 29952, PIECE_NB, SQUARE_NB> PieceToHistory;
 /// ContinuationHistory is the combined history of a given pair of moves, usually
 /// the current one given a previous one. The nested history table is based on
 /// PieceToHistory instead of ButterflyBoards.
 typedef Stats<PieceToHistory, NOT_USED, PIECE_NB, SQUARE_NB> ContinuationHistory;
 /// MovePicker class is used to pick one pseudo-legal move at a time from the
 /// current position. The most important method is next_move(), which returns a
 /// new pseudo-legal move each time it is called, until there are no moves left,
 /// when MOVE_NONE is returned. In order to improve the efficiency of the
 /// alpha-beta algorithm, MovePicker attempts to return the moves which are most
 /// likely to get a cut-off first.
 class MovePicker {
  enum PickType { Next, Best };
 public:
  MovePicker(const MovePicker&) = delete;
  MovePicker& operator=(const MovePicker&) = delete;
  MovePicker(const Position&, Move, Depth, const ButterflyHistory*,
                                           const CapturePieceToHistory*,
                                           const PieceToHistory**,
                                           Move,
                                           const Move*);
  MovePicker(const Position&, Move, Depth, const ButterflyHistory*,
                                           const CapturePieceToHistory*,
                                           const PieceToHistory**,
                                           Square);
  MovePicker(const Position&, Move, Value, Depth, const CapturePieceToHistory*);
  Move next_move(bool skipQuiets = false);
 private:
  template<PickType T, typename Pred> Move select(Pred);
  template<GenType> void score();
  ExtMove* begin() { return cur; }
  ExtMove* end() { return endMoves; }
  const Position& pos;
  const ButterflyHistory* mainHistory;
  const CapturePieceToHistory* captureHistory;
  const PieceToHistory** continuationHistory;
  Move ttMove;
  ExtMove refutations[3], *cur, *endMoves, *endBadCaptures;
  int stage;
  Square recaptureSquare;
  Value threshold;
  Depth depth;
  ExtMove moves[MAX_MOVES];
 };
 } // namespace Stockfish
 #endif // #ifndef MOVEPICK_H_INCLUDED
@@ -0,0 +1,403 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 // Code for calculating NNUE evaluation function
 #include <iostream>
 #include <set>
 #include <sstream>
 #include <iomanip>
 #include <fstream>
 #include "../evaluate.h"
 #include "../position.h"
 #include "../misc.h"
 #include "../uci.h"
 #include "../types.h"
 #include "evaluate_nnue.h"
 namespace Stockfish::Eval::NNUE {
  // Input feature converter
  LargePagePtr<FeatureTransformer> featureTransformer;
  // Evaluation function
  AlignedPtr<Network> network[LayerStacks];
  // Evaluation function file name
  std::string fileName;
  std::string netDescription;
  namespace Detail {
  // Initialize the evaluation function parameters
  template <typename T>
  void initialize(AlignedPtr<T>& pointer) {
    pointer.reset(reinterpret_cast<T*>(std_aligned_alloc(alignof(T), sizeof(T))));
    std::memset(pointer.get(), 0, sizeof(T));
  }
  template <typename T>
  void initialize(LargePagePtr<T>& pointer) {
    static_assert(alignof(T) <= 4096, "aligned_large_pages_alloc() may fail for such a big alignment requirement of T");
    pointer.reset(reinterpret_cast<T*>(aligned_large_pages_alloc(sizeof(T))));
    std::memset(pointer.get(), 0, sizeof(T));
  }
  // Read evaluation function parameters
  template <typename T>
  bool read_parameters(std::istream& stream, T& reference) {
    std::uint32_t header;
    header = read_little_endian<std::uint32_t>(stream);
    if (!stream || header != T::get_hash_value()) return false;
    return reference.read_parameters(stream);
  }
  // Write evaluation function parameters
  template <typename T>
  bool write_parameters(std::ostream& stream, const T& reference) {
    write_little_endian<std::uint32_t>(stream, T::get_hash_value());
    return reference.write_parameters(stream);
  }
  }  // namespace Detail
  // Initialize the evaluation function parameters
  void initialize() {
    Detail::initialize(featureTransformer);
    for (std::size_t i = 0; i < LayerStacks; ++i)
      Detail::initialize(network[i]);
  }
  // Read network header
  bool read_header(std::istream& stream, std::uint32_t* hashValue, std::string* desc)
  {
    std::uint32_t version, size;
    version     = read_little_endian<std::uint32_t>(stream);
    *hashValue  = read_little_endian<std::uint32_t>(stream);
    size        = read_little_endian<std::uint32_t>(stream);
    if (!stream || version != Version) return false;
    desc->resize(size);
    stream.read(&(*desc)[0], size);
    return !stream.fail();
  }
  // Write network header
  bool write_header(std::ostream& stream, std::uint32_t hashValue, const std::string& desc)
  {
    write_little_endian<std::uint32_t>(stream, Version);
    write_little_endian<std::uint32_t>(stream, hashValue);
    write_little_endian<std::uint32_t>(stream, (std::uint32_t)desc.size());
    stream.write(&desc[0], desc.size());
    return !stream.fail();
  }
  // Read network parameters
  bool read_parameters(std::istream& stream) {
    std::uint32_t hashValue;
    if (!read_header(stream, &hashValue, &netDescription)) return false;
    if (hashValue != HashValue) return false;
    if (!Detail::read_parameters(stream, *featureTransformer)) return false;
    for (std::size_t i = 0; i < LayerStacks; ++i)
      if (!Detail::read_parameters(stream, *(network[i]))) return false;
    return stream && stream.peek() == std::ios::traits_type::eof();
  }
  // Write network parameters
  bool write_parameters(std::ostream& stream) {
    if (!write_header(stream, HashValue, netDescription)) return false;
    if (!Detail::write_parameters(stream, *featureTransformer)) return false;
    for (std::size_t i = 0; i < LayerStacks; ++i)
      if (!Detail::write_parameters(stream, *(network[i]))) return false;
    return (bool)stream;
  }
  // Evaluation function. Perform differential calculation.
  Value evaluate(const Position& pos, bool adjusted) {
    // We manually align the arrays on the stack because with gcc < 9.3
    // overaligning stack variables with alignas() doesn't work correctly.
    constexpr uint64_t alignment = CacheLineSize;
    int delta = 10 - pos.non_pawn_material() / 1515;
 #if defined(ALIGNAS_ON_STACK_VARIABLES_BROKEN)
    TransformedFeatureType transformedFeaturesUnaligned[
      FeatureTransformer::BufferSize + alignment / sizeof(TransformedFeatureType)];
    auto* transformedFeatures = align_ptr_up<alignment>(&transformedFeaturesUnaligned[0]);
 #else
    alignas(alignment)
      TransformedFeatureType transformedFeatures[FeatureTransformer::BufferSize];
 #endif
    ASSERT_ALIGNED(transformedFeatures, alignment);
    const int bucket = (pos.count<ALL_PIECES>() - 1) / 4;
    const auto psqt = featureTransformer->transform(pos, transformedFeatures, bucket);
    const auto positional = network[bucket]->propagate(transformedFeatures);
    // Give more value to positional evaluation when adjusted flag is set
    if (adjusted)
        return static_cast<Value>(((128 - delta) * psqt + (128 + delta) * positional) / 128 / OutputScale);
    else
        return static_cast<Value>((psqt + positional) / OutputScale);
  }
  struct NnueEvalTrace {
    static_assert(LayerStacks == PSQTBuckets);
    Value psqt[LayerStacks];
    Value positional[LayerStacks];
    std::size_t correctBucket;
  };
  static NnueEvalTrace trace_evaluate(const Position& pos) {
    // We manually align the arrays on the stack because with gcc < 9.3
    // overaligning stack variables with alignas() doesn't work correctly.
    constexpr uint64_t alignment = CacheLineSize;
 #if defined(ALIGNAS_ON_STACK_VARIABLES_BROKEN)
    TransformedFeatureType transformedFeaturesUnaligned[
      FeatureTransformer::BufferSize + alignment / sizeof(TransformedFeatureType)];
    auto* transformedFeatures = align_ptr_up<alignment>(&transformedFeaturesUnaligned[0]);
 #else
    alignas(alignment)
      TransformedFeatureType transformedFeatures[FeatureTransformer::BufferSize];
 #endif
    ASSERT_ALIGNED(transformedFeatures, alignment);
    NnueEvalTrace t{};
    t.correctBucket = (pos.count<ALL_PIECES>() - 1) / 4;
    for (IndexType bucket = 0; bucket < LayerStacks; ++bucket) {
      const auto materialist = featureTransformer->transform(pos, transformedFeatures, bucket);
      const auto positional = network[bucket]->propagate(transformedFeatures);
      t.psqt[bucket] = static_cast<Value>( materialist / OutputScale );
      t.positional[bucket] = static_cast<Value>( positional / OutputScale );
    }
    return t;
  }
  static const std::string PieceToChar(" PNBRQK  pnbrqk");
  // format_cp_compact() converts a Value into (centi)pawns and writes it in a buffer.
  // The buffer must have capacity for at least 5 chars.
  static void format_cp_compact(Value v, char* buffer) {
    buffer[0] = (v < 0 ? '-' : v > 0 ? '+' : ' ');
    int cp = std::abs(100 * v / PawnValueEg);
    if (cp >= 10000)
    {
        buffer[1] = '0' + cp / 10000; cp %= 10000;
        buffer[2] = '0' + cp / 1000; cp %= 1000;
        buffer[3] = '0' + cp / 100;
        buffer[4] = ' ';
    }
    else if (cp >= 1000)
    {
        buffer[1] = '0' + cp / 1000; cp %= 1000;
        buffer[2] = '0' + cp / 100; cp %= 100;
        buffer[3] = '.';
        buffer[4] = '0' + cp / 10;
    }
    else
    {
        buffer[1] = '0' + cp / 100; cp %= 100;
        buffer[2] = '.';
        buffer[3] = '0' + cp / 10; cp %= 10;
        buffer[4] = '0' + cp / 1;
    }
  }
  // format_cp_aligned_dot() converts a Value into (centi)pawns and writes it in a buffer,
  // always keeping two decimals. The buffer must have capacity for at least 7 chars.
  static void format_cp_aligned_dot(Value v, char* buffer) {
    buffer[0] = (v < 0 ? '-' : v > 0 ? '+' : ' ');
    double cp = 1.0 * std::abs(int(v)) / PawnValueEg;
    sprintf(&buffer[1], "%6.2f", cp);
  }
  // trace() returns a string with the value of each piece on a board,
  // and a table for (PSQT, Layers) values bucket by bucket.
  std::string trace(Position& pos) {
    std::stringstream ss;
    char board[3*8+1][8*8+2];
    std::memset(board, ' ', sizeof(board));
    for (int row = 0; row < 3*8+1; ++row)
      board[row][8*8+1] = '\0';
    // A lambda to output one box of the board
    auto writeSquare = [&board](File file, Rank rank, Piece pc, Value value) {
      const int x = ((int)file) * 8;
      const int y = (7 - (int)rank) * 3;
      for (int i = 1; i < 8; ++i)
         board[y][x+i] = board[y+3][x+i] = '-';
      for (int i = 1; i < 3; ++i)
         board[y+i][x] = board[y+i][x+8] = '|';
      board[y][x] = board[y][x+8] = board[y+3][x+8] = board[y+3][x] = '+';
      if (pc != NO_PIECE)
        board[y+1][x+4] = PieceToChar[pc];
      if (value != VALUE_NONE)
        format_cp_compact(value, &board[y+2][x+2]);
    };
    // We estimate the value of each piece by doing a differential evaluation from
    // the current base eval, simulating the removal of the piece from its square.
    Value base = evaluate(pos);
    base = pos.side_to_move() == WHITE ? base : -base;
    for (File f = FILE_A; f <= FILE_H; ++f)
      for (Rank r = RANK_1; r <= RANK_8; ++r)
      {
        Square sq = make_square(f, r);
        Piece pc = pos.piece_on(sq);
        Value v = VALUE_NONE;
        if (pc != NO_PIECE && type_of(pc) != KING)
        {
          auto st = pos.state();
          pos.remove_piece(sq);
          st->accumulator.computed[WHITE] = false;
          st->accumulator.computed[BLACK] = false;
          Value eval = evaluate(pos);
          eval = pos.side_to_move() == WHITE ? eval : -eval;
          v = base - eval;
          pos.put_piece(pc, sq);
          st->accumulator.computed[WHITE] = false;
          st->accumulator.computed[BLACK] = false;
        }
        writeSquare(f, r, pc, v);
      }
    ss << " NNUE derived piece values:\n";
    for (int row = 0; row < 3*8+1; ++row)
        ss << board[row] << '\n';
    ss << '\n';
    auto t = trace_evaluate(pos);
    ss << " NNUE network contributions "
       << (pos.side_to_move() == WHITE ? "(White to move)" : "(Black to move)") << std::endl
       << "+------------+------------+------------+------------+\n"
       << "|   Bucket   |  Material  | Positional |   Total    |\n"
       << "|            |   (PSQT)   |  (Layers)  |            |\n"
       << "+------------+------------+------------+------------+\n";
    for (std::size_t bucket = 0; bucket < LayerStacks; ++bucket)
    {
      char buffer[3][8];
      std::memset(buffer, '\0', sizeof(buffer));
      format_cp_aligned_dot(t.psqt[bucket], buffer[0]);
      format_cp_aligned_dot(t.positional[bucket], buffer[1]);
      format_cp_aligned_dot(t.psqt[bucket] + t.positional[bucket], buffer[2]);
      ss <<  "|  " << bucket    << "        "
         << " |  " << buffer[0] << "  "
         << " |  " << buffer[1] << "  "
         << " |  " << buffer[2] << "  "
         << " |";
      if (bucket == t.correctBucket)
          ss << " <-- this bucket is used";
      ss << '\n';
    }
    ss << "+------------+------------+------------+------------+\n";
    return ss.str();
  }
  // Load eval, from a file stream or a memory stream
  bool load_eval(std::string name, std::istream& stream) {
    initialize();
    fileName = name;
    return read_parameters(stream);
  }
  // Save eval, to a file stream or a memory stream
  bool save_eval(std::ostream& stream) {
    if (fileName.empty())
      return false;
    return write_parameters(stream);
  }
  /// Save eval, to a file given by its name
  bool save_eval(const std::optional<std::string>& filename) {
    std::string actualFilename;
    std::string msg;
    if (filename.has_value())
        actualFilename = filename.value();
    else
    {
        if (currentEvalFileName != EvalFileDefaultName)
        {
             msg = "Failed to export a net. A non-embedded net can only be saved if the filename is specified";
             sync_cout << msg << sync_endl;
             return false;
        }
        actualFilename = EvalFileDefaultName;
    }
    std::ofstream stream(actualFilename, std::ios_base::binary);
    bool saved = save_eval(stream);
    msg = saved ? "Network saved successfully to " + actualFilename
                : "Failed to export a net";
    sync_cout << msg << sync_endl;
    return saved;
  }
 } // namespace Stockfish::Eval::NNUE
@@ -0,0 +1,59 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 // header used in NNUE evaluation function
 #ifndef NNUE_EVALUATE_NNUE_H_INCLUDED
 #define NNUE_EVALUATE_NNUE_H_INCLUDED
 #include "nnue_feature_transformer.h"
 #include <memory>
 namespace Stockfish::Eval::NNUE {
  // Hash value of evaluation function structure
  constexpr std::uint32_t HashValue =
      FeatureTransformer::get_hash_value() ^ Network::get_hash_value();
  // Deleter for automating release of memory area
  template <typename T>
  struct AlignedDeleter {
    void operator()(T* ptr) const {
      ptr->~T();
      std_aligned_free(ptr);
    }
  };
  template <typename T>
  struct LargePageDeleter {
    void operator()(T* ptr) const {
      ptr->~T();
      aligned_large_pages_free(ptr);
    }
  };
  template <typename T>
  using AlignedPtr = std::unique_ptr<T, AlignedDeleter<T>>;
  template <typename T>
  using LargePagePtr = std::unique_ptr<T, LargePageDeleter<T>>;
 }  // namespace Stockfish::Eval::NNUE
 #endif // #ifndef NNUE_EVALUATE_NNUE_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -20,69 +20,64 @@
 #include "half_ka_v2_hm.h"
 #include "../../bitboard.h"
 #include "../../position.h"
 #include "../../types.h"
 #include "../nnue_accumulator.h"
 namespace Stockfish::Eval::NNUE::Features {
-// Index of a feature for a given king position and another piece on some square
+  // Orient a square according to perspective (rotates by 180 for black)
-template<Color Perspective>
+  inline Square HalfKAv2_hm::orient(Color perspective, Square s, Square ksq) {
-inline IndexType HalfKAv2_hm::make_index(Square s, Piece pc, Square ksq) {
+    return Square(int(s) ^ (bool(perspective) * SQ_A8) ^ ((file_of(ksq) < FILE_E) * SQ_H1));
-    return IndexType((int(s) ^ OrientTBL[Perspective][ksq]) + PieceSquareIndex[Perspective][pc]
+  }
                     + KingBuckets[Perspective][ksq]);
 }
-// Get a list of indices for active features
+  // Index of a feature for a given king position and another piece on some square
-template<Color Perspective>
+  inline IndexType HalfKAv2_hm::make_index(Color perspective, Square s, Piece pc, Square ksq) {
-void HalfKAv2_hm::append_active_indices(const Position& pos, IndexList& active) {
+    Square o_ksq = orient(perspective, ksq, ksq);
-    Square   ksq = pos.square<KING>(Perspective);
+    return IndexType(orient(perspective, s, ksq) + PieceSquareIndex[perspective][pc] + PS_NB * KingBuckets[o_ksq]);
-    Bitboard bb  = pos.pieces();
+  }
  // Get a list of indices for active features
  void HalfKAv2_hm::append_active_indices(
    const Position& pos,
    Color perspective,
    IndexList& active
  ) {
    Square ksq = pos.square<KING>(perspective);
    Bitboard bb = pos.pieces();
    while (bb)
    {
-        Square s = pop_lsb(bb);
+      Square s = pop_lsb(bb);
-        active.push_back(make_index<Perspective>(s, pos.piece_on(s), ksq));
+      active.push_back(make_index(perspective, s, pos.piece_on(s), ksq));
    }
-}
+  }
 // Explicit template instantiations
 template void HalfKAv2_hm::append_active_indices<WHITE>(const Position& pos, IndexList& active);
 template void HalfKAv2_hm::append_active_indices<BLACK>(const Position& pos, IndexList& active);
 template IndexType HalfKAv2_hm::make_index<WHITE>(Square s, Piece pc, Square ksq);
 template IndexType HalfKAv2_hm::make_index<BLACK>(Square s, Piece pc, Square ksq);
-// Get a list of indices for recently changed features
+  // append_changed_indices() : get a list of indices for recently changed features
-template<Color Perspective>
+
-void HalfKAv2_hm::append_changed_indices(Square            ksq,
+  void HalfKAv2_hm::append_changed_indices(
-                                         const DirtyPiece& dp,
+    Square ksq,
-                                         IndexList&        removed,
+    const DirtyPiece& dp,
-                                         IndexList&        added) {
+    Color perspective,
-    for (int i = 0; i < dp.dirty_num; ++i)
+    IndexList& removed,
-    {
+    IndexList& added
-        if (dp.from[i] != SQ_NONE)
+  ) {
-            removed.push_back(make_index<Perspective>(dp.from[i], dp.piece[i], ksq));
+    for (int i = 0; i < dp.dirty_num; ++i) {
-        if (dp.to[i] != SQ_NONE)
+      if (dp.from[i] != SQ_NONE)
-            added.push_back(make_index<Perspective>(dp.to[i], dp.piece[i], ksq));
+        removed.push_back(make_index(perspective, dp.from[i], dp.piece[i], ksq));
      if (dp.to[i] != SQ_NONE)
        added.push_back(make_index(perspective, dp.to[i], dp.piece[i], ksq));
    }
-}
+  }
-// Explicit template instantiations
+  int HalfKAv2_hm::update_cost(const StateInfo* st) {
-template void HalfKAv2_hm::append_changed_indices<WHITE>(Square            ksq,
+    return st->dirtyPiece.dirty_num;
-                                                         const DirtyPiece& dp,
+  }
                                                         IndexList&        removed,
                                                         IndexList&        added);
 template void HalfKAv2_hm::append_changed_indices<BLACK>(Square            ksq,
                                                         const DirtyPiece& dp,
                                                         IndexList&        removed,
                                                         IndexList&        added);
-int HalfKAv2_hm::update_cost(const StateInfo* st) { return st->dirtyPiece.dirty_num; }
+  int HalfKAv2_hm::refresh_cost(const Position& pos) {
    return pos.count<ALL_PIECES>();
  }
-int HalfKAv2_hm::refresh_cost(const Position& pos) { return pos.count<ALL_PIECES>(); }
+  bool HalfKAv2_hm::requires_refresh(const StateInfo* st, Color perspective) {
 bool HalfKAv2_hm::requires_refresh(const StateInfo* st, Color perspective) {
    return st->dirtyPiece.piece[0] == make_piece(perspective, KING);
-}
+  }
 }  // namespace Stockfish::Eval::NNUE::Features
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,47 +21,52 @@
 #ifndef NNUE_FEATURES_HALF_KA_V2_HM_H_INCLUDED
 #define NNUE_FEATURES_HALF_KA_V2_HM_H_INCLUDED
 #include <cstdint>
 #include "../../misc.h"
 #include "../../types.h"
 #include "../nnue_common.h"
 #include "../../evaluate.h"
 #include "../../misc.h"
 namespace Stockfish {
-struct StateInfo;
+  struct StateInfo;
 class Position;
 }
 namespace Stockfish::Eval::NNUE::Features {
-// Feature HalfKAv2_hm: Combination of the position of own king and the
+  // Feature HalfKAv2_hm: Combination of the position of own king
-// position of pieces. Position mirrored such that king is always on e..h files.
+  // and the position of pieces. Position mirrored such that king always on e..h files.
-class HalfKAv2_hm {
+  class HalfKAv2_hm {
-    // Unique number for each piece type on each square
+    // unique number for each piece type on each square
    enum {
-        PS_NONE     = 0,
+      PS_NONE     =  0,
-        PS_W_PAWN   = 0,
+      PS_W_PAWN   =  0,
-        PS_B_PAWN   = 1 * SQUARE_NB,
+      PS_B_PAWN   =  1 * SQUARE_NB,
-        PS_W_KNIGHT = 2 * SQUARE_NB,
+      PS_W_KNIGHT =  2 * SQUARE_NB,
-        PS_B_KNIGHT = 3 * SQUARE_NB,
+      PS_B_KNIGHT =  3 * SQUARE_NB,
-        PS_W_BISHOP = 4 * SQUARE_NB,
+      PS_W_BISHOP =  4 * SQUARE_NB,
-        PS_B_BISHOP = 5 * SQUARE_NB,
+      PS_B_BISHOP =  5 * SQUARE_NB,
-        PS_W_ROOK   = 6 * SQUARE_NB,
+      PS_W_ROOK   =  6 * SQUARE_NB,
-        PS_B_ROOK   = 7 * SQUARE_NB,
+      PS_B_ROOK   =  7 * SQUARE_NB,
-        PS_W_QUEEN  = 8 * SQUARE_NB,
+      PS_W_QUEEN  =  8 * SQUARE_NB,
-        PS_B_QUEEN  = 9 * SQUARE_NB,
+      PS_B_QUEEN  =  9 * SQUARE_NB,
-        PS_KING     = 10 * SQUARE_NB,
+      PS_KING     =  10 * SQUARE_NB,
-        PS_NB       = 11 * SQUARE_NB
+      PS_NB       =  11 * SQUARE_NB
    };
    static constexpr IndexType PieceSquareIndex[COLOR_NB][PIECE_NB] = {
-      // Convention: W - us, B - them
+      // convention: W - us, B - them
-      // Viewed from other side, W and B are reversed
+      // viewed from other side, W and B are reversed
-      {PS_NONE, PS_W_PAWN, PS_W_KNIGHT, PS_W_BISHOP, PS_W_ROOK, PS_W_QUEEN, PS_KING, PS_NONE,
+      { PS_NONE, PS_W_PAWN, PS_W_KNIGHT, PS_W_BISHOP, PS_W_ROOK, PS_W_QUEEN, PS_KING, PS_NONE,
-       PS_NONE, PS_B_PAWN, PS_B_KNIGHT, PS_B_BISHOP, PS_B_ROOK, PS_B_QUEEN, PS_KING, PS_NONE},
+        PS_NONE, PS_B_PAWN, PS_B_KNIGHT, PS_B_BISHOP, PS_B_ROOK, PS_B_QUEEN, PS_KING, PS_NONE },
-      {PS_NONE, PS_B_PAWN, PS_B_KNIGHT, PS_B_BISHOP, PS_B_ROOK, PS_B_QUEEN, PS_KING, PS_NONE,
+      { PS_NONE, PS_B_PAWN, PS_B_KNIGHT, PS_B_BISHOP, PS_B_ROOK, PS_B_QUEEN, PS_KING, PS_NONE,
-       PS_NONE, PS_W_PAWN, PS_W_KNIGHT, PS_W_BISHOP, PS_W_ROOK, PS_W_QUEEN, PS_KING, PS_NONE}};
+        PS_NONE, PS_W_PAWN, PS_W_KNIGHT, PS_W_BISHOP, PS_W_ROOK, PS_W_QUEEN, PS_KING, PS_NONE }
    };
    // Orient a square according to perspective (rotates by 180 for black)
    static Square orient(Color perspective, Square s, Square ksq);
    // Index of a feature for a given king position and another piece on some square
    static IndexType make_index(Color perspective, Square s, Piece pc, Square ksq);
   public:
    // Feature name
@@ -72,79 +77,48 @@ class HalfKAv2_hm {
    // Number of feature dimensions
    static constexpr IndexType Dimensions =
-      static_cast<IndexType>(SQUARE_NB) * static_cast<IndexType>(PS_NB) / 2;
+        static_cast<IndexType>(SQUARE_NB) * static_cast<IndexType>(PS_NB) / 2;
-#define B(v) (v * PS_NB)
+    static constexpr int KingBuckets[64] = {
-    // clang-format off
+      -1, -1, -1, -1, 31, 30, 29, 28,
-    static constexpr int KingBuckets[COLOR_NB][SQUARE_NB] = {
+      -1, -1, -1, -1, 27, 26, 25, 24,
-      { B(28), B(29), B(30), B(31), B(31), B(30), B(29), B(28),
+      -1, -1, -1, -1, 23, 22, 21, 20,
-        B(24), B(25), B(26), B(27), B(27), B(26), B(25), B(24),
+      -1, -1, -1, -1, 19, 18, 17, 16,
-        B(20), B(21), B(22), B(23), B(23), B(22), B(21), B(20),
+      -1, -1, -1, -1, 15, 14, 13, 12,
-        B(16), B(17), B(18), B(19), B(19), B(18), B(17), B(16),
+      -1, -1, -1, -1, 11, 10,  9,  8,
-        B(12), B(13), B(14), B(15), B(15), B(14), B(13), B(12),
+      -1, -1, -1, -1,  7,  6,  5,  4,
-        B( 8), B( 9), B(10), B(11), B(11), B(10), B( 9), B( 8),
+      -1, -1, -1, -1,  3,  2,  1,  0
        B( 4), B( 5), B( 6), B( 7), B( 7), B( 6), B( 5), B( 4),
        B( 0), B( 1), B( 2), B( 3), B( 3), B( 2), B( 1), B( 0) },
      { B( 0), B( 1), B( 2), B( 3), B( 3), B( 2), B( 1), B( 0),
        B( 4), B( 5), B( 6), B( 7), B( 7), B( 6), B( 5), B( 4),
        B( 8), B( 9), B(10), B(11), B(11), B(10), B( 9), B( 8),
        B(12), B(13), B(14), B(15), B(15), B(14), B(13), B(12),
        B(16), B(17), B(18), B(19), B(19), B(18), B(17), B(16),
        B(20), B(21), B(22), B(23), B(23), B(22), B(21), B(20),
        B(24), B(25), B(26), B(27), B(27), B(26), B(25), B(24),
        B(28), B(29), B(30), B(31), B(31), B(30), B(29), B(28) }
    };
    // clang-format on
 #undef B
    // clang-format off
    // Orient a square according to perspective (rotates by 180 for black)
    static constexpr int OrientTBL[COLOR_NB][SQUARE_NB] = {
      { SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
        SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
        SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
        SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
        SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
        SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
        SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1,
        SQ_H1, SQ_H1, SQ_H1, SQ_H1, SQ_A1, SQ_A1, SQ_A1, SQ_A1 },
      { SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
        SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
        SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
        SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
        SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
        SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
        SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8,
        SQ_H8, SQ_H8, SQ_H8, SQ_H8, SQ_A8, SQ_A8, SQ_A8, SQ_A8 }
    };
    // clang-format on
    // Maximum number of simultaneously active features.
    static constexpr IndexType MaxActiveDimensions = 32;
-    using IndexList                                = ValueList<IndexType, MaxActiveDimensions>;
+    using IndexList = ValueList<IndexType, MaxActiveDimensions>;
    // Index of a feature for a given king position and another piece on some square
    template<Color Perspective>
    static IndexType make_index(Square s, Piece pc, Square ksq);
    // Get a list of indices for active features
-    template<Color Perspective>
+    static void append_active_indices(
-    static void append_active_indices(const Position& pos, IndexList& active);
+      const Position& pos,
      Color perspective,
      IndexList& active);
    // Get a list of indices for recently changed features
-    template<Color Perspective>
+    static void append_changed_indices(
-    static void
+      Square ksq,
-    append_changed_indices(Square ksq, const DirtyPiece& dp, IndexList& removed, IndexList& added);
+      const DirtyPiece& dp,
      Color perspective,
      IndexList& removed,
      IndexList& added
    );
    // Returns the cost of updating one perspective, the most costly one.
    // Assumes no refresh needed.
    static int update_cost(const StateInfo* st);
    static int refresh_cost(const Position& pos);
-    // Returns whether the change stored in this StateInfo means
+    // Returns whether the change stored in this StateInfo means that
-    // that a full accumulator refresh is required.
+    // a full accumulator refresh is required.
    static bool requires_refresh(const StateInfo* st, Color perspective);
-};
+  };
 }  // namespace Stockfish::Eval::NNUE::Features
-#endif  // #ifndef NNUE_FEATURES_HALF_KA_V2_HM_H_INCLUDED
+#endif // #ifndef NNUE_FEATURES_HALF_KA_V2_HM_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,117 +21,146 @@
 #ifndef NNUE_LAYERS_AFFINE_TRANSFORM_H_INCLUDED
 #define NNUE_LAYERS_AFFINE_TRANSFORM_H_INCLUDED
 #include <cstdint>
 #include <iostream>
-
+#include <algorithm>
 #include <type_traits>
 #include "../nnue_common.h"
-#include "simd.h"
+#include "../../simd.h"
 /*
  This file contains the definition for a fully connected layer (aka affine transform).
  Two approaches are employed, depending on the sizes of the transform.
  Approach 1:
    - used when the PaddedInputDimensions >= 128
    - uses AVX512 if possible
    - processes inputs in batches of 2*InputSimdWidth
      - so in batches of 128 for AVX512
    - the weight blocks of size InputSimdWidth are transposed such that
      access is sequential
    - N columns of the weight matrix are processed a time, where N
      depends on the architecture (the amount of registers)
    - accumulate + hadd is used
  Approach 2:
    - used when the PaddedInputDimensions < 128
    - does not use AVX512
    - expected use-case is for when PaddedInputDimensions == 32 and InputDimensions <= 32.
      - that's why AVX512 is hard to implement
    - expected use-case is small layers
      - not optimized as well as the approach 1
    - inputs are processed in chunks of 4, weights are respectively transposed
    - accumulation happens directly to int32s
 */
 namespace Stockfish::Eval::NNUE::Layers {
-#if defined(USE_SSSE3) || defined(USE_NEON_DOTPROD)
+// Fallback implementation for older/other architectures.
-    #define ENABLE_SEQ_OPT
+// Identical for both approaches. Requires the input to be padded to at least 16 values.
 #if !defined(USE_SSSE3)
  template <IndexType InputDimensions, IndexType PaddedInputDimensions, IndexType OutputDimensions>
  static void affine_transform_non_ssse3(std::int32_t* output, const std::int8_t* weights, const std::int32_t* biases, const std::uint8_t* input)
  {
 # if defined(USE_SSE2)
    // At least a multiple of 16, with SSE2.
    constexpr IndexType NumChunks = ceil_to_multiple<IndexType>(InputDimensions, 16) / 16;
    const __m128i Zeros = _mm_setzero_si128();
    const auto inputVector = reinterpret_cast<const __m128i*>(input);
 # elif defined(USE_MMX)
    constexpr IndexType NumChunks = ceil_to_multiple<IndexType>(InputDimensions, 8) / 8;
    const __m64 Zeros = _mm_setzero_si64();
    const auto inputVector = reinterpret_cast<const __m64*>(input);
 # elif defined(USE_NEON)
    constexpr IndexType NumChunks = ceil_to_multiple<IndexType>(InputDimensions, 16) / 16;
    const auto inputVector = reinterpret_cast<const int8x8_t*>(input);
 # endif
    for (IndexType i = 0; i < OutputDimensions; ++i) {
      const IndexType offset = i * PaddedInputDimensions;
 # if defined(USE_SSE2)
      __m128i sumLo = _mm_cvtsi32_si128(biases[i]);
      __m128i sumHi = Zeros;
      const auto row = reinterpret_cast<const __m128i*>(&weights[offset]);
      for (IndexType j = 0; j < NumChunks; ++j) {
        __m128i row_j = _mm_load_si128(&row[j]);
        __m128i input_j = _mm_load_si128(&inputVector[j]);
        __m128i extendedRowLo = _mm_srai_epi16(_mm_unpacklo_epi8(row_j, row_j), 8);
        __m128i extendedRowHi = _mm_srai_epi16(_mm_unpackhi_epi8(row_j, row_j), 8);
        __m128i extendedInputLo = _mm_unpacklo_epi8(input_j, Zeros);
        __m128i extendedInputHi = _mm_unpackhi_epi8(input_j, Zeros);
        __m128i productLo = _mm_madd_epi16(extendedRowLo, extendedInputLo);
        __m128i productHi = _mm_madd_epi16(extendedRowHi, extendedInputHi);
        sumLo = _mm_add_epi32(sumLo, productLo);
        sumHi = _mm_add_epi32(sumHi, productHi);
      }
      __m128i sum = _mm_add_epi32(sumLo, sumHi);
      __m128i sumHigh_64 = _mm_shuffle_epi32(sum, _MM_SHUFFLE(1, 0, 3, 2));
      sum = _mm_add_epi32(sum, sumHigh_64);
      __m128i sum_second_32 = _mm_shufflelo_epi16(sum, _MM_SHUFFLE(1, 0, 3, 2));
      sum = _mm_add_epi32(sum, sum_second_32);
      output[i] = _mm_cvtsi128_si32(sum);
 # elif defined(USE_MMX)
      __m64 sumLo = _mm_cvtsi32_si64(biases[i]);
      __m64 sumHi = Zeros;
      const auto row = reinterpret_cast<const __m64*>(&weights[offset]);
      for (IndexType j = 0; j < NumChunks; ++j) {
        __m64 row_j = row[j];
        __m64 input_j = inputVector[j];
        __m64 extendedRowLo = _mm_srai_pi16(_mm_unpacklo_pi8(row_j, row_j), 8);
        __m64 extendedRowHi = _mm_srai_pi16(_mm_unpackhi_pi8(row_j, row_j), 8);
        __m64 extendedInputLo = _mm_unpacklo_pi8(input_j, Zeros);
        __m64 extendedInputHi = _mm_unpackhi_pi8(input_j, Zeros);
        __m64 productLo = _mm_madd_pi16(extendedRowLo, extendedInputLo);
        __m64 productHi = _mm_madd_pi16(extendedRowHi, extendedInputHi);
        sumLo = _mm_add_pi32(sumLo, productLo);
        sumHi = _mm_add_pi32(sumHi, productHi);
      }
      __m64 sum = _mm_add_pi32(sumLo, sumHi);
      sum = _mm_add_pi32(sum, _mm_unpackhi_pi32(sum, sum));
      output[i] = _mm_cvtsi64_si32(sum);
 # elif defined(USE_NEON)
      int32x4_t sum = {biases[i]};
      const auto row = reinterpret_cast<const int8x8_t*>(&weights[offset]);
      for (IndexType j = 0; j < NumChunks; ++j) {
        int16x8_t product = vmull_s8(inputVector[j * 2], row[j * 2]);
        product = vmlal_s8(product, inputVector[j * 2 + 1], row[j * 2 + 1]);
        sum = vpadalq_s16(sum, product);
      }
      output[i] = sum[0] + sum[1] + sum[2] + sum[3];
 # else
      std::int32_t sum = biases[i];
      for (IndexType j = 0; j < InputDimensions; ++j) {
        sum += weights[offset + j] * input[j];
      }
      output[i] = sum;
 # endif
    }
 # if defined(USE_MMX)
    _mm_empty();
 # endif
  }
 #endif
-// Fallback implementation for older/other architectures.
+  template <IndexType InDims, IndexType OutDims, typename Enabled = void>
-// Requires the input to be padded to at least 16 values.
+  class AffineTransform;
 #ifndef ENABLE_SEQ_OPT
-template<IndexType InputDimensions, IndexType PaddedInputDimensions, IndexType OutputDimensions>
+  // A specialization for large inputs.
-static void affine_transform_non_ssse3(std::int32_t*       output,
+  template <IndexType InDims, IndexType OutDims>
-                                       const std::int8_t*  weights,
+  class AffineTransform<InDims, OutDims, std::enable_if_t<(ceil_to_multiple<IndexType>(InDims, MaxSimdWidth) >= 2*64)>> {
                                       const std::int32_t* biases,
                                       const std::uint8_t* input) {
    #if defined(USE_SSE2) || defined(USE_NEON)
        #if defined(USE_SSE2)
    // At least a multiple of 16, with SSE2.
    constexpr IndexType NumChunks   = ceil_to_multiple<IndexType>(InputDimensions, 16) / 16;
    const __m128i       Zeros       = _mm_setzero_si128();
    const auto          inputVector = reinterpret_cast<const __m128i*>(input);
        #elif defined(USE_NEON)
    constexpr IndexType NumChunks   = ceil_to_multiple<IndexType>(InputDimensions, 16) / 16;
    const auto          inputVector = reinterpret_cast<const int8x8_t*>(input);
        #endif
    for (IndexType i = 0; i < OutputDimensions; ++i)
    {
        const IndexType offset = i * PaddedInputDimensions;
        #if defined(USE_SSE2)
        __m128i    sumLo = _mm_cvtsi32_si128(biases[i]);
        __m128i    sumHi = Zeros;
        const auto row   = reinterpret_cast<const __m128i*>(&weights[offset]);
        for (IndexType j = 0; j < NumChunks; ++j)
        {
            __m128i row_j           = _mm_load_si128(&row[j]);
            __m128i input_j         = _mm_load_si128(&inputVector[j]);
            __m128i extendedRowLo   = _mm_srai_epi16(_mm_unpacklo_epi8(row_j, row_j), 8);
            __m128i extendedRowHi   = _mm_srai_epi16(_mm_unpackhi_epi8(row_j, row_j), 8);
            __m128i extendedInputLo = _mm_unpacklo_epi8(input_j, Zeros);
            __m128i extendedInputHi = _mm_unpackhi_epi8(input_j, Zeros);
            __m128i productLo       = _mm_madd_epi16(extendedRowLo, extendedInputLo);
            __m128i productHi       = _mm_madd_epi16(extendedRowHi, extendedInputHi);
            sumLo                   = _mm_add_epi32(sumLo, productLo);
            sumHi                   = _mm_add_epi32(sumHi, productHi);
        }
        __m128i sum           = _mm_add_epi32(sumLo, sumHi);
        __m128i sumHigh_64    = _mm_shuffle_epi32(sum, _MM_SHUFFLE(1, 0, 3, 2));
        sum                   = _mm_add_epi32(sum, sumHigh_64);
        __m128i sum_second_32 = _mm_shufflelo_epi16(sum, _MM_SHUFFLE(1, 0, 3, 2));
        sum                   = _mm_add_epi32(sum, sum_second_32);
        output[i]             = _mm_cvtsi128_si32(sum);
        #elif defined(USE_NEON)
        int32x4_t  sum = {biases[i]};
        const auto row = reinterpret_cast<const int8x8_t*>(&weights[offset]);
        for (IndexType j = 0; j < NumChunks; ++j)
        {
            int16x8_t product = vmull_s8(inputVector[j * 2], row[j * 2]);
            product           = vmlal_s8(product, inputVector[j * 2 + 1], row[j * 2 + 1]);
            sum               = vpadalq_s16(sum, product);
        }
        output[i] = sum[0] + sum[1] + sum[2] + sum[3];
        #endif
    }
    #else
    std::memcpy(output, biases, sizeof(std::int32_t) * OutputDimensions);
    // Traverse weights in transpose order to take advantage of input sparsity
    for (IndexType i = 0; i < InputDimensions; ++i)
        if (input[i])
        {
            const std::int8_t* w  = &weights[i];
            const int          in = input[i];
            for (IndexType j = 0; j < OutputDimensions; ++j)
                output[j] += w[j * PaddedInputDimensions] * in;
        }
    #endif
 }
 #endif  // !ENABLE_SEQ_OPT
 template<IndexType InDims, IndexType OutDims>
 class AffineTransform {
   public:
    // Input/output type
-    using InputType  = std::uint8_t;
+    using InputType = std::uint8_t;
    using OutputType = std::int32_t;
    // Number of input/output dimensions
-    static constexpr IndexType InputDimensions  = InDims;
+    static constexpr IndexType InputDimensions = InDims;
    static constexpr IndexType OutputDimensions = OutDims;
    static constexpr IndexType PaddedInputDimensions =
@@ -141,166 +170,370 @@ class AffineTransform {
    using OutputBuffer = OutputType[PaddedOutputDimensions];
    static_assert(PaddedInputDimensions >= 128, "Something went wrong. This specialization should not have been chosen.");
 #if defined (USE_AVX512)
    static constexpr const IndexType InputSimdWidth = 64;
    static constexpr const IndexType MaxNumOutputRegs = 16;
 #elif defined (USE_AVX2)
    static constexpr const IndexType InputSimdWidth = 32;
    static constexpr const IndexType MaxNumOutputRegs = 8;
 #elif defined (USE_SSSE3)
    static constexpr const IndexType InputSimdWidth = 16;
    static constexpr const IndexType MaxNumOutputRegs = 8;
 #elif defined (USE_NEON)
    static constexpr const IndexType InputSimdWidth = 8;
    static constexpr const IndexType MaxNumOutputRegs = 8;
 #else
    // The fallback implementation will not have permuted weights.
    // We define these to avoid a lot of ifdefs later.
    static constexpr const IndexType InputSimdWidth = 1;
    static constexpr const IndexType MaxNumOutputRegs = 1;
 #endif
    // A big block is a region in the weight matrix of the size [PaddedInputDimensions, NumOutputRegs].
    // A small block is a region of size [InputSimdWidth, 1]
    static constexpr const IndexType NumOutputRegs = std::min(MaxNumOutputRegs, OutputDimensions);
    static constexpr const IndexType SmallBlockSize = InputSimdWidth;
    static constexpr const IndexType BigBlockSize = NumOutputRegs * PaddedInputDimensions;
    static constexpr const IndexType NumSmallBlocksInBigBlock = BigBlockSize / SmallBlockSize;
    static constexpr const IndexType NumSmallBlocksPerOutput = PaddedInputDimensions / SmallBlockSize;
    static constexpr const IndexType NumBigBlocks = OutputDimensions / NumOutputRegs;
    static_assert(OutputDimensions % NumOutputRegs == 0);
    // Hash value embedded in the evaluation file
    static constexpr std::uint32_t get_hash_value(std::uint32_t prevHash) {
-        std::uint32_t hashValue = 0xCC03DAE4u;
+      std::uint32_t hashValue = 0xCC03DAE4u;
-        hashValue += OutputDimensions;
+      hashValue += OutputDimensions;
-        hashValue ^= prevHash >> 1;
+      hashValue ^= prevHash >> 1;
-        hashValue ^= prevHash << 31;
+      hashValue ^= prevHash << 31;
-        return hashValue;
+      return hashValue;
    }
-    static constexpr IndexType get_weight_index_scrambled(IndexType i) {
+    /*
-        return (i / 4) % (PaddedInputDimensions / 4) * OutputDimensions * 4
+      Transposes the small blocks within a block.
-             + i / PaddedInputDimensions * 4 + i % 4;
+      Effectively means that weights can be traversed sequentially during inference.
    */
    static IndexType get_weight_index(IndexType i)
    {
      const IndexType smallBlock = (i / SmallBlockSize) % NumSmallBlocksInBigBlock;
      const IndexType smallBlockCol = smallBlock / NumSmallBlocksPerOutput;
      const IndexType smallBlockRow = smallBlock % NumSmallBlocksPerOutput;
      const IndexType bigBlock   = i / BigBlockSize;
      const IndexType rest       = i % SmallBlockSize;
      const IndexType idx =
          bigBlock * BigBlockSize
        + smallBlockRow * SmallBlockSize * NumOutputRegs
        + smallBlockCol * SmallBlockSize
        + rest;
      return idx;
    }
-    static constexpr IndexType get_weight_index(IndexType i) {
+    // Read network parameters
-#ifdef ENABLE_SEQ_OPT
+    bool read_parameters(std::istream& stream) {
-        return get_weight_index_scrambled(i);
+      for (IndexType i = 0; i < OutputDimensions; ++i)
        biases[i] = read_little_endian<BiasType>(stream);
      for (IndexType i = 0; i < OutputDimensions * PaddedInputDimensions; ++i)
        weights[get_weight_index(i)] = read_little_endian<WeightType>(stream);
      return !stream.fail();
    }
    // Write network parameters
    bool write_parameters(std::ostream& stream) const {
      for (IndexType i = 0; i < OutputDimensions; ++i)
          write_little_endian<BiasType>(stream, biases[i]);
      for (IndexType i = 0; i < OutputDimensions * PaddedInputDimensions; ++i)
        write_little_endian<WeightType>(stream, weights[get_weight_index(i)]);
      return !stream.fail();
    }
    // Forward propagation
    const OutputType* propagate(
        const InputType* input, OutputType* output) const {
 #if defined (USE_AVX512)
      using acc_vec_t = __m512i;
      using bias_vec_t = __m128i;
      using weight_vec_t = __m512i;
      using in_vec_t = __m512i;
      #define vec_zero _mm512_setzero_si512()
      #define vec_add_dpbusd_32x2 Simd::m512_add_dpbusd_epi32x2
      #define vec_hadd Simd::m512_hadd
      #define vec_haddx4 Simd::m512_haddx4
 #elif defined (USE_AVX2)
      using acc_vec_t = __m256i;
      using bias_vec_t = __m128i;
      using weight_vec_t = __m256i;
      using in_vec_t = __m256i;
      #define vec_zero _mm256_setzero_si256()
      #define vec_add_dpbusd_32x2 Simd::m256_add_dpbusd_epi32x2
      #define vec_hadd Simd::m256_hadd
      #define vec_haddx4 Simd::m256_haddx4
 #elif defined (USE_SSSE3)
      using acc_vec_t = __m128i;
      using bias_vec_t = __m128i;
      using weight_vec_t = __m128i;
      using in_vec_t = __m128i;
      #define vec_zero _mm_setzero_si128()
      #define vec_add_dpbusd_32x2 Simd::m128_add_dpbusd_epi32x2
      #define vec_hadd Simd::m128_hadd
      #define vec_haddx4 Simd::m128_haddx4
 #elif defined (USE_NEON)
      using acc_vec_t = int32x4_t;
      using bias_vec_t = int32x4_t;
      using weight_vec_t = int8x8_t;
      using in_vec_t = int8x8_t;
      #define vec_zero {0}
      #define vec_add_dpbusd_32x2 Simd::neon_m128_add_dpbusd_epi32x2
      #define vec_hadd Simd::neon_m128_hadd
      #define vec_haddx4 Simd::neon_m128_haddx4
 #endif
 #if defined (USE_SSSE3) || defined (USE_NEON)
      const in_vec_t* invec = reinterpret_cast<const in_vec_t*>(input);
      // Perform accumulation to registers for each big block
      for (IndexType bigBlock = 0; bigBlock < NumBigBlocks; ++bigBlock)
      {
        acc_vec_t acc[NumOutputRegs] = { vec_zero };
        // Each big block has NumOutputRegs small blocks in each "row", one per register.
        // We process two small blocks at a time to save on one addition without VNNI.
        for (IndexType smallBlock = 0; smallBlock < NumSmallBlocksPerOutput; smallBlock += 2)
        {
          const weight_vec_t* weightvec =
            reinterpret_cast<const weight_vec_t*>(
                weights
              + bigBlock * BigBlockSize
              + smallBlock * SmallBlockSize * NumOutputRegs);
          const in_vec_t in0 = invec[smallBlock + 0];
          const in_vec_t in1 = invec[smallBlock + 1];
          for (IndexType k = 0; k < NumOutputRegs; ++k)
            vec_add_dpbusd_32x2(acc[k], in0, weightvec[k], in1, weightvec[k + NumOutputRegs]);
        }
        // Horizontally add all accumulators.
        if constexpr (NumOutputRegs % 4 == 0)
        {
          bias_vec_t* outputvec = reinterpret_cast<bias_vec_t*>(output);
          const bias_vec_t* biasvec = reinterpret_cast<const bias_vec_t*>(biases);
          for (IndexType k = 0; k < NumOutputRegs; k += 4)
          {
            const IndexType idx = (bigBlock * NumOutputRegs + k) / 4;
            outputvec[idx] = vec_haddx4(acc[k+0], acc[k+1], acc[k+2], acc[k+3], biasvec[idx]);
          }
        }
        else
        {
          for (IndexType k = 0; k < NumOutputRegs; ++k)
          {
            const IndexType idx = (bigBlock * NumOutputRegs + k);
            output[idx] = vec_hadd(acc[k], biases[idx]);
          }
        }
      }
 # undef vec_zero
 # undef vec_add_dpbusd_32x2
 # undef vec_hadd
 # undef vec_haddx4
 #else
-        return i;
+      // Use old implementation for the other architectures.
      affine_transform_non_ssse3<
        InputDimensions,
        PaddedInputDimensions,
        OutputDimensions>(output, weights, biases, input);
 #endif
      return output;
    }
   private:
    using BiasType = OutputType;
    using WeightType = std::int8_t;
    alignas(CacheLineSize) BiasType biases[OutputDimensions];
    alignas(CacheLineSize) WeightType weights[OutputDimensions * PaddedInputDimensions];
  };
  template <IndexType InDims, IndexType OutDims>
  class AffineTransform<InDims, OutDims, std::enable_if_t<(ceil_to_multiple<IndexType>(InDims, MaxSimdWidth) < 2*64)>> {
   public:
    // Input/output type
    // Input/output type
    using InputType = std::uint8_t;
    using OutputType = std::int32_t;
    // Number of input/output dimensions
    static constexpr IndexType InputDimensions = InDims;
    static constexpr IndexType OutputDimensions = OutDims;
    static constexpr IndexType PaddedInputDimensions =
      ceil_to_multiple<IndexType>(InputDimensions, MaxSimdWidth);
    static constexpr IndexType PaddedOutputDimensions =
      ceil_to_multiple<IndexType>(OutputDimensions, MaxSimdWidth);
    using OutputBuffer = OutputType[PaddedOutputDimensions];
    static_assert(PaddedInputDimensions < 128, "Something went wrong. This specialization should not have been chosen.");
 #if defined (USE_SSSE3)
    static constexpr const IndexType OutputSimdWidth = SimdWidth / 4;
    static constexpr const IndexType InputSimdWidth = SimdWidth;
 #endif
    // Hash value embedded in the evaluation file
    static constexpr std::uint32_t get_hash_value(std::uint32_t prevHash) {
      std::uint32_t hashValue = 0xCC03DAE4u;
      hashValue += OutputDimensions;
      hashValue ^= prevHash >> 1;
      hashValue ^= prevHash << 31;
      return hashValue;
    }
    static IndexType get_weight_index_scrambled(IndexType i)
    {
      return
        (i / 4) % (PaddedInputDimensions / 4) * OutputDimensions * 4 +
        i / PaddedInputDimensions * 4 +
        i % 4;
    }
    static IndexType get_weight_index(IndexType i)
    {
 #if defined (USE_SSSE3)
      return get_weight_index_scrambled(i);
 #else
      return i;
 #endif
    }
    // Read network parameters
    bool read_parameters(std::istream& stream) {
-        read_little_endian<BiasType>(stream, biases, OutputDimensions);
+      for (IndexType i = 0; i < OutputDimensions; ++i)
-        for (IndexType i = 0; i < OutputDimensions * PaddedInputDimensions; ++i)
+        biases[i] = read_little_endian<BiasType>(stream);
-            weights[get_weight_index(i)] = read_little_endian<WeightType>(stream);
+      for (IndexType i = 0; i < OutputDimensions * PaddedInputDimensions; ++i)
        weights[get_weight_index(i)] = read_little_endian<WeightType>(stream);
-        return !stream.fail();
+      return !stream.fail();
    }
    // Write network parameters
    bool write_parameters(std::ostream& stream) const {
-        write_little_endian<BiasType>(stream, biases, OutputDimensions);
+      for (IndexType i = 0; i < OutputDimensions; ++i)
        write_little_endian<BiasType>(stream, biases[i]);
-        for (IndexType i = 0; i < OutputDimensions * PaddedInputDimensions; ++i)
+      for (IndexType i = 0; i < OutputDimensions * PaddedInputDimensions; ++i)
-            write_little_endian<WeightType>(stream, weights[get_weight_index(i)]);
+        write_little_endian<WeightType>(stream, weights[get_weight_index(i)]);
-        return !stream.fail();
+      return !stream.fail();
    }
    // Forward propagation
-    void propagate(const InputType* input, OutputType* output) const {
+    const OutputType* propagate(
        const InputType* input, OutputType* output) const {
-#ifdef ENABLE_SEQ_OPT
+#if defined (USE_AVX2)
-
+      using vec_t = __m256i;
-        if constexpr (OutputDimensions > 1)
+      #define vec_setzero _mm256_setzero_si256
-        {
+      #define vec_set_32 _mm256_set1_epi32
-    #if defined(USE_AVX512)
+      #define vec_add_dpbusd_32 Simd::m256_add_dpbusd_epi32
-            using vec_t = __m512i;
+      #define vec_add_dpbusd_32x2 Simd::m256_add_dpbusd_epi32x2
-        #define vec_set_32 _mm512_set1_epi32
+      #define vec_add_dpbusd_32x4 Simd::m256_add_dpbusd_epi32x4
-        #define vec_add_dpbusd_32 Simd::m512_add_dpbusd_epi32
+      #define vec_hadd Simd::m256_hadd
-    #elif defined(USE_AVX2)
+      #define vec_haddx4 Simd::m256_haddx4
-            using vec_t = __m256i;
+#elif defined (USE_SSSE3)
-        #define vec_set_32 _mm256_set1_epi32
+      using vec_t = __m128i;
-        #define vec_add_dpbusd_32 Simd::m256_add_dpbusd_epi32
+      #define vec_setzero _mm_setzero_si128
-    #elif defined(USE_SSSE3)
+      #define vec_set_32 _mm_set1_epi32
-            using vec_t = __m128i;
+      #define vec_add_dpbusd_32 Simd::m128_add_dpbusd_epi32
-        #define vec_set_32 _mm_set1_epi32
+      #define vec_add_dpbusd_32x2 Simd::m128_add_dpbusd_epi32x2
-        #define vec_add_dpbusd_32 Simd::m128_add_dpbusd_epi32
+      #define vec_add_dpbusd_32x4 Simd::m128_add_dpbusd_epi32x4
-    #elif defined(USE_NEON_DOTPROD)
+      #define vec_hadd Simd::m128_hadd
-            using vec_t = int32x4_t;
+      #define vec_haddx4 Simd::m128_haddx4
        #define vec_set_32 vdupq_n_s32
        #define vec_add_dpbusd_32(acc, a, b) \
            Simd::dotprod_m128_add_dpbusd_epi32(acc, vreinterpretq_s8_s32(a), \
                                                vreinterpretq_s8_s32(b))
    #endif
            static constexpr IndexType OutputSimdWidth = sizeof(vec_t) / sizeof(OutputType);
            static_assert(OutputDimensions % OutputSimdWidth == 0);
            constexpr IndexType NumChunks = ceil_to_multiple<IndexType>(InputDimensions, 8) / 4;
            constexpr IndexType NumRegs   = OutputDimensions / OutputSimdWidth;
            const auto   input32 = reinterpret_cast<const std::int32_t*>(input);
            const vec_t* biasvec = reinterpret_cast<const vec_t*>(biases);
            vec_t        acc[NumRegs];
            for (IndexType k = 0; k < NumRegs; ++k)
                acc[k] = biasvec[k];
            for (IndexType i = 0; i < NumChunks; ++i)
            {
                const vec_t in0 = vec_set_32(input32[i]);
                const auto  col0 =
                  reinterpret_cast<const vec_t*>(&weights[i * OutputDimensions * 4]);
                for (IndexType k = 0; k < NumRegs; ++k)
                    vec_add_dpbusd_32(acc[k], in0, col0[k]);
            }
            vec_t* outptr = reinterpret_cast<vec_t*>(output);
            for (IndexType k = 0; k < NumRegs; ++k)
                outptr[k] = acc[k];
    #undef vec_set_32
    #undef vec_add_dpbusd_32
        }
        else if constexpr (OutputDimensions == 1)
        {
    // We cannot use AVX512 for the last layer because there are only 32 inputs
    // and the buffer is not padded to 64 elements.
    #if defined(USE_AVX2)
            using vec_t = __m256i;
        #define vec_setzero() _mm256_setzero_si256()
        #define vec_set_32 _mm256_set1_epi32
        #define vec_add_dpbusd_32 Simd::m256_add_dpbusd_epi32
        #define vec_hadd Simd::m256_hadd
    #elif defined(USE_SSSE3)
            using vec_t = __m128i;
        #define vec_setzero() _mm_setzero_si128()
        #define vec_set_32 _mm_set1_epi32
        #define vec_add_dpbusd_32 Simd::m128_add_dpbusd_epi32
        #define vec_hadd Simd::m128_hadd
    #elif defined(USE_NEON_DOTPROD)
            using vec_t = int32x4_t;
        #define vec_setzero() vdupq_n_s32(0)
        #define vec_set_32 vdupq_n_s32
        #define vec_add_dpbusd_32(acc, a, b) \
            Simd::dotprod_m128_add_dpbusd_epi32(acc, vreinterpretq_s8_s32(a), \
                                                vreinterpretq_s8_s32(b))
        #define vec_hadd Simd::neon_m128_hadd
    #endif
            const auto inputVector = reinterpret_cast<const vec_t*>(input);
            static constexpr IndexType InputSimdWidth = sizeof(vec_t) / sizeof(InputType);
            static_assert(PaddedInputDimensions % InputSimdWidth == 0);
            constexpr IndexType NumChunks = PaddedInputDimensions / InputSimdWidth;
            vec_t               sum0      = vec_setzero();
            const auto          row0      = reinterpret_cast<const vec_t*>(&weights[0]);
            for (int j = 0; j < int(NumChunks); ++j)
            {
                const vec_t in = inputVector[j];
                vec_add_dpbusd_32(sum0, in, row0[j]);
            }
            output[0] = vec_hadd(sum0, biases[0]);
    #undef vec_setzero
    #undef vec_set_32
    #undef vec_add_dpbusd_32
    #undef vec_hadd
        }
 #else
        // Use old implementation for the other architectures.
        affine_transform_non_ssse3<InputDimensions, PaddedInputDimensions, OutputDimensions>(
          output, weights, biases, input);
 #endif
 #if defined (USE_SSSE3)
      const auto inputVector = reinterpret_cast<const vec_t*>(input);
      static_assert(OutputDimensions % OutputSimdWidth == 0 || OutputDimensions == 1);
      if constexpr (OutputDimensions % OutputSimdWidth == 0)
      {
        constexpr IndexType NumChunks = ceil_to_multiple<IndexType>(InputDimensions, 8) / 4;
        constexpr IndexType NumRegs = OutputDimensions / OutputSimdWidth;
        const auto input32 = reinterpret_cast<const std::int32_t*>(input);
        const vec_t* biasvec = reinterpret_cast<const vec_t*>(biases);
        vec_t acc[NumRegs];
        for (IndexType k = 0; k < NumRegs; ++k)
          acc[k] = biasvec[k];
        for (IndexType i = 0; i < NumChunks; i += 2)
        {
          const vec_t in0 = vec_set_32(input32[i + 0]);
          const vec_t in1 = vec_set_32(input32[i + 1]);
          const auto col0 = reinterpret_cast<const vec_t*>(&weights[(i + 0) * OutputDimensions * 4]);
          const auto col1 = reinterpret_cast<const vec_t*>(&weights[(i + 1) * OutputDimensions * 4]);
          for (IndexType k = 0; k < NumRegs; ++k)
            vec_add_dpbusd_32x2(acc[k], in0, col0[k], in1, col1[k]);
        }
        vec_t* outptr = reinterpret_cast<vec_t*>(output);
        for (IndexType k = 0; k < NumRegs; ++k)
          outptr[k] = acc[k];
      }
      else if constexpr (OutputDimensions == 1)
      {
        constexpr IndexType NumChunks = PaddedInputDimensions / SimdWidth;
        vec_t sum0 = vec_setzero();
        const auto row0 = reinterpret_cast<const vec_t*>(&weights[0]);
        for (int j = 0; j < (int)NumChunks; ++j)
        {
          const vec_t in = inputVector[j];
          vec_add_dpbusd_32(sum0, in, row0[j]);
        }
        output[0] = vec_hadd(sum0, biases[0]);
      }
 # undef vec_setzero
 # undef vec_set_32
 # undef vec_add_dpbusd_32
 # undef vec_add_dpbusd_32x2
 # undef vec_add_dpbusd_32x4
 # undef vec_hadd
 # undef vec_haddx4
 #else
      // Use old implementation for the other architectures.
      affine_transform_non_ssse3<
        InputDimensions,
        PaddedInputDimensions,
        OutputDimensions>(output, weights, biases, input);
 #endif
      return output;
    }
   private:
-    using BiasType   = OutputType;
+    using BiasType = OutputType;
    using WeightType = std::int8_t;
    alignas(CacheLineSize) BiasType biases[OutputDimensions];
    alignas(CacheLineSize) WeightType weights[OutputDimensions * PaddedInputDimensions];
-};
+  };
 }  // namespace Stockfish::Eval::NNUE::Layers
-#endif  // #ifndef NNUE_LAYERS_AFFINE_TRANSFORM_H_INCLUDED
+#endif // #ifndef NNUE_LAYERS_AFFINE_TRANSFORM_H_INCLUDED
@@ -1,306 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 // Definition of layer AffineTransformSparseInput of NNUE evaluation function
 #ifndef NNUE_LAYERS_AFFINE_TRANSFORM_SPARSE_INPUT_H_INCLUDED
 #define NNUE_LAYERS_AFFINE_TRANSFORM_SPARSE_INPUT_H_INCLUDED
 #include <algorithm>
 #include <array>
 #include <cstdint>
 #include <iostream>
 #include "../../bitboard.h"
 #include "../nnue_common.h"
 #include "affine_transform.h"
 #include "simd.h"
 /*
  This file contains the definition for a fully connected layer (aka affine transform) with block sparse input.
 */
 namespace Stockfish::Eval::NNUE::Layers {
 #if (USE_SSSE3 | (USE_NEON >= 8))
 static constexpr int lsb_index64[64] = {
  0,  47, 1,  56, 48, 27, 2,  60, 57, 49, 41, 37, 28, 16, 3,  61, 54, 58, 35, 52, 50, 42,
  21, 44, 38, 32, 29, 23, 17, 11, 4,  62, 46, 55, 26, 59, 40, 36, 15, 53, 34, 51, 20, 43,
  31, 22, 10, 45, 25, 39, 14, 33, 19, 30, 9,  24, 13, 18, 8,  12, 7,  6,  5,  63};
 constexpr int constexpr_lsb(uint64_t bb) {
    assert(bb != 0);
    constexpr uint64_t debruijn64 = 0x03F79D71B4CB0A89ULL;
    return lsb_index64[((bb ^ (bb - 1)) * debruijn64) >> 58];
 }
 alignas(CacheLineSize) static constexpr struct OffsetIndices {
    #if (USE_SSE41)
    std::uint8_t offset_indices[256][8];
    #else
    std::uint16_t offset_indices[256][8];
    #endif
    constexpr OffsetIndices() :
        offset_indices() {
        for (int i = 0; i < 256; ++i)
        {
            std::uint64_t j = i, k = 0;
            while (j)
            {
                offset_indices[i][k++] = constexpr_lsb(j);
                j &= j - 1;
            }
            while (k < 8)
                offset_indices[i][k++] = 0;
        }
    }
 } Lookup;
 // Find indices of nonzero numbers in an int32_t array
 template<const IndexType InputDimensions>
 void find_nnz(const std::int32_t* input, std::uint16_t* out, IndexType& count_out) {
    #if defined(USE_SSSE3)
        #if defined(USE_AVX512)
    using vec_t = __m512i;
            #define vec_nnz(a) _mm512_cmpgt_epi32_mask(a, _mm512_setzero_si512())
        #elif defined(USE_AVX2)
    using vec_t = __m256i;
            #if defined(USE_VNNI) && !defined(USE_AVXVNNI)
                #define vec_nnz(a) _mm256_cmpgt_epi32_mask(a, _mm256_setzero_si256())
            #else
                #define vec_nnz(a) \
                    _mm256_movemask_ps( \
                      _mm256_castsi256_ps(_mm256_cmpgt_epi32(a, _mm256_setzero_si256())))
            #endif
        #elif defined(USE_SSSE3)
    using vec_t = __m128i;
            #define vec_nnz(a) \
                _mm_movemask_ps(_mm_castsi128_ps(_mm_cmpgt_epi32(a, _mm_setzero_si128())))
        #endif
    using vec128_t = __m128i;
        #define vec128_zero _mm_setzero_si128()
        #define vec128_set_16(a) _mm_set1_epi16(a)
        #if (USE_SSE41)
            #define vec128_load(a) _mm_cvtepu8_epi16(_mm_loadl_epi64(a))
        #else
            #define vec128_load(a) _mm_load_si128(a)
        #endif
        #define vec128_storeu(a, b) _mm_storeu_si128(a, b)
        #define vec128_add(a, b) _mm_add_epi16(a, b)
    #elif defined(USE_NEON)
    using vec_t                        = uint32x4_t;
    static const std::uint32_t Mask[4] = {1, 2, 4, 8};
        #define vec_nnz(a) vaddvq_u32(vandq_u32(vtstq_u32(a, a), vld1q_u32(Mask)))
    using vec128_t                     = uint16x8_t;
        #define vec128_zero vdupq_n_u16(0)
        #define vec128_set_16(a) vdupq_n_u16(a)
        #define vec128_load(a) vld1q_u16(reinterpret_cast<const std::uint16_t*>(a))
        #define vec128_storeu(a, b) vst1q_u16(reinterpret_cast<std::uint16_t*>(a), b)
        #define vec128_add(a, b) vaddq_u16(a, b)
    #endif
    constexpr IndexType InputSimdWidth = sizeof(vec_t) / sizeof(std::int32_t);
    // Inputs are processed InputSimdWidth at a time and outputs are processed 8 at a time so we process in chunks of max(InputSimdWidth, 8)
    constexpr IndexType ChunkSize       = std::max<IndexType>(InputSimdWidth, 8);
    constexpr IndexType NumChunks       = InputDimensions / ChunkSize;
    constexpr IndexType InputsPerChunk  = ChunkSize / InputSimdWidth;
    constexpr IndexType OutputsPerChunk = ChunkSize / 8;
    const auto     inputVector = reinterpret_cast<const vec_t*>(input);
    IndexType      count       = 0;
    vec128_t       base        = vec128_zero;
    const vec128_t increment   = vec128_set_16(8);
    for (IndexType i = 0; i < NumChunks; ++i)
    {
        // bitmask of nonzero values in this chunk
        unsigned nnz = 0;
        for (IndexType j = 0; j < InputsPerChunk; ++j)
        {
            const vec_t inputChunk = inputVector[i * InputsPerChunk + j];
            nnz |= unsigned(vec_nnz(inputChunk)) << (j * InputSimdWidth);
        }
        for (IndexType j = 0; j < OutputsPerChunk; ++j)
        {
            const unsigned lookup = (nnz >> (j * 8)) & 0xFF;
            const vec128_t offsets =
              vec128_load(reinterpret_cast<const vec128_t*>(&Lookup.offset_indices[lookup]));
            vec128_storeu(reinterpret_cast<vec128_t*>(out + count), vec128_add(base, offsets));
            count += popcount(lookup);
            base = vec128_add(base, increment);
        }
    }
    count_out = count;
 }
    #undef vec_nnz
    #undef vec128_zero
    #undef vec128_set_16
    #undef vec128_load
    #undef vec128_storeu
    #undef vec128_add
 #endif
 // Sparse input implementation
 template<IndexType InDims, IndexType OutDims>
 class AffineTransformSparseInput {
   public:
    // Input/output type
    using InputType  = std::uint8_t;
    using OutputType = std::int32_t;
    // Number of input/output dimensions
    static constexpr IndexType InputDimensions  = InDims;
    static constexpr IndexType OutputDimensions = OutDims;
    static_assert(OutputDimensions % 16 == 0,
                  "Only implemented for OutputDimensions divisible by 16.");
    static constexpr IndexType PaddedInputDimensions =
      ceil_to_multiple<IndexType>(InputDimensions, MaxSimdWidth);
    static constexpr IndexType PaddedOutputDimensions =
      ceil_to_multiple<IndexType>(OutputDimensions, MaxSimdWidth);
 #if (USE_SSSE3 | (USE_NEON >= 8))
    static constexpr IndexType ChunkSize = 4;
 #else
    static constexpr IndexType ChunkSize = 1;
 #endif
    using OutputBuffer = OutputType[PaddedOutputDimensions];
    // Hash value embedded in the evaluation file
    static constexpr std::uint32_t get_hash_value(std::uint32_t prevHash) {
        std::uint32_t hashValue = 0xCC03DAE4u;
        hashValue += OutputDimensions;
        hashValue ^= prevHash >> 1;
        hashValue ^= prevHash << 31;
        return hashValue;
    }
    static constexpr IndexType get_weight_index_scrambled(IndexType i) {
        return (i / ChunkSize) % (PaddedInputDimensions / ChunkSize) * OutputDimensions * ChunkSize
             + i / PaddedInputDimensions * ChunkSize + i % ChunkSize;
    }
    static constexpr IndexType get_weight_index(IndexType i) {
 #if (USE_SSSE3 | (USE_NEON >= 8))
        return get_weight_index_scrambled(i);
 #else
        return i;
 #endif
    }
    // Read network parameters
    bool read_parameters(std::istream& stream) {
        read_little_endian<BiasType>(stream, biases, OutputDimensions);
        for (IndexType i = 0; i < OutputDimensions * PaddedInputDimensions; ++i)
            weights[get_weight_index(i)] = read_little_endian<WeightType>(stream);
        return !stream.fail();
    }
    // Write network parameters
    bool write_parameters(std::ostream& stream) const {
        write_little_endian<BiasType>(stream, biases, OutputDimensions);
        for (IndexType i = 0; i < OutputDimensions * PaddedInputDimensions; ++i)
            write_little_endian<WeightType>(stream, weights[get_weight_index(i)]);
        return !stream.fail();
    }
    // Forward propagation
    void propagate(const InputType* input, OutputType* output) const {
 #if (USE_SSSE3 | (USE_NEON >= 8))
    #if defined(USE_AVX512)
        using invec_t  = __m512i;
        using outvec_t = __m512i;
        #define vec_set_32 _mm512_set1_epi32
        #define vec_add_dpbusd_32 Simd::m512_add_dpbusd_epi32
    #elif defined(USE_AVX2)
        using invec_t  = __m256i;
        using outvec_t = __m256i;
        #define vec_set_32 _mm256_set1_epi32
        #define vec_add_dpbusd_32 Simd::m256_add_dpbusd_epi32
    #elif defined(USE_SSSE3)
        using invec_t  = __m128i;
        using outvec_t = __m128i;
        #define vec_set_32 _mm_set1_epi32
        #define vec_add_dpbusd_32 Simd::m128_add_dpbusd_epi32
    #elif defined(USE_NEON_DOTPROD)
        using invec_t  = int8x16_t;
        using outvec_t = int32x4_t;
        #define vec_set_32(a) vreinterpretq_s8_u32(vdupq_n_u32(a))
        #define vec_add_dpbusd_32 Simd::dotprod_m128_add_dpbusd_epi32
    #elif defined(USE_NEON)
        using invec_t  = int8x16_t;
        using outvec_t = int32x4_t;
        #define vec_set_32(a) vreinterpretq_s8_u32(vdupq_n_u32(a))
        #define vec_add_dpbusd_32 Simd::neon_m128_add_dpbusd_epi32
    #endif
        static constexpr IndexType OutputSimdWidth = sizeof(outvec_t) / sizeof(OutputType);
        constexpr IndexType NumChunks = ceil_to_multiple<IndexType>(InputDimensions, 8) / ChunkSize;
        constexpr IndexType NumRegs   = OutputDimensions / OutputSimdWidth;
        std::uint16_t       nnz[NumChunks];
        IndexType           count;
        const auto input32 = reinterpret_cast<const std::int32_t*>(input);
        // Find indices of nonzero 32-bit blocks
        find_nnz<NumChunks>(input32, nnz, count);
        const outvec_t* biasvec = reinterpret_cast<const outvec_t*>(biases);
        outvec_t        acc[NumRegs];
        for (IndexType k = 0; k < NumRegs; ++k)
            acc[k] = biasvec[k];
        for (IndexType j = 0; j < count; ++j)
        {
            const auto    i  = nnz[j];
            const invec_t in = vec_set_32(input32[i]);
            const auto    col =
              reinterpret_cast<const invec_t*>(&weights[i * OutputDimensions * ChunkSize]);
            for (IndexType k = 0; k < NumRegs; ++k)
                vec_add_dpbusd_32(acc[k], in, col[k]);
        }
        outvec_t* outptr = reinterpret_cast<outvec_t*>(output);
        for (IndexType k = 0; k < NumRegs; ++k)
            outptr[k] = acc[k];
    #undef vec_set_32
    #undef vec_add_dpbusd_32
 #else
        // Use dense implementation for the other architectures.
        affine_transform_non_ssse3<InputDimensions, PaddedInputDimensions, OutputDimensions>(
          output, weights, biases, input);
 #endif
    }
   private:
    using BiasType   = OutputType;
    using WeightType = std::int8_t;
    alignas(CacheLineSize) BiasType biases[OutputDimensions];
    alignas(CacheLineSize) WeightType weights[OutputDimensions * PaddedInputDimensions];
 };
 }  // namespace Stockfish::Eval::NNUE::Layers
 #endif  // #ifndef NNUE_LAYERS_AFFINE_TRANSFORM_SPARSE_INPUT_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,144 +21,160 @@
 #ifndef NNUE_LAYERS_CLIPPED_RELU_H_INCLUDED
 #define NNUE_LAYERS_CLIPPED_RELU_H_INCLUDED
 #include <algorithm>
 #include <cstdint>
 #include <iosfwd>
 #include "../nnue_common.h"
 namespace Stockfish::Eval::NNUE::Layers {
-// Clipped ReLU
+  // Clipped ReLU
-template<IndexType InDims>
+  template <IndexType InDims>
-class ClippedReLU {
+  class ClippedReLU {
   public:
    // Input/output type
-    using InputType  = std::int32_t;
+    using InputType = std::int32_t;
    using OutputType = std::uint8_t;
    // Number of input/output dimensions
-    static constexpr IndexType InputDimensions  = InDims;
+    static constexpr IndexType InputDimensions = InDims;
    static constexpr IndexType OutputDimensions = InputDimensions;
    static constexpr IndexType PaddedOutputDimensions =
-      ceil_to_multiple<IndexType>(OutputDimensions, 32);
+        ceil_to_multiple<IndexType>(OutputDimensions, 32);
    using OutputBuffer = OutputType[PaddedOutputDimensions];
    // Hash value embedded in the evaluation file
    static constexpr std::uint32_t get_hash_value(std::uint32_t prevHash) {
-        std::uint32_t hashValue = 0x538D24C7u;
+      std::uint32_t hashValue = 0x538D24C7u;
-        hashValue += prevHash;
+      hashValue += prevHash;
-        return hashValue;
+      return hashValue;
    }
    // Read network parameters
-    bool read_parameters(std::istream&) { return true; }
+    bool read_parameters(std::istream&) {
      return true;
    }
    // Write network parameters
-    bool write_parameters(std::ostream&) const { return true; }
+    bool write_parameters(std::ostream&) const {
      return true;
    }
    // Forward propagation
-    void propagate(const InputType* input, OutputType* output) const {
+    const OutputType* propagate(
        const InputType* input, OutputType* output) const {
-#if defined(USE_AVX2)
+  #if defined(USE_AVX2)
-        if constexpr (InputDimensions % SimdWidth == 0)
+      if constexpr (InputDimensions % SimdWidth == 0) {
        {
            constexpr IndexType NumChunks = InputDimensions / SimdWidth;
            const __m256i       Offsets   = _mm256_set_epi32(7, 3, 6, 2, 5, 1, 4, 0);
            const auto          in        = reinterpret_cast<const __m256i*>(input);
            const auto          out       = reinterpret_cast<__m256i*>(output);
            for (IndexType i = 0; i < NumChunks; ++i)
            {
                const __m256i words0 =
                  _mm256_srli_epi16(_mm256_packus_epi32(_mm256_load_si256(&in[i * 4 + 0]),
                                                        _mm256_load_si256(&in[i * 4 + 1])),
                                    WeightScaleBits);
                const __m256i words1 =
                  _mm256_srli_epi16(_mm256_packus_epi32(_mm256_load_si256(&in[i * 4 + 2]),
                                                        _mm256_load_si256(&in[i * 4 + 3])),
                                    WeightScaleBits);
                _mm256_store_si256(&out[i], _mm256_permutevar8x32_epi32(
                                              _mm256_packs_epi16(words0, words1), Offsets));
            }
        }
        else
        {
            constexpr IndexType NumChunks = InputDimensions / (SimdWidth / 2);
            const auto          in        = reinterpret_cast<const __m128i*>(input);
            const auto          out       = reinterpret_cast<__m128i*>(output);
            for (IndexType i = 0; i < NumChunks; ++i)
            {
                const __m128i words0 = _mm_srli_epi16(
                  _mm_packus_epi32(_mm_load_si128(&in[i * 4 + 0]), _mm_load_si128(&in[i * 4 + 1])),
                  WeightScaleBits);
                const __m128i words1 = _mm_srli_epi16(
                  _mm_packus_epi32(_mm_load_si128(&in[i * 4 + 2]), _mm_load_si128(&in[i * 4 + 3])),
                  WeightScaleBits);
                _mm_store_si128(&out[i], _mm_packs_epi16(words0, words1));
            }
        }
        constexpr IndexType Start = InputDimensions % SimdWidth == 0
                                    ? InputDimensions / SimdWidth * SimdWidth
                                    : InputDimensions / (SimdWidth / 2) * (SimdWidth / 2);
 #elif defined(USE_SSE2)
        constexpr IndexType NumChunks = InputDimensions / SimdWidth;
-
+        const __m256i Zero = _mm256_setzero_si256();
-    #ifndef USE_SSE41
+        const __m256i Offsets = _mm256_set_epi32(7, 3, 6, 2, 5, 1, 4, 0);
-        const __m128i k0x80s = _mm_set1_epi8(-128);
+        const auto in = reinterpret_cast<const __m256i*>(input);
-    #endif
+        const auto out = reinterpret_cast<__m256i*>(output);
-
+        for (IndexType i = 0; i < NumChunks; ++i) {
-        const auto in  = reinterpret_cast<const __m128i*>(input);
+          const __m256i words0 = _mm256_srai_epi16(_mm256_packs_epi32(
-        const auto out = reinterpret_cast<__m128i*>(output);
+              _mm256_load_si256(&in[i * 4 + 0]),
-        for (IndexType i = 0; i < NumChunks; ++i)
+              _mm256_load_si256(&in[i * 4 + 1])), WeightScaleBits);
-        {
+          const __m256i words1 = _mm256_srai_epi16(_mm256_packs_epi32(
-    #if defined(USE_SSE41)
+              _mm256_load_si256(&in[i * 4 + 2]),
-            const __m128i words0 = _mm_srli_epi16(
+              _mm256_load_si256(&in[i * 4 + 3])), WeightScaleBits);
-              _mm_packus_epi32(_mm_load_si128(&in[i * 4 + 0]), _mm_load_si128(&in[i * 4 + 1])),
+          _mm256_store_si256(&out[i], _mm256_permutevar8x32_epi32(_mm256_max_epi8(
-              WeightScaleBits);
+              _mm256_packs_epi16(words0, words1), Zero), Offsets));
            const __m128i words1 = _mm_srli_epi16(
              _mm_packus_epi32(_mm_load_si128(&in[i * 4 + 2]), _mm_load_si128(&in[i * 4 + 3])),
              WeightScaleBits);
            _mm_store_si128(&out[i], _mm_packs_epi16(words0, words1));
    #else
            const __m128i words0 = _mm_srai_epi16(
              _mm_packs_epi32(_mm_load_si128(&in[i * 4 + 0]), _mm_load_si128(&in[i * 4 + 1])),
              WeightScaleBits);
            const __m128i words1 = _mm_srai_epi16(
              _mm_packs_epi32(_mm_load_si128(&in[i * 4 + 2]), _mm_load_si128(&in[i * 4 + 3])),
              WeightScaleBits);
            const __m128i packedbytes = _mm_packs_epi16(words0, words1);
            _mm_store_si128(&out[i], _mm_subs_epi8(_mm_adds_epi8(packedbytes, k0x80s), k0x80s));
    #endif
        }
-        constexpr IndexType Start = NumChunks * SimdWidth;
+      } else {
 #elif defined(USE_NEON)
        constexpr IndexType NumChunks = InputDimensions / (SimdWidth / 2);
-        const int8x8_t      Zero      = {0};
+        const __m128i Zero = _mm_setzero_si128();
-        const auto          in        = reinterpret_cast<const int32x4_t*>(input);
+        const auto in = reinterpret_cast<const __m128i*>(input);
-        const auto          out       = reinterpret_cast<int8x8_t*>(output);
+        const auto out = reinterpret_cast<__m128i*>(output);
-        for (IndexType i = 0; i < NumChunks; ++i)
+        for (IndexType i = 0; i < NumChunks; ++i) {
-        {
+          const __m128i words0 = _mm_srai_epi16(_mm_packs_epi32(
-            int16x8_t  shifted;
+              _mm_load_si128(&in[i * 4 + 0]),
-            const auto pack = reinterpret_cast<int16x4_t*>(&shifted);
+              _mm_load_si128(&in[i * 4 + 1])), WeightScaleBits);
-            pack[0]         = vqshrn_n_s32(in[i * 2 + 0], WeightScaleBits);
+          const __m128i words1 = _mm_srai_epi16(_mm_packs_epi32(
-            pack[1]         = vqshrn_n_s32(in[i * 2 + 1], WeightScaleBits);
+              _mm_load_si128(&in[i * 4 + 2]),
-            out[i]          = vmax_s8(vqmovn_s16(shifted), Zero);
+              _mm_load_si128(&in[i * 4 + 3])), WeightScaleBits);
          const __m128i packedbytes = _mm_packs_epi16(words0, words1);
          _mm_store_si128(&out[i], _mm_max_epi8(packedbytes, Zero));
        }
-        constexpr IndexType Start = NumChunks * (SimdWidth / 2);
+      }
-#else
+      constexpr IndexType Start =
-        constexpr IndexType Start = 0;
+        InputDimensions % SimdWidth == 0
-#endif
+        ? InputDimensions / SimdWidth * SimdWidth
        : InputDimensions / (SimdWidth / 2) * (SimdWidth / 2);
-        for (IndexType i = Start; i < InputDimensions; ++i)
+  #elif defined(USE_SSE2)
-        {
+      constexpr IndexType NumChunks = InputDimensions / SimdWidth;
-            output[i] = static_cast<OutputType>(std::clamp(input[i] >> WeightScaleBits, 0, 127));
+
-        }
+  #ifdef USE_SSE41
      const __m128i Zero = _mm_setzero_si128();
  #else
      const __m128i k0x80s = _mm_set1_epi8(-128);
  #endif
      const auto in = reinterpret_cast<const __m128i*>(input);
      const auto out = reinterpret_cast<__m128i*>(output);
      for (IndexType i = 0; i < NumChunks; ++i) {
        const __m128i words0 = _mm_srai_epi16(_mm_packs_epi32(
            _mm_load_si128(&in[i * 4 + 0]),
            _mm_load_si128(&in[i * 4 + 1])), WeightScaleBits);
        const __m128i words1 = _mm_srai_epi16(_mm_packs_epi32(
            _mm_load_si128(&in[i * 4 + 2]),
            _mm_load_si128(&in[i * 4 + 3])), WeightScaleBits);
        const __m128i packedbytes = _mm_packs_epi16(words0, words1);
        _mm_store_si128(&out[i],
  #ifdef USE_SSE41
          _mm_max_epi8(packedbytes, Zero)
  #else
          _mm_subs_epi8(_mm_adds_epi8(packedbytes, k0x80s), k0x80s)
  #endif
        );
      }
      constexpr IndexType Start = NumChunks * SimdWidth;
  #elif defined(USE_MMX)
      constexpr IndexType NumChunks = InputDimensions / SimdWidth;
      const __m64 k0x80s = _mm_set1_pi8(-128);
      const auto in = reinterpret_cast<const __m64*>(input);
      const auto out = reinterpret_cast<__m64*>(output);
      for (IndexType i = 0; i < NumChunks; ++i) {
        const __m64 words0 = _mm_srai_pi16(
            _mm_packs_pi32(in[i * 4 + 0], in[i * 4 + 1]),
            WeightScaleBits);
        const __m64 words1 = _mm_srai_pi16(
            _mm_packs_pi32(in[i * 4 + 2], in[i * 4 + 3]),
            WeightScaleBits);
        const __m64 packedbytes = _mm_packs_pi16(words0, words1);
        out[i] = _mm_subs_pi8(_mm_adds_pi8(packedbytes, k0x80s), k0x80s);
      }
      _mm_empty();
      constexpr IndexType Start = NumChunks * SimdWidth;
  #elif defined(USE_NEON)
      constexpr IndexType NumChunks = InputDimensions / (SimdWidth / 2);
      const int8x8_t Zero = {0};
      const auto in = reinterpret_cast<const int32x4_t*>(input);
      const auto out = reinterpret_cast<int8x8_t*>(output);
      for (IndexType i = 0; i < NumChunks; ++i) {
        int16x8_t shifted;
        const auto pack = reinterpret_cast<int16x4_t*>(&shifted);
        pack[0] = vqshrn_n_s32(in[i * 2 + 0], WeightScaleBits);
        pack[1] = vqshrn_n_s32(in[i * 2 + 1], WeightScaleBits);
        out[i] = vmax_s8(vqmovn_s16(shifted), Zero);
      }
      constexpr IndexType Start = NumChunks * (SimdWidth / 2);
  #else
      constexpr IndexType Start = 0;
  #endif
      for (IndexType i = Start; i < InputDimensions; ++i) {
        output[i] = static_cast<OutputType>(
            std::max(0, std::min(127, input[i] >> WeightScaleBits)));
      }
      return output;
    }
-};
+  };
 }  // namespace Stockfish::Eval::NNUE::Layers
-#endif  // NNUE_LAYERS_CLIPPED_RELU_H_INCLUDED
+#endif // NNUE_LAYERS_CLIPPED_RELU_H_INCLUDED
@@ -1,134 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef STOCKFISH_SIMD_H_INCLUDED
 #define STOCKFISH_SIMD_H_INCLUDED
 #if defined(USE_AVX2)
    #include <immintrin.h>
 #elif defined(USE_SSE41)
    #include <smmintrin.h>
 #elif defined(USE_SSSE3)
    #include <tmmintrin.h>
 #elif defined(USE_SSE2)
    #include <emmintrin.h>
 #elif defined(USE_NEON)
    #include <arm_neon.h>
 #endif
 namespace Stockfish::Simd {
 #if defined(USE_AVX512)
 [[maybe_unused]] static int m512_hadd(__m512i sum, int bias) {
    return _mm512_reduce_add_epi32(sum) + bias;
 }
 [[maybe_unused]] static void m512_add_dpbusd_epi32(__m512i& acc, __m512i a, __m512i b) {
    #if defined(USE_VNNI)
    acc = _mm512_dpbusd_epi32(acc, a, b);
    #else
    __m512i product0 = _mm512_maddubs_epi16(a, b);
    product0         = _mm512_madd_epi16(product0, _mm512_set1_epi16(1));
    acc              = _mm512_add_epi32(acc, product0);
    #endif
 }
 #endif
 #if defined(USE_AVX2)
 [[maybe_unused]] static int m256_hadd(__m256i sum, int bias) {
    __m128i sum128 = _mm_add_epi32(_mm256_castsi256_si128(sum), _mm256_extracti128_si256(sum, 1));
    sum128         = _mm_add_epi32(sum128, _mm_shuffle_epi32(sum128, _MM_PERM_BADC));
    sum128         = _mm_add_epi32(sum128, _mm_shuffle_epi32(sum128, _MM_PERM_CDAB));
    return _mm_cvtsi128_si32(sum128) + bias;
 }
 [[maybe_unused]] static void m256_add_dpbusd_epi32(__m256i& acc, __m256i a, __m256i b) {
    #if defined(USE_VNNI)
    acc = _mm256_dpbusd_epi32(acc, a, b);
    #else
    __m256i product0 = _mm256_maddubs_epi16(a, b);
    product0         = _mm256_madd_epi16(product0, _mm256_set1_epi16(1));
    acc              = _mm256_add_epi32(acc, product0);
    #endif
 }
 #endif
 #if defined(USE_SSSE3)
 [[maybe_unused]] static int m128_hadd(__m128i sum, int bias) {
    sum = _mm_add_epi32(sum, _mm_shuffle_epi32(sum, 0x4E));  //_MM_PERM_BADC
    sum = _mm_add_epi32(sum, _mm_shuffle_epi32(sum, 0xB1));  //_MM_PERM_CDAB
    return _mm_cvtsi128_si32(sum) + bias;
 }
 [[maybe_unused]] static void m128_add_dpbusd_epi32(__m128i& acc, __m128i a, __m128i b) {
    __m128i product0 = _mm_maddubs_epi16(a, b);
    product0         = _mm_madd_epi16(product0, _mm_set1_epi16(1));
    acc              = _mm_add_epi32(acc, product0);
 }
 #endif
 #if defined(USE_NEON_DOTPROD)
 [[maybe_unused]] static void
 dotprod_m128_add_dpbusd_epi32(int32x4_t& acc, int8x16_t a, int8x16_t b) {
    acc = vdotq_s32(acc, a, b);
 }
 #endif
 #if defined(USE_NEON)
 [[maybe_unused]] static int neon_m128_reduce_add_epi32(int32x4_t s) {
    #if USE_NEON >= 8
    return vaddvq_s32(s);
    #else
    return s[0] + s[1] + s[2] + s[3];
    #endif
 }
 [[maybe_unused]] static int neon_m128_hadd(int32x4_t sum, int bias) {
    return neon_m128_reduce_add_epi32(sum) + bias;
 }
 #endif
 #if USE_NEON >= 8
 [[maybe_unused]] static void neon_m128_add_dpbusd_epi32(int32x4_t& acc, int8x16_t a, int8x16_t b) {
    int16x8_t product0 = vmull_s8(vget_low_s8(a), vget_low_s8(b));
    int16x8_t product1 = vmull_high_s8(a, b);
    int16x8_t sum      = vpaddq_s16(product0, product1);
    acc                = vpadalq_s16(acc, sum);
 }
 #endif
 }
 #endif  // STOCKFISH_SIMD_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,83 +21,100 @@
 #ifndef NNUE_LAYERS_SQR_CLIPPED_RELU_H_INCLUDED
 #define NNUE_LAYERS_SQR_CLIPPED_RELU_H_INCLUDED
 #include <algorithm>
 #include <cstdint>
 #include <iosfwd>
 #include "../nnue_common.h"
 namespace Stockfish::Eval::NNUE::Layers {
-// Clipped ReLU
+  // Clipped ReLU
-template<IndexType InDims>
+  template <IndexType InDims>
-class SqrClippedReLU {
+  class SqrClippedReLU {
   public:
    // Input/output type
-    using InputType  = std::int32_t;
+    using InputType = std::int32_t;
    using OutputType = std::uint8_t;
    // Number of input/output dimensions
-    static constexpr IndexType InputDimensions  = InDims;
+    static constexpr IndexType InputDimensions = InDims;
    static constexpr IndexType OutputDimensions = InputDimensions;
    static constexpr IndexType PaddedOutputDimensions =
-      ceil_to_multiple<IndexType>(OutputDimensions, 32);
+        ceil_to_multiple<IndexType>(OutputDimensions, 32);
    using OutputBuffer = OutputType[PaddedOutputDimensions];
    // Hash value embedded in the evaluation file
    static constexpr std::uint32_t get_hash_value(std::uint32_t prevHash) {
-        std::uint32_t hashValue = 0x538D24C7u;
+      std::uint32_t hashValue = 0x538D24C7u;
-        hashValue += prevHash;
+      hashValue += prevHash;
-        return hashValue;
+      return hashValue;
    }
    // Read network parameters
-    bool read_parameters(std::istream&) { return true; }
+    bool read_parameters(std::istream&) {
      return true;
    }
    // Write network parameters
-    bool write_parameters(std::ostream&) const { return true; }
+    bool write_parameters(std::ostream&) const {
      return true;
    }
    // Forward propagation
-    void propagate(const InputType* input, OutputType* output) const {
+    const OutputType* propagate(
        const InputType* input, OutputType* output) const {
-#if defined(USE_SSE2)
+  #if defined(USE_SSE2)
-        constexpr IndexType NumChunks = InputDimensions / 16;
+      constexpr IndexType NumChunks = InputDimensions / 16;
-        static_assert(WeightScaleBits == 6);
+  #ifdef USE_SSE41
-        const auto in  = reinterpret_cast<const __m128i*>(input);
+      const __m128i Zero = _mm_setzero_si128();
-        const auto out = reinterpret_cast<__m128i*>(output);
+  #else
-        for (IndexType i = 0; i < NumChunks; ++i)
+      const __m128i k0x80s = _mm_set1_epi8(-128);
-        {
+  #endif
            __m128i words0 =
              _mm_packs_epi32(_mm_load_si128(&in[i * 4 + 0]), _mm_load_si128(&in[i * 4 + 1]));
            __m128i words1 =
              _mm_packs_epi32(_mm_load_si128(&in[i * 4 + 2]), _mm_load_si128(&in[i * 4 + 3]));
-            // We shift by WeightScaleBits * 2 = 12 and divide by 128
+      static_assert(WeightScaleBits == 6);
-            // which is an additional shift-right of 7, meaning 19 in total.
+      const auto in = reinterpret_cast<const __m128i*>(input);
-            // MulHi strips the lower 16 bits so we need to shift out 3 more to match.
+      const auto out = reinterpret_cast<__m128i*>(output);
-            words0 = _mm_srli_epi16(_mm_mulhi_epi16(words0, words0), 3);
+      for (IndexType i = 0; i < NumChunks; ++i) {
-            words1 = _mm_srli_epi16(_mm_mulhi_epi16(words1, words1), 3);
+        __m128i words0 = _mm_packs_epi32(
            _mm_load_si128(&in[i * 4 + 0]),
            _mm_load_si128(&in[i * 4 + 1]));
        __m128i words1 = _mm_packs_epi32(
            _mm_load_si128(&in[i * 4 + 2]),
            _mm_load_si128(&in[i * 4 + 3]));
-            _mm_store_si128(&out[i], _mm_packs_epi16(words0, words1));
+        // Not sure if
-        }
+        words0 = _mm_srli_epi16(_mm_mulhi_epi16(words0, words0), 3);
-        constexpr IndexType Start = NumChunks * 16;
+        words1 = _mm_srli_epi16(_mm_mulhi_epi16(words1, words1), 3);
-#else
+        const __m128i packedbytes = _mm_packs_epi16(words0, words1);
        constexpr IndexType Start = 0;
 #endif
-        for (IndexType i = Start; i < InputDimensions; ++i)
+        _mm_store_si128(&out[i],
-        {
+
-            output[i] = static_cast<OutputType>(
+  #ifdef USE_SSE41
-              // Really should be /127 but we need to make it fast so we right-shift
+          _mm_max_epi8(packedbytes, Zero)
-              // by an extra 7 bits instead. Needs to be accounted for in the trainer.
+  #else
-              std::min(127ll, ((long long) (input[i]) * input[i]) >> (2 * WeightScaleBits + 7)));
+          _mm_subs_epi8(_mm_adds_epi8(packedbytes, k0x80s), k0x80s)
-        }
+  #endif
        );
      }
      constexpr IndexType Start = NumChunks * 16;
  #else
      constexpr IndexType Start = 0;
  #endif
      for (IndexType i = Start; i < InputDimensions; ++i) {
        output[i] = static_cast<OutputType>(
            // realy should be /127 but we need to make it fast
            // needs to be accounted for in the trainer
            std::max(0ll, std::min(127ll, (((long long)input[i] * input[i]) >> (2 * WeightScaleBits)) / 128)));
      }
      return output;
    }
-};
+  };
 }  // namespace Stockfish::Eval::NNUE::Layers
-#endif  // NNUE_LAYERS_SQR_CLIPPED_RELU_H_INCLUDED
+#endif // NNUE_LAYERS_SQR_CLIPPED_RELU_H_INCLUDED
@@ -1,467 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "network.h"
 #include <cstdlib>
 #include <fstream>
 #include <iostream>
 #include <memory>
 #include <optional>
 #include <type_traits>
 #include <vector>
 #define INCBIN_SILENCE_BITCODE_WARNING
 #include "../incbin/incbin.h"
 #include "../evaluate.h"
 #include "../memory.h"
 #include "../misc.h"
 #include "../position.h"
 #include "../types.h"
 #include "nnue_architecture.h"
 #include "nnue_common.h"
 #include "nnue_misc.h"
 // Macro to embed the default efficiently updatable neural network (NNUE) file
 // data in the engine binary (using incbin.h, by Dale Weiler).
 // This macro invocation will declare the following three variables
 //     const unsigned char        gEmbeddedNNUEData[];  // a pointer to the embedded data
 //     const unsigned char *const gEmbeddedNNUEEnd;     // a marker to the end
 //     const unsigned int         gEmbeddedNNUESize;    // the size of the embedded file
 // Note that this does not work in Microsoft Visual Studio.
 #if !defined(_MSC_VER) && !defined(NNUE_EMBEDDING_OFF)
 INCBIN(EmbeddedNNUEBig, EvalFileDefaultNameBig);
 INCBIN(EmbeddedNNUESmall, EvalFileDefaultNameSmall);
 #else
 const unsigned char        gEmbeddedNNUEBigData[1]   = {0x0};
 const unsigned char* const gEmbeddedNNUEBigEnd       = &gEmbeddedNNUEBigData[1];
 const unsigned int         gEmbeddedNNUEBigSize      = 1;
 const unsigned char        gEmbeddedNNUESmallData[1] = {0x0};
 const unsigned char* const gEmbeddedNNUESmallEnd     = &gEmbeddedNNUESmallData[1];
 const unsigned int         gEmbeddedNNUESmallSize    = 1;
 #endif
 namespace {
 struct EmbeddedNNUE {
    EmbeddedNNUE(const unsigned char* embeddedData,
                 const unsigned char* embeddedEnd,
                 const unsigned int   embeddedSize) :
        data(embeddedData),
        end(embeddedEnd),
        size(embeddedSize) {}
    const unsigned char* data;
    const unsigned char* end;
    const unsigned int   size;
 };
 using namespace Stockfish::Eval::NNUE;
 EmbeddedNNUE get_embedded(EmbeddedNNUEType type) {
    if (type == EmbeddedNNUEType::BIG)
        return EmbeddedNNUE(gEmbeddedNNUEBigData, gEmbeddedNNUEBigEnd, gEmbeddedNNUEBigSize);
    else
        return EmbeddedNNUE(gEmbeddedNNUESmallData, gEmbeddedNNUESmallEnd, gEmbeddedNNUESmallSize);
 }
 }
 namespace Stockfish::Eval::NNUE {
 namespace Detail {
 // Read evaluation function parameters
 template<typename T>
 bool read_parameters(std::istream& stream, T& reference) {
    std::uint32_t header;
    header = read_little_endian<std::uint32_t>(stream);
    if (!stream || header != T::get_hash_value())
        return false;
    return reference.read_parameters(stream);
 }
 // Write evaluation function parameters
 template<typename T>
 bool write_parameters(std::ostream& stream, T& reference) {
    write_little_endian<std::uint32_t>(stream, T::get_hash_value());
    return reference.write_parameters(stream);
 }
 }  // namespace Detail
 template<typename Arch, typename Transformer>
 Network<Arch, Transformer>::Network(const Network<Arch, Transformer>& other) :
    evalFile(other.evalFile),
    embeddedType(other.embeddedType) {
    if (other.featureTransformer)
        featureTransformer = make_unique_large_page<Transformer>(*other.featureTransformer);
    network = make_unique_aligned<Arch[]>(LayerStacks);
    if (!other.network)
        return;
    for (std::size_t i = 0; i < LayerStacks; ++i)
        network[i] = other.network[i];
 }
 template<typename Arch, typename Transformer>
 Network<Arch, Transformer>&
 Network<Arch, Transformer>::operator=(const Network<Arch, Transformer>& other) {
    evalFile     = other.evalFile;
    embeddedType = other.embeddedType;
    if (other.featureTransformer)
        featureTransformer = make_unique_large_page<Transformer>(*other.featureTransformer);
    network = make_unique_aligned<Arch[]>(LayerStacks);
    if (!other.network)
        return *this;
    for (std::size_t i = 0; i < LayerStacks; ++i)
        network[i] = other.network[i];
    return *this;
 }
 template<typename Arch, typename Transformer>
 void Network<Arch, Transformer>::load(const std::string& rootDirectory, std::string evalfilePath) {
 #if defined(DEFAULT_NNUE_DIRECTORY)
    std::vector<std::string> dirs = {"<internal>", "", rootDirectory,
                                     stringify(DEFAULT_NNUE_DIRECTORY)};
 #else
    std::vector<std::string> dirs = {"<internal>", "", rootDirectory};
 #endif
    if (evalfilePath.empty())
        evalfilePath = evalFile.defaultName;
    for (const auto& directory : dirs)
    {
        if (evalFile.current != evalfilePath)
        {
            if (directory != "<internal>")
            {
                load_user_net(directory, evalfilePath);
            }
            if (directory == "<internal>" && evalfilePath == evalFile.defaultName)
            {
                load_internal();
            }
        }
    }
 }
 template<typename Arch, typename Transformer>
 bool Network<Arch, Transformer>::save(const std::optional<std::string>& filename) const {
    std::string actualFilename;
    std::string msg;
    if (filename.has_value())
        actualFilename = filename.value();
    else
    {
        if (evalFile.current != evalFile.defaultName)
        {
            msg = "Failed to export a net. "
                  "A non-embedded net can only be saved if the filename is specified";
            sync_cout << msg << sync_endl;
            return false;
        }
        actualFilename = evalFile.defaultName;
    }
    std::ofstream stream(actualFilename, std::ios_base::binary);
    bool          saved = save(stream, evalFile.current, evalFile.netDescription);
    msg = saved ? "Network saved successfully to " + actualFilename : "Failed to export a net";
    sync_cout << msg << sync_endl;
    return saved;
 }
 template<typename Arch, typename Transformer>
 NetworkOutput
 Network<Arch, Transformer>::evaluate(const Position&                         pos,
                                     AccumulatorCaches::Cache<FTDimensions>* cache) const {
    // We manually align the arrays on the stack because with gcc < 9.3
    // overaligning stack variables with alignas() doesn't work correctly.
    constexpr uint64_t alignment = CacheLineSize;
 #if defined(ALIGNAS_ON_STACK_VARIABLES_BROKEN)
    TransformedFeatureType
      transformedFeaturesUnaligned[FeatureTransformer<FTDimensions, nullptr>::BufferSize
                                   + alignment / sizeof(TransformedFeatureType)];
    auto* transformedFeatures = align_ptr_up<alignment>(&transformedFeaturesUnaligned[0]);
 #else
    alignas(alignment) TransformedFeatureType
      transformedFeatures[FeatureTransformer<FTDimensions, nullptr>::BufferSize];
 #endif
    ASSERT_ALIGNED(transformedFeatures, alignment);
    const int  bucket     = (pos.count<ALL_PIECES>() - 1) / 4;
    const auto psqt       = featureTransformer->transform(pos, cache, transformedFeatures, bucket);
    const auto positional = network[bucket].propagate(transformedFeatures);
    return {static_cast<Value>(psqt / OutputScale), static_cast<Value>(positional / OutputScale)};
 }
 template<typename Arch, typename Transformer>
 void Network<Arch, Transformer>::verify(std::string                                  evalfilePath,
                                        const std::function<void(std::string_view)>& f) const {
    if (evalfilePath.empty())
        evalfilePath = evalFile.defaultName;
    if (evalFile.current != evalfilePath)
    {
        if (f)
        {
            std::string msg1 =
              "Network evaluation parameters compatible with the engine must be available.";
            std::string msg2 = "The network file " + evalfilePath + " was not loaded successfully.";
            std::string msg3 = "The UCI option EvalFile might need to specify the full path, "
                               "including the directory name, to the network file.";
            std::string msg4 = "The default net can be downloaded from: "
                               "https://tests.stockfishchess.org/api/nn/"
                             + evalFile.defaultName;
            std::string msg5 = "The engine will be terminated now.";
            std::string msg = "ERROR: " + msg1 + '\n' + "ERROR: " + msg2 + '\n' + "ERROR: " + msg3
                            + '\n' + "ERROR: " + msg4 + '\n' + "ERROR: " + msg5 + '\n';
            f(msg);
        }
        exit(EXIT_FAILURE);
    }
    if (f)
    {
        size_t size = sizeof(*featureTransformer) + sizeof(Arch) * LayerStacks;
        f("info string NNUE evaluation using " + evalfilePath + " ("
          + std::to_string(size / (1024 * 1024)) + "MiB, ("
          + std::to_string(featureTransformer->InputDimensions) + ", "
          + std::to_string(network[0].TransformedFeatureDimensions) + ", "
          + std::to_string(network[0].FC_0_OUTPUTS) + ", " + std::to_string(network[0].FC_1_OUTPUTS)
          + ", 1))");
    }
 }
 template<typename Arch, typename Transformer>
 void Network<Arch, Transformer>::hint_common_access(
  const Position& pos, AccumulatorCaches::Cache<FTDimensions>* cache) const {
    featureTransformer->hint_common_access(pos, cache);
 }
 template<typename Arch, typename Transformer>
 NnueEvalTrace
 Network<Arch, Transformer>::trace_evaluate(const Position&                         pos,
                                           AccumulatorCaches::Cache<FTDimensions>* cache) const {
    // We manually align the arrays on the stack because with gcc < 9.3
    // overaligning stack variables with alignas() doesn't work correctly.
    constexpr uint64_t alignment = CacheLineSize;
 #if defined(ALIGNAS_ON_STACK_VARIABLES_BROKEN)
    TransformedFeatureType
      transformedFeaturesUnaligned[FeatureTransformer<FTDimensions, nullptr>::BufferSize
                                   + alignment / sizeof(TransformedFeatureType)];
    auto* transformedFeatures = align_ptr_up<alignment>(&transformedFeaturesUnaligned[0]);
 #else
    alignas(alignment) TransformedFeatureType
      transformedFeatures[FeatureTransformer<FTDimensions, nullptr>::BufferSize];
 #endif
    ASSERT_ALIGNED(transformedFeatures, alignment);
    NnueEvalTrace t{};
    t.correctBucket = (pos.count<ALL_PIECES>() - 1) / 4;
    for (IndexType bucket = 0; bucket < LayerStacks; ++bucket)
    {
        const auto materialist =
          featureTransformer->transform(pos, cache, transformedFeatures, bucket);
        const auto positional = network[bucket].propagate(transformedFeatures);
        t.psqt[bucket]       = static_cast<Value>(materialist / OutputScale);
        t.positional[bucket] = static_cast<Value>(positional / OutputScale);
    }
    return t;
 }
 template<typename Arch, typename Transformer>
 void Network<Arch, Transformer>::load_user_net(const std::string& dir,
                                               const std::string& evalfilePath) {
    std::ifstream stream(dir + evalfilePath, std::ios::binary);
    auto          description = load(stream);
    if (description.has_value())
    {
        evalFile.current        = evalfilePath;
        evalFile.netDescription = description.value();
    }
 }
 template<typename Arch, typename Transformer>
 void Network<Arch, Transformer>::load_internal() {
    // C++ way to prepare a buffer for a memory stream
    class MemoryBuffer: public std::basic_streambuf<char> {
       public:
        MemoryBuffer(char* p, size_t n) {
            setg(p, p, p + n);
            setp(p, p + n);
        }
    };
    const auto embedded = get_embedded(embeddedType);
    MemoryBuffer buffer(const_cast<char*>(reinterpret_cast<const char*>(embedded.data)),
                        size_t(embedded.size));
    std::istream stream(&buffer);
    auto         description = load(stream);
    if (description.has_value())
    {
        evalFile.current        = evalFile.defaultName;
        evalFile.netDescription = description.value();
    }
 }
 template<typename Arch, typename Transformer>
 void Network<Arch, Transformer>::initialize() {
    featureTransformer = make_unique_large_page<Transformer>();
    network            = make_unique_aligned<Arch[]>(LayerStacks);
 }
 template<typename Arch, typename Transformer>
 bool Network<Arch, Transformer>::save(std::ostream&      stream,
                                      const std::string& name,
                                      const std::string& netDescription) const {
    if (name.empty() || name == "None")
        return false;
    return write_parameters(stream, netDescription);
 }
 template<typename Arch, typename Transformer>
 std::optional<std::string> Network<Arch, Transformer>::load(std::istream& stream) {
    initialize();
    std::string description;
    return read_parameters(stream, description) ? std::make_optional(description) : std::nullopt;
 }
 // Read network header
 template<typename Arch, typename Transformer>
 bool Network<Arch, Transformer>::read_header(std::istream&  stream,
                                             std::uint32_t* hashValue,
                                             std::string*   desc) const {
    std::uint32_t version, size;
    version    = read_little_endian<std::uint32_t>(stream);
    *hashValue = read_little_endian<std::uint32_t>(stream);
    size       = read_little_endian<std::uint32_t>(stream);
    if (!stream || version != Version)
        return false;
    desc->resize(size);
    stream.read(&(*desc)[0], size);
    return !stream.fail();
 }
 // Write network header
 template<typename Arch, typename Transformer>
 bool Network<Arch, Transformer>::write_header(std::ostream&      stream,
                                              std::uint32_t      hashValue,
                                              const std::string& desc) const {
    write_little_endian<std::uint32_t>(stream, Version);
    write_little_endian<std::uint32_t>(stream, hashValue);
    write_little_endian<std::uint32_t>(stream, std::uint32_t(desc.size()));
    stream.write(&desc[0], desc.size());
    return !stream.fail();
 }
 template<typename Arch, typename Transformer>
 bool Network<Arch, Transformer>::read_parameters(std::istream& stream,
                                                 std::string&  netDescription) const {
    std::uint32_t hashValue;
    if (!read_header(stream, &hashValue, &netDescription))
        return false;
    if (hashValue != Network::hash)
        return false;
    if (!Detail::read_parameters(stream, *featureTransformer))
        return false;
    for (std::size_t i = 0; i < LayerStacks; ++i)
    {
        if (!Detail::read_parameters(stream, network[i]))
            return false;
    }
    return stream && stream.peek() == std::ios::traits_type::eof();
 }
 template<typename Arch, typename Transformer>
 bool Network<Arch, Transformer>::write_parameters(std::ostream&      stream,
                                                  const std::string& netDescription) const {
    if (!write_header(stream, Network::hash, netDescription))
        return false;
    if (!Detail::write_parameters(stream, *featureTransformer))
        return false;
    for (std::size_t i = 0; i < LayerStacks; ++i)
    {
        if (!Detail::write_parameters(stream, network[i]))
            return false;
    }
    return bool(stream);
 }
 // Explicit template instantiation
 template class Network<
  NetworkArchitecture<TransformedFeatureDimensionsBig, L2Big, L3Big>,
  FeatureTransformer<TransformedFeatureDimensionsBig, &StateInfo::accumulatorBig>>;
 template class Network<
  NetworkArchitecture<TransformedFeatureDimensionsSmall, L2Small, L3Small>,
  FeatureTransformer<TransformedFeatureDimensionsSmall, &StateInfo::accumulatorSmall>>;
 }  // namespace Stockfish::Eval::NNUE
@@ -1,134 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef NETWORK_H_INCLUDED
 #define NETWORK_H_INCLUDED
 #include <cstdint>
 #include <functional>
 #include <iostream>
 #include <optional>
 #include <string>
 #include <string_view>
 #include <tuple>
 #include <utility>
 #include "../memory.h"
 #include "../position.h"
 #include "../types.h"
 #include "nnue_accumulator.h"
 #include "nnue_architecture.h"
 #include "nnue_feature_transformer.h"
 #include "nnue_misc.h"
 namespace Stockfish::Eval::NNUE {
 enum class EmbeddedNNUEType {
    BIG,
    SMALL,
 };
 using NetworkOutput = std::tuple<Value, Value>;
 template<typename Arch, typename Transformer>
 class Network {
    static constexpr IndexType FTDimensions = Arch::TransformedFeatureDimensions;
   public:
    Network(EvalFile file, EmbeddedNNUEType type) :
        evalFile(file),
        embeddedType(type) {}
    Network(const Network& other);
    Network(Network&& other) = default;
    Network& operator=(const Network& other);
    Network& operator=(Network&& other) = default;
    void load(const std::string& rootDirectory, std::string evalfilePath);
    bool save(const std::optional<std::string>& filename) const;
    NetworkOutput evaluate(const Position&                         pos,
                           AccumulatorCaches::Cache<FTDimensions>* cache) const;
    void hint_common_access(const Position&                         pos,
                            AccumulatorCaches::Cache<FTDimensions>* cache) const;
    void verify(std::string evalfilePath, const std::function<void(std::string_view)>&) const;
    NnueEvalTrace trace_evaluate(const Position&                         pos,
                                 AccumulatorCaches::Cache<FTDimensions>* cache) const;
   private:
    void load_user_net(const std::string&, const std::string&);
    void load_internal();
    void initialize();
    bool                       save(std::ostream&, const std::string&, const std::string&) const;
    std::optional<std::string> load(std::istream&);
    bool read_header(std::istream&, std::uint32_t*, std::string*) const;
    bool write_header(std::ostream&, std::uint32_t, const std::string&) const;
    bool read_parameters(std::istream&, std::string&) const;
    bool write_parameters(std::ostream&, const std::string&) const;
    // Input feature converter
    LargePagePtr<Transformer> featureTransformer;
    // Evaluation function
    AlignedPtr<Arch[]> network;
    EvalFile         evalFile;
    EmbeddedNNUEType embeddedType;
    // Hash value of evaluation function structure
    static constexpr std::uint32_t hash = Transformer::get_hash_value() ^ Arch::get_hash_value();
    template<IndexType Size>
    friend struct AccumulatorCaches::Cache;
 };
 // Definitions of the network types
 using SmallFeatureTransformer =
  FeatureTransformer<TransformedFeatureDimensionsSmall, &StateInfo::accumulatorSmall>;
 using SmallNetworkArchitecture =
  NetworkArchitecture<TransformedFeatureDimensionsSmall, L2Small, L3Small>;
 using BigFeatureTransformer =
  FeatureTransformer<TransformedFeatureDimensionsBig, &StateInfo::accumulatorBig>;
 using BigNetworkArchitecture = NetworkArchitecture<TransformedFeatureDimensionsBig, L2Big, L3Big>;
 using NetworkBig   = Network<BigNetworkArchitecture, BigFeatureTransformer>;
 using NetworkSmall = Network<SmallNetworkArchitecture, SmallFeatureTransformer>;
 struct Networks {
    Networks(NetworkBig&& nB, NetworkSmall&& nS) :
        big(std::move(nB)),
        small(std::move(nS)) {}
    NetworkBig   big;
    NetworkSmall small;
 };
 }  // namespace Stockfish
 #endif
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,80 +21,17 @@
 #ifndef NNUE_ACCUMULATOR_H_INCLUDED
 #define NNUE_ACCUMULATOR_H_INCLUDED
 #include <cstdint>
 #include "nnue_architecture.h"
 #include "nnue_common.h"
 namespace Stockfish::Eval::NNUE {
-using BiasType       = std::int16_t;
+  // Class that holds the result of affine transformation of input features
-using PSQTWeightType = std::int32_t;
+  struct alignas(CacheLineSize) Accumulator {
-using IndexType      = std::uint32_t;
+    std::int16_t accumulation[2][TransformedFeatureDimensions];
-
+    std::int32_t psqtAccumulation[2][PSQTBuckets];
-// Class that holds the result of affine transformation of input features
+    bool computed[2];
-template<IndexType Size>
+  };
 struct alignas(CacheLineSize) Accumulator {
    std::int16_t accumulation[COLOR_NB][Size];
    std::int32_t psqtAccumulation[COLOR_NB][PSQTBuckets];
    bool         computed[COLOR_NB];
 };
 // AccumulatorCaches struct provides per-thread accumulator caches, where each
 // cache contains multiple entries for each of the possible king squares.
 // When the accumulator needs to be refreshed, the cached entry is used to more
 // efficiently update the accumulator, instead of rebuilding it from scratch.
 // This idea, was first described by Luecx (author of Koivisto) and
 // is commonly referred to as "Finny Tables".
 struct AccumulatorCaches {
    template<typename Networks>
    AccumulatorCaches(const Networks& networks) {
        clear(networks);
    }
    template<IndexType Size>
    struct alignas(CacheLineSize) Cache {
        struct alignas(CacheLineSize) Entry {
            BiasType       accumulation[Size];
            PSQTWeightType psqtAccumulation[PSQTBuckets];
            Bitboard       byColorBB[COLOR_NB];
            Bitboard       byTypeBB[PIECE_TYPE_NB];
            // To initialize a refresh entry, we set all its bitboards empty,
            // so we put the biases in the accumulation, without any weights on top
            void clear(const BiasType* biases) {
                std::memcpy(accumulation, biases, sizeof(accumulation));
                std::memset((uint8_t*) this + offsetof(Entry, psqtAccumulation), 0,
                            sizeof(Entry) - offsetof(Entry, psqtAccumulation));
            }
        };
        template<typename Network>
        void clear(const Network& network) {
            for (auto& entries1D : entries)
                for (auto& entry : entries1D)
                    entry.clear(network.featureTransformer->biases);
        }
        std::array<Entry, COLOR_NB>& operator[](Square sq) { return entries[sq]; }
        std::array<std::array<Entry, COLOR_NB>, SQUARE_NB> entries;
    };
    template<typename Networks>
    void clear(const Networks& networks) {
        big.clear(networks.big);
        small.clear(networks.small);
    }
    Cache<TransformedFeatureDimensionsBig>   big;
    Cache<TransformedFeatureDimensionsSmall> small;
 };
 }  // namespace Stockfish::Eval::NNUE
-#endif  // NNUE_ACCUMULATOR_H_INCLUDED
+#endif // NNUE_ACCUMULATOR_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,16 +21,17 @@
 #ifndef NNUE_ARCHITECTURE_H_INCLUDED
 #define NNUE_ARCHITECTURE_H_INCLUDED
-#include <cstdint>
+#include <memory>
-#include <cstring>
+
-#include <iosfwd>
+#include "nnue_common.h"
 #include "features/half_ka_v2_hm.h"
 #include "layers/affine_transform.h"
 #include "layers/affine_transform_sparse_input.h"
 #include "layers/clipped_relu.h"
 #include "layers/sqr_clipped_relu.h"
-#include "nnue_common.h"
+
 #include "../misc.h"
 namespace Stockfish::Eval::NNUE {
@@ -38,100 +39,100 @@ namespace Stockfish::Eval::NNUE {
 using FeatureSet = Features::HalfKAv2_hm;
 // Number of input feature dimensions after conversion
-constexpr IndexType TransformedFeatureDimensionsBig = 3072;
+constexpr IndexType TransformedFeatureDimensions = 1024;
 constexpr int       L2Big                           = 15;
 constexpr int       L3Big                           = 32;
 constexpr IndexType TransformedFeatureDimensionsSmall = 128;
 constexpr int       L2Small                           = 15;
 constexpr int       L3Small                           = 32;
 constexpr IndexType PSQTBuckets = 8;
 constexpr IndexType LayerStacks = 8;
-template<IndexType L1, int L2, int L3>
+struct Network
-struct NetworkArchitecture {
+{
-    static constexpr IndexType TransformedFeatureDimensions = L1;
+  static constexpr int FC_0_OUTPUTS = 15;
-    static constexpr int       FC_0_OUTPUTS                 = L2;
+  static constexpr int FC_1_OUTPUTS = 32;
    static constexpr int       FC_1_OUTPUTS                 = L3;
-    Layers::AffineTransformSparseInput<TransformedFeatureDimensions, FC_0_OUTPUTS + 1> fc_0;
+  Layers::AffineTransform<TransformedFeatureDimensions, FC_0_OUTPUTS + 1> fc_0;
-    Layers::SqrClippedReLU<FC_0_OUTPUTS + 1>                                           ac_sqr_0;
+  Layers::SqrClippedReLU<FC_0_OUTPUTS + 1> ac_sqr_0;
-    Layers::ClippedReLU<FC_0_OUTPUTS + 1>                                              ac_0;
+  Layers::ClippedReLU<FC_0_OUTPUTS + 1> ac_0;
-    Layers::AffineTransform<FC_0_OUTPUTS * 2, FC_1_OUTPUTS>                            fc_1;
+  Layers::AffineTransform<FC_0_OUTPUTS * 2, FC_1_OUTPUTS> fc_1;
-    Layers::ClippedReLU<FC_1_OUTPUTS>                                                  ac_1;
+  Layers::ClippedReLU<FC_1_OUTPUTS> ac_1;
-    Layers::AffineTransform<FC_1_OUTPUTS, 1>                                           fc_2;
+  Layers::AffineTransform<FC_1_OUTPUTS, 1> fc_2;
-    // Hash value embedded in the evaluation file
+  // Hash value embedded in the evaluation file
-    static constexpr std::uint32_t get_hash_value() {
+  static constexpr std::uint32_t get_hash_value() {
-        // input slice hash
+    // input slice hash
-        std::uint32_t hashValue = 0xEC42E90Du;
+    std::uint32_t hashValue = 0xEC42E90Du;
-        hashValue ^= TransformedFeatureDimensions * 2;
+    hashValue ^= TransformedFeatureDimensions * 2;
-        hashValue = decltype(fc_0)::get_hash_value(hashValue);
+    hashValue = decltype(fc_0)::get_hash_value(hashValue);
-        hashValue = decltype(ac_0)::get_hash_value(hashValue);
+    hashValue = decltype(ac_0)::get_hash_value(hashValue);
-        hashValue = decltype(fc_1)::get_hash_value(hashValue);
+    hashValue = decltype(fc_1)::get_hash_value(hashValue);
-        hashValue = decltype(ac_1)::get_hash_value(hashValue);
+    hashValue = decltype(ac_1)::get_hash_value(hashValue);
-        hashValue = decltype(fc_2)::get_hash_value(hashValue);
+    hashValue = decltype(fc_2)::get_hash_value(hashValue);
-        return hashValue;
+    return hashValue;
-    }
+  }
-    // Read network parameters
+  // Read network parameters
-    bool read_parameters(std::istream& stream) {
+  bool read_parameters(std::istream& stream) {
-        return fc_0.read_parameters(stream) && ac_0.read_parameters(stream)
+    if (!fc_0.read_parameters(stream)) return false;
-            && fc_1.read_parameters(stream) && ac_1.read_parameters(stream)
+    if (!ac_0.read_parameters(stream)) return false;
-            && fc_2.read_parameters(stream);
+    if (!fc_1.read_parameters(stream)) return false;
-    }
+    if (!ac_1.read_parameters(stream)) return false;
    if (!fc_2.read_parameters(stream)) return false;
    return true;
  }
-    // Write network parameters
+  // Read network parameters
-    bool write_parameters(std::ostream& stream) const {
+  bool write_parameters(std::ostream& stream) const {
-        return fc_0.write_parameters(stream) && ac_0.write_parameters(stream)
+    if (!fc_0.write_parameters(stream)) return false;
-            && fc_1.write_parameters(stream) && ac_1.write_parameters(stream)
+    if (!ac_0.write_parameters(stream)) return false;
-            && fc_2.write_parameters(stream);
+    if (!fc_1.write_parameters(stream)) return false;
-    }
+    if (!ac_1.write_parameters(stream)) return false;
    if (!fc_2.write_parameters(stream)) return false;
    return true;
  }
-    std::int32_t propagate(const TransformedFeatureType* transformedFeatures) {
+  std::int32_t propagate(const TransformedFeatureType* transformedFeatures)
-        struct alignas(CacheLineSize) Buffer {
+  {
-            alignas(CacheLineSize) typename decltype(fc_0)::OutputBuffer fc_0_out;
+    struct alignas(CacheLineSize) Buffer
-            alignas(CacheLineSize) typename decltype(ac_sqr_0)::OutputType
+    {
-              ac_sqr_0_out[ceil_to_multiple<IndexType>(FC_0_OUTPUTS * 2, 32)];
+      alignas(CacheLineSize) decltype(fc_0)::OutputBuffer fc_0_out;
-            alignas(CacheLineSize) typename decltype(ac_0)::OutputBuffer ac_0_out;
+      alignas(CacheLineSize) decltype(ac_sqr_0)::OutputType ac_sqr_0_out[ceil_to_multiple<IndexType>(FC_0_OUTPUTS * 2, 32)];
-            alignas(CacheLineSize) typename decltype(fc_1)::OutputBuffer fc_1_out;
+      alignas(CacheLineSize) decltype(ac_0)::OutputBuffer ac_0_out;
-            alignas(CacheLineSize) typename decltype(ac_1)::OutputBuffer ac_1_out;
+      alignas(CacheLineSize) decltype(fc_1)::OutputBuffer fc_1_out;
-            alignas(CacheLineSize) typename decltype(fc_2)::OutputBuffer fc_2_out;
+      alignas(CacheLineSize) decltype(ac_1)::OutputBuffer ac_1_out;
      alignas(CacheLineSize) decltype(fc_2)::OutputBuffer fc_2_out;
-            Buffer() { std::memset(this, 0, sizeof(*this)); }
+      Buffer()
-        };
+      {
          std::memset(this, 0, sizeof(*this));
      }
    };
 #if defined(__clang__) && (__APPLE__)
-        // workaround for a bug reported with xcode 12
+    // workaround for a bug reported with xcode 12
-        static thread_local auto tlsBuffer = std::make_unique<Buffer>();
+    static thread_local auto tlsBuffer = std::make_unique<Buffer>();
-        // Access TLS only once, cache result.
+    // Access TLS only once, cache result.
-        Buffer& buffer = *tlsBuffer;
+    Buffer& buffer = *tlsBuffer;
 #else
-        alignas(CacheLineSize) static thread_local Buffer buffer;
+    alignas(CacheLineSize) static thread_local Buffer buffer;
 #endif
-        fc_0.propagate(transformedFeatures, buffer.fc_0_out);
+    fc_0.propagate(transformedFeatures, buffer.fc_0_out);
-        ac_sqr_0.propagate(buffer.fc_0_out, buffer.ac_sqr_0_out);
+    ac_sqr_0.propagate(buffer.fc_0_out, buffer.ac_sqr_0_out);
-        ac_0.propagate(buffer.fc_0_out, buffer.ac_0_out);
+    ac_0.propagate(buffer.fc_0_out, buffer.ac_0_out);
-        std::memcpy(buffer.ac_sqr_0_out + FC_0_OUTPUTS, buffer.ac_0_out,
+    std::memcpy(buffer.ac_sqr_0_out + FC_0_OUTPUTS, buffer.ac_0_out, FC_0_OUTPUTS * sizeof(decltype(ac_0)::OutputType));
-                    FC_0_OUTPUTS * sizeof(typename decltype(ac_0)::OutputType));
+    fc_1.propagate(buffer.ac_sqr_0_out, buffer.fc_1_out);
-        fc_1.propagate(buffer.ac_sqr_0_out, buffer.fc_1_out);
+    ac_1.propagate(buffer.fc_1_out, buffer.ac_1_out);
-        ac_1.propagate(buffer.fc_1_out, buffer.ac_1_out);
+    fc_2.propagate(buffer.ac_1_out, buffer.fc_2_out);
        fc_2.propagate(buffer.ac_1_out, buffer.fc_2_out);
-        // buffer.fc_0_out[FC_0_OUTPUTS] is such that 1.0 is equal to 127*(1<<WeightScaleBits) in
+    // buffer.fc_0_out[FC_0_OUTPUTS] is such that 1.0 is equal to 127*(1<<WeightScaleBits) in quantized form
-        // quantized form, but we want 1.0 to be equal to 600*OutputScale
+    // but we want 1.0 to be equal to 600*OutputScale
-        std::int32_t fwdOut =
+    std::int32_t fwdOut = int(buffer.fc_0_out[FC_0_OUTPUTS]) * (600*OutputScale) / (127*(1<<WeightScaleBits));
-          (buffer.fc_0_out[FC_0_OUTPUTS]) * (600 * OutputScale) / (127 * (1 << WeightScaleBits));
+    std::int32_t outputValue = buffer.fc_2_out[0] + fwdOut;
        std::int32_t outputValue = buffer.fc_2_out[0] + fwdOut;
-        return outputValue;
+    return outputValue;
-    }
+  }
 };
 }  // namespace Stockfish::Eval::NNUE
-#endif  // #ifndef NNUE_ARCHITECTURE_H_INCLUDED
+#endif // #ifndef NNUE_ARCHITECTURE_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,264 +21,146 @@
 #ifndef NNUE_COMMON_H_INCLUDED
 #define NNUE_COMMON_H_INCLUDED
-#include <algorithm>
+#include "../types.h"
-#include <cassert>
+
 #include <cstdint>
 #include <cstring>
 #include <iostream>
 #include <type_traits>
-#include "../misc.h"
+#include "../misc.h"  // for IsLittleEndian
 #if defined(USE_AVX2)
-    #include <immintrin.h>
+#include <immintrin.h>
 #elif defined(USE_SSE41)
-    #include <smmintrin.h>
+#include <smmintrin.h>
 #elif defined(USE_SSSE3)
-    #include <tmmintrin.h>
+#include <tmmintrin.h>
 #elif defined(USE_SSE2)
-    #include <emmintrin.h>
+#include <emmintrin.h>
 #elif defined(USE_MMX)
 #include <mmintrin.h>
 #elif defined(USE_NEON)
-    #include <arm_neon.h>
+#include <arm_neon.h>
 #endif
 namespace Stockfish::Eval::NNUE {
-// Version of the evaluation file
+  // Version of the evaluation file
-constexpr std::uint32_t Version = 0x7AF32F20u;
+  constexpr std::uint32_t Version = 0x7AF32F20u;
-// Constant used in evaluation value calculation
+  // Constant used in evaluation value calculation
-constexpr int OutputScale     = 16;
+  constexpr int OutputScale = 16;
-constexpr int WeightScaleBits = 6;
+  constexpr int WeightScaleBits = 6;
-// Size of cache line (in bytes)
+  // Size of cache line (in bytes)
-constexpr std::size_t CacheLineSize = 64;
+  constexpr std::size_t CacheLineSize = 64;
-constexpr const char        Leb128MagicString[]   = "COMPRESSED_LEB128";
+  // SIMD width (in bytes)
-constexpr const std::size_t Leb128MagicStringSize = sizeof(Leb128MagicString) - 1;
+  #if defined(USE_AVX2)
  constexpr std::size_t SimdWidth = 32;
-// SIMD width (in bytes)
+  #elif defined(USE_SSE2)
-#if defined(USE_AVX2)
+  constexpr std::size_t SimdWidth = 16;
 constexpr std::size_t SimdWidth = 32;
-#elif defined(USE_SSE2)
+  #elif defined(USE_MMX)
-constexpr std::size_t SimdWidth = 16;
+  constexpr std::size_t SimdWidth = 8;
-#elif defined(USE_NEON)
+  #elif defined(USE_NEON)
-constexpr std::size_t SimdWidth = 16;
+  constexpr std::size_t SimdWidth = 16;
-#endif
+  #endif
-constexpr std::size_t MaxSimdWidth = 32;
+  constexpr std::size_t MaxSimdWidth = 32;
-// Type of input feature after conversion
+  // Type of input feature after conversion
-using TransformedFeatureType = std::uint8_t;
+  using TransformedFeatureType = std::uint8_t;
-using IndexType              = std::uint32_t;
+  using IndexType = std::uint32_t;
-// Round n up to be a multiple of base
+  // Round n up to be a multiple of base
-template<typename IntType>
+  template <typename IntType>
-constexpr IntType ceil_to_multiple(IntType n, IntType base) {
+  constexpr IntType ceil_to_multiple(IntType n, IntType base) {
-    return (n + base - 1) / base * base;
+      return (n + base - 1) / base * base;
-}
+  }
  // read_little_endian() is our utility to read an integer (signed or unsigned, any size)
  // from a stream in little-endian order. We swap the byte order after the read if
  // necessary to return a result with the byte ordering of the compiling machine.
  template <typename IntType>
  inline IntType read_little_endian(std::istream& stream) {
      IntType result;
-// Utility to read an integer (signed or unsigned, any size)
+      if (IsLittleEndian)
-// from a stream in little-endian order. We swap the byte order after the read if
+          stream.read(reinterpret_cast<char*>(&result), sizeof(IntType));
-// necessary to return a result with the byte ordering of the compiling machine.
+      else
-template<typename IntType>
+      {
-inline IntType read_little_endian(std::istream& stream) {
+          std::uint8_t u[sizeof(IntType)];
-    IntType result;
+          typename std::make_unsigned<IntType>::type v = 0;
-    if (IsLittleEndian)
+          stream.read(reinterpret_cast<char*>(u), sizeof(IntType));
-        stream.read(reinterpret_cast<char*>(&result), sizeof(IntType));
+          for (std::size_t i = 0; i < sizeof(IntType); ++i)
-    else
+              v = (v << 8) | u[sizeof(IntType) - i - 1];
    {
        std::uint8_t                  u[sizeof(IntType)];
        std::make_unsigned_t<IntType> v = 0;
-        stream.read(reinterpret_cast<char*>(u), sizeof(IntType));
+          std::memcpy(&result, &v, sizeof(IntType));
-        for (std::size_t i = 0; i < sizeof(IntType); ++i)
+      }
            v = (v << 8) | u[sizeof(IntType) - i - 1];
-        std::memcpy(&result, &v, sizeof(IntType));
+      return result;
-    }
+  }
-    return result;
+  // write_little_endian() is our utility to write an integer (signed or unsigned, any size)
-}
+  // to a stream in little-endian order. We swap the byte order before the write if
  // necessary to always write in little endian order, independently of the byte
  // ordering of the compiling machine.
  template <typename IntType>
  inline void write_little_endian(std::ostream& stream, IntType value) {
      if (IsLittleEndian)
          stream.write(reinterpret_cast<const char*>(&value), sizeof(IntType));
      else
      {
          std::uint8_t u[sizeof(IntType)];
          typename std::make_unsigned<IntType>::type v = value;
-// Utility to write an integer (signed or unsigned, any size)
+          std::size_t i = 0;
-// to a stream in little-endian order. We swap the byte order before the write if
+          // if constexpr to silence the warning about shift by 8
-// necessary to always write in little-endian order, independently of the byte
+          if constexpr (sizeof(IntType) > 1)
-// ordering of the compiling machine.
+          {
 template<typename IntType>
 inline void write_little_endian(std::ostream& stream, IntType value) {
    if (IsLittleEndian)
        stream.write(reinterpret_cast<const char*>(&value), sizeof(IntType));
    else
    {
        std::uint8_t                  u[sizeof(IntType)];
        std::make_unsigned_t<IntType> v = value;
        std::size_t i = 0;
        // if constexpr to silence the warning about shift by 8
        if constexpr (sizeof(IntType) > 1)
        {
            for (; i + 1 < sizeof(IntType); ++i)
            {
-                u[i] = std::uint8_t(v);
+                u[i] = (std::uint8_t)v;
                v >>= 8;
            }
-        }
+          }
-        u[i] = std::uint8_t(v);
+          u[i] = (std::uint8_t)v;
-        stream.write(reinterpret_cast<char*>(u), sizeof(IntType));
+          stream.write(reinterpret_cast<char*>(u), sizeof(IntType));
-    }
+      }
-}
+  }
  // read_little_endian(s, out, N) : read integers in bulk from a little indian stream.
  // This reads N integers from stream s and put them in array out.
  template <typename IntType>
  inline void read_little_endian(std::istream& stream, IntType* out, std::size_t count) {
      if (IsLittleEndian)
          stream.read(reinterpret_cast<char*>(out), sizeof(IntType) * count);
      else
          for (std::size_t i = 0; i < count; ++i)
              out[i] = read_little_endian<IntType>(stream);
  }
-// Read integers in bulk from a little-endian stream.
+  // write_little_endian(s, values, N) : write integers in bulk to a little indian stream.
-// This reads N integers from stream s and puts them in array out.
+  // This takes N integers from array values and writes them on stream s.
-template<typename IntType>
+  template <typename IntType>
-inline void read_little_endian(std::istream& stream, IntType* out, std::size_t count) {
+  inline void write_little_endian(std::ostream& stream, const IntType* values, std::size_t count) {
-    if (IsLittleEndian)
+      if (IsLittleEndian)
-        stream.read(reinterpret_cast<char*>(out), sizeof(IntType) * count);
+          stream.write(reinterpret_cast<const char*>(values), sizeof(IntType) * count);
-    else
+      else
-        for (std::size_t i = 0; i < count; ++i)
+          for (std::size_t i = 0; i < count; ++i)
-            out[i] = read_little_endian<IntType>(stream);
+              write_little_endian<IntType>(stream, values[i]);
-}
+  }
 // Write integers in bulk to a little-endian stream.
 // This takes N integers from array values and writes them on stream s.
 template<typename IntType>
 inline void write_little_endian(std::ostream& stream, const IntType* values, std::size_t count) {
    if (IsLittleEndian)
        stream.write(reinterpret_cast<const char*>(values), sizeof(IntType) * count);
    else
        for (std::size_t i = 0; i < count; ++i)
            write_little_endian<IntType>(stream, values[i]);
 }
 // Read N signed integers from the stream s, putting them in the array out.
 // The stream is assumed to be compressed using the signed LEB128 format.
 // See https://en.wikipedia.org/wiki/LEB128 for a description of the compression scheme.
 template<typename IntType>
 inline void read_leb_128(std::istream& stream, IntType* out, std::size_t count) {
    // Check the presence of our LEB128 magic string
    char leb128MagicString[Leb128MagicStringSize];
    stream.read(leb128MagicString, Leb128MagicStringSize);
    assert(strncmp(Leb128MagicString, leb128MagicString, Leb128MagicStringSize) == 0);
    static_assert(std::is_signed_v<IntType>, "Not implemented for unsigned types");
    const std::uint32_t BUF_SIZE = 4096;
    std::uint8_t        buf[BUF_SIZE];
    auto bytes_left = read_little_endian<std::uint32_t>(stream);
    std::uint32_t buf_pos = BUF_SIZE;
    for (std::size_t i = 0; i < count; ++i)
    {
        IntType result = 0;
        size_t  shift  = 0;
        do
        {
            if (buf_pos == BUF_SIZE)
            {
                stream.read(reinterpret_cast<char*>(buf), std::min(bytes_left, BUF_SIZE));
                buf_pos = 0;
            }
            std::uint8_t byte = buf[buf_pos++];
            --bytes_left;
            result |= (byte & 0x7f) << shift;
            shift += 7;
            if ((byte & 0x80) == 0)
            {
                out[i] = (sizeof(IntType) * 8 <= shift || (byte & 0x40) == 0)
                         ? result
                         : result | ~((1 << shift) - 1);
                break;
            }
        } while (shift < sizeof(IntType) * 8);
    }
    assert(bytes_left == 0);
 }
 // Write signed integers to a stream with LEB128 compression.
 // This takes N integers from array values, compresses them with
 // the LEB128 algorithm and writes the result on the stream s.
 // See https://en.wikipedia.org/wiki/LEB128 for a description of the compression scheme.
 template<typename IntType>
 inline void write_leb_128(std::ostream& stream, const IntType* values, std::size_t count) {
    // Write our LEB128 magic string
    stream.write(Leb128MagicString, Leb128MagicStringSize);
    static_assert(std::is_signed_v<IntType>, "Not implemented for unsigned types");
    std::uint32_t byte_count = 0;
    for (std::size_t i = 0; i < count; ++i)
    {
        IntType      value = values[i];
        std::uint8_t byte;
        do
        {
            byte = value & 0x7f;
            value >>= 7;
            ++byte_count;
        } while ((byte & 0x40) == 0 ? value != 0 : value != -1);
    }
    write_little_endian(stream, byte_count);
    const std::uint32_t BUF_SIZE = 4096;
    std::uint8_t        buf[BUF_SIZE];
    std::uint32_t       buf_pos = 0;
    auto flush = [&]() {
        if (buf_pos > 0)
        {
            stream.write(reinterpret_cast<char*>(buf), buf_pos);
            buf_pos = 0;
        }
    };
    auto write = [&](std::uint8_t byte) {
        buf[buf_pos++] = byte;
        if (buf_pos == BUF_SIZE)
            flush();
    };
    for (std::size_t i = 0; i < count; ++i)
    {
        IntType value = values[i];
        while (true)
        {
            std::uint8_t byte = value & 0x7f;
            value >>= 7;
            if ((byte & 0x40) == 0 ? value == 0 : value == -1)
            {
                write(byte);
                break;
            }
            write(byte | 0x80);
        }
    }
    flush();
 }
 }  // namespace Stockfish::Eval::NNUE
-#endif  // #ifndef NNUE_COMMON_H_INCLUDED
+#endif // #ifndef NNUE_COMMON_H_INCLUDED
@@ -1,203 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 // Code for calculating NNUE evaluation function
 #include "nnue_misc.h"
 #include <cmath>
 #include <cstdlib>
 #include <cstring>
 #include <iomanip>
 #include <iosfwd>
 #include <iostream>
 #include <sstream>
 #include <string_view>
 #include <tuple>
 #include "../evaluate.h"
 #include "../position.h"
 #include "../types.h"
 #include "../uci.h"
 #include "network.h"
 #include "nnue_accumulator.h"
 namespace Stockfish::Eval::NNUE {
 constexpr std::string_view PieceToChar(" PNBRQK  pnbrqk");
 void hint_common_parent_position(const Position&    pos,
                                 const Networks&    networks,
                                 AccumulatorCaches& caches) {
    if (Eval::use_smallnet(pos))
        networks.small.hint_common_access(pos, &caches.small);
    else
        networks.big.hint_common_access(pos, &caches.big);
 }
 namespace {
 // Converts a Value into (centi)pawns and writes it in a buffer.
 // The buffer must have capacity for at least 5 chars.
 void format_cp_compact(Value v, char* buffer, const Position& pos) {
    buffer[0] = (v < 0 ? '-' : v > 0 ? '+' : ' ');
    int cp = std::abs(UCIEngine::to_cp(v, pos));
    if (cp >= 10000)
    {
        buffer[1] = '0' + cp / 10000;
        cp %= 10000;
        buffer[2] = '0' + cp / 1000;
        cp %= 1000;
        buffer[3] = '0' + cp / 100;
        buffer[4] = ' ';
    }
    else if (cp >= 1000)
    {
        buffer[1] = '0' + cp / 1000;
        cp %= 1000;
        buffer[2] = '0' + cp / 100;
        cp %= 100;
        buffer[3] = '.';
        buffer[4] = '0' + cp / 10;
    }
    else
    {
        buffer[1] = '0' + cp / 100;
        cp %= 100;
        buffer[2] = '.';
        buffer[3] = '0' + cp / 10;
        cp %= 10;
        buffer[4] = '0' + cp / 1;
    }
 }
 // Converts a Value into pawns, always keeping two decimals
 void format_cp_aligned_dot(Value v, std::stringstream& stream, const Position& pos) {
    const double pawns = std::abs(0.01 * UCIEngine::to_cp(v, pos));
    stream << (v < 0   ? '-'
               : v > 0 ? '+'
                       : ' ')
           << std::setiosflags(std::ios::fixed) << std::setw(6) << std::setprecision(2) << pawns;
 }
 }
 // Returns a string with the value of each piece on a board,
 // and a table for (PSQT, Layers) values bucket by bucket.
 std::string
 trace(Position& pos, const Eval::NNUE::Networks& networks, Eval::NNUE::AccumulatorCaches& caches) {
    std::stringstream ss;
    char board[3 * 8 + 1][8 * 8 + 2];
    std::memset(board, ' ', sizeof(board));
    for (int row = 0; row < 3 * 8 + 1; ++row)
        board[row][8 * 8 + 1] = '\0';
    // A lambda to output one box of the board
    auto writeSquare = [&board, &pos](File file, Rank rank, Piece pc, Value value) {
        const int x = int(file) * 8;
        const int y = (7 - int(rank)) * 3;
        for (int i = 1; i < 8; ++i)
            board[y][x + i] = board[y + 3][x + i] = '-';
        for (int i = 1; i < 3; ++i)
            board[y + i][x] = board[y + i][x + 8] = '|';
        board[y][x] = board[y][x + 8] = board[y + 3][x + 8] = board[y + 3][x] = '+';
        if (pc != NO_PIECE)
            board[y + 1][x + 4] = PieceToChar[pc];
        if (is_valid(value))
            format_cp_compact(value, &board[y + 2][x + 2], pos);
    };
    // We estimate the value of each piece by doing a differential evaluation from
    // the current base eval, simulating the removal of the piece from its square.
    auto [psqt, positional] = networks.big.evaluate(pos, &caches.big);
    Value base              = psqt + positional;
    base                    = pos.side_to_move() == WHITE ? base : -base;
    for (File f = FILE_A; f <= FILE_H; ++f)
        for (Rank r = RANK_1; r <= RANK_8; ++r)
        {
            Square sq = make_square(f, r);
            Piece  pc = pos.piece_on(sq);
            Value  v  = VALUE_NONE;
            if (pc != NO_PIECE && type_of(pc) != KING)
            {
                auto st = pos.state();
                pos.remove_piece(sq);
                st->accumulatorBig.computed[WHITE] = st->accumulatorBig.computed[BLACK] = false;
                std::tie(psqt, positional) = networks.big.evaluate(pos, &caches.big);
                Value eval                 = psqt + positional;
                eval                       = pos.side_to_move() == WHITE ? eval : -eval;
                v                          = base - eval;
                pos.put_piece(pc, sq);
                st->accumulatorBig.computed[WHITE] = st->accumulatorBig.computed[BLACK] = false;
            }
            writeSquare(f, r, pc, v);
        }
    ss << " NNUE derived piece values:\n";
    for (int row = 0; row < 3 * 8 + 1; ++row)
        ss << board[row] << '\n';
    ss << '\n';
    auto t = networks.big.trace_evaluate(pos, &caches.big);
    ss << " NNUE network contributions "
       << (pos.side_to_move() == WHITE ? "(White to move)" : "(Black to move)") << std::endl
       << "+------------+------------+------------+------------+\n"
       << "|   Bucket   |  Material  | Positional |   Total    |\n"
       << "|            |   (PSQT)   |  (Layers)  |            |\n"
       << "+------------+------------+------------+------------+\n";
    for (std::size_t bucket = 0; bucket < LayerStacks; ++bucket)
    {
        ss << "|  " << bucket << "        "  //
           << " |  ";
        format_cp_aligned_dot(t.psqt[bucket], ss, pos);
        ss << "  "  //
           << " |  ";
        format_cp_aligned_dot(t.positional[bucket], ss, pos);
        ss << "  "  //
           << " |  ";
        format_cp_aligned_dot(t.psqt[bucket] + t.positional[bucket], ss, pos);
        ss << "  "  //
           << " |";
        if (bucket == t.correctBucket)
            ss << " <-- this bucket is used";
        ss << '\n';
    }
    ss << "+------------+------------+------------+------------+\n";
    return ss.str();
 }
 }  // namespace Stockfish::Eval::NNUE
@@ -1,64 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef NNUE_MISC_H_INCLUDED
 #define NNUE_MISC_H_INCLUDED
 #include <cstddef>
 #include <string>
 #include "../types.h"
 #include "nnue_architecture.h"
 namespace Stockfish {
 class Position;
 namespace Eval::NNUE {
 struct EvalFile {
    // Default net name, will use one of the EvalFileDefaultName* macros defined
    // in evaluate.h
    std::string defaultName;
    // Selected net name, either via uci option or default
    std::string current;
    // Net description extracted from the net file
    std::string netDescription;
 };
 struct NnueEvalTrace {
    static_assert(LayerStacks == PSQTBuckets);
    Value       psqt[LayerStacks];
    Value       positional[LayerStacks];
    std::size_t correctBucket;
 };
 struct Networks;
 struct AccumulatorCaches;
 std::string trace(Position& pos, const Networks& networks, AccumulatorCaches& caches);
 void        hint_common_parent_position(const Position&    pos,
                                        const Networks&    networks,
                                        AccumulatorCaches& caches);
 }  // namespace Stockfish::Eval::NNUE
 }  // namespace Stockfish
 #endif  // #ifndef NNUE_MISC_H_INCLUDED
@@ -0,0 +1,305 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include <algorithm>
 #include <cassert>
 #include "bitboard.h"
 #include "pawns.h"
 #include "position.h"
 #include "thread.h"
 namespace Stockfish {
 namespace {
  #define V Value
  #define S(mg, eg) make_score(mg, eg)
  // Pawn penalties
  constexpr Score Backward      = S( 6, 19);
  constexpr Score Doubled       = S(11, 51);
  constexpr Score DoubledEarly  = S(17,  7);
  constexpr Score Isolated      = S( 1, 20);
  constexpr Score WeakLever     = S( 2, 57);
  constexpr Score WeakUnopposed = S(15, 18);
  // Bonus for blocked pawns at 5th or 6th rank
  constexpr Score BlockedPawn[2] = { S(-19, -8), S(-7, 3) };
  constexpr Score BlockedStorm[RANK_NB] = {
    S(0, 0), S(0, 0), S(64, 75), S(-3, 14), S(-12, 19), S(-7, 4), S(-10, 5)
  };
  // Connected pawn bonus
  constexpr int Connected[RANK_NB] = { 0, 3, 7, 7, 15, 54, 86 };
  // Strength of pawn shelter for our king by [distance from edge][rank].
  // RANK_1 = 0 is used for files where we have no pawn, or pawn is behind our king.
  constexpr Value ShelterStrength[int(FILE_NB) / 2][RANK_NB] = {
    { V(-2), V(85), V(95), V(53), V(39), V(23), V(25) },
    { V(-55), V(64), V(32), V(-55), V(-30), V(-11), V(-61) },
    { V(-11), V(75), V(19), V(-6), V(26), V(9), V(-47) },
    { V(-41), V(-11), V(-27), V(-58), V(-42), V(-66), V(-163) }
  };
  // Danger of enemy pawns moving toward our king by [distance from edge][rank].
  // RANK_1 = 0 is used for files where the enemy has no pawn, or their pawn
  // is behind our king. Note that UnblockedStorm[0][1-2] accommodate opponent pawn
  // on edge, likely blocked by our king.
  constexpr Value UnblockedStorm[int(FILE_NB) / 2][RANK_NB] = {
    { V(94), V(-280), V(-170), V(90), V(59), V(47), V(53) },
    { V(43), V(-17), V(128), V(39), V(26), V(-17), V(15) },
    { V(-9), V(62), V(170), V(34), V(-5), V(-20), V(-11) },
    { V(-27), V(-19), V(106), V(10), V(2), V(-13), V(-24) }
  };
  // KingOnFile[semi-open Us][semi-open Them] contains bonuses/penalties
  // for king when the king is on a semi-open or open file.
  constexpr Score KingOnFile[2][2] = {{ S(-18,11), S(-6,-3)  },
                                     {  S(  0, 0), S( 5,-4) }};
  #undef S
  #undef V
  /// evaluate() calculates a score for the static pawn structure of the given position.
  /// We cannot use the location of pieces or king in this function, as the evaluation
  /// of the pawn structure will be stored in a small cache for speed reasons, and will
  /// be re-used even when the pieces have moved.
  template<Color Us>
  Score evaluate(const Position& pos, Pawns::Entry* e) {
    constexpr Color     Them = ~Us;
    constexpr Direction Up   = pawn_push(Us);
    constexpr Direction Down = -Up;
    Bitboard neighbours, stoppers, support, phalanx, opposed;
    Bitboard lever, leverPush, blocked;
    Square s;
    bool backward, passed, doubled;
    Score score = SCORE_ZERO;
    Bitboard b = pos.pieces(Us, PAWN);
    Bitboard ourPawns   = pos.pieces(  Us, PAWN);
    Bitboard theirPawns = pos.pieces(Them, PAWN);
    Bitboard doubleAttackThem = pawn_double_attacks_bb<Them>(theirPawns);
    e->passedPawns[Us] = 0;
    e->kingSquares[Us] = SQ_NONE;
    e->pawnAttacks[Us] = e->pawnAttacksSpan[Us] = pawn_attacks_bb<Us>(ourPawns);
    e->blockedCount += popcount(shift<Up>(ourPawns) & (theirPawns | doubleAttackThem));
    // Loop through all pawns of the current color and score each pawn
    while (b)
    {
        s = pop_lsb(b);
        assert(pos.piece_on(s) == make_piece(Us, PAWN));
        Rank r = relative_rank(Us, s);
        // Flag the pawn
        opposed    = theirPawns & forward_file_bb(Us, s);
        blocked    = theirPawns & (s + Up);
        stoppers   = theirPawns & passed_pawn_span(Us, s);
        lever      = theirPawns & pawn_attacks_bb(Us, s);
        leverPush  = theirPawns & pawn_attacks_bb(Us, s + Up);
        doubled    = ourPawns   & (s - Up);
        neighbours = ourPawns   & adjacent_files_bb(s);
        phalanx    = neighbours & rank_bb(s);
        support    = neighbours & rank_bb(s - Up);
        if (doubled)
        {
            // Additional doubled penalty if none of their pawns is fixed
            if (!(ourPawns & shift<Down>(theirPawns | pawn_attacks_bb<Them>(theirPawns))))
                score -= DoubledEarly;
        }
        // A pawn is backward when it is behind all pawns of the same color on
        // the adjacent files and cannot safely advance.
        backward =  !(neighbours & forward_ranks_bb(Them, s + Up))
                  && (leverPush | blocked);
        // Compute additional span if pawn is not backward nor blocked
        if (!backward && !blocked)
            e->pawnAttacksSpan[Us] |= pawn_attack_span(Us, s);
        // A pawn is passed if one of the three following conditions is true:
        // (a) there is no stoppers except some levers
        // (b) the only stoppers are the leverPush, but we outnumber them
        // (c) there is only one front stopper which can be levered.
        //     (Refined in Evaluation::passed)
        passed =   !(stoppers ^ lever)
                || (   !(stoppers ^ leverPush)
                    && popcount(phalanx) >= popcount(leverPush))
                || (   stoppers == blocked && r >= RANK_5
                    && (shift<Up>(support) & ~(theirPawns | doubleAttackThem)));
        passed &= !(forward_file_bb(Us, s) & ourPawns);
        // Passed pawns will be properly scored later in evaluation when we have
        // full attack info.
        if (passed)
            e->passedPawns[Us] |= s;
        // Score this pawn
        if (support | phalanx)
        {
            int v =  Connected[r] * (2 + bool(phalanx) - bool(opposed))
                   + 22 * popcount(support);
            score += make_score(v, v * (r - 2) / 4);
        }
        else if (!neighbours)
        {
            if (     opposed
                &&  (ourPawns & forward_file_bb(Them, s))
                && !(theirPawns & adjacent_files_bb(s)))
                score -= Doubled;
            else
                score -=  Isolated
                        + WeakUnopposed * !opposed;
        }
        else if (backward)
            score -=  Backward
                    + WeakUnopposed * !opposed * bool(~(FileABB | FileHBB) & s);
        if (!support)
            score -=  Doubled * doubled
                    + WeakLever * more_than_one(lever);
        if (blocked && r >= RANK_5)
            score += BlockedPawn[r - RANK_5];
    }
    return score;
  }
 } // namespace
 namespace Pawns {
 /// Pawns::probe() looks up the current position's pawns configuration in
 /// the pawns hash table. It returns a pointer to the Entry if the position
 /// is found. Otherwise a new Entry is computed and stored there, so we don't
 /// have to recompute all when the same pawns configuration occurs again.
 Entry* probe(const Position& pos) {
  Key key = pos.pawn_key();
  Entry* e = pos.this_thread()->pawnsTable[key];
  if (e->key == key)
      return e;
  e->key = key;
  e->blockedCount = 0;
  e->scores[WHITE] = evaluate<WHITE>(pos, e);
  e->scores[BLACK] = evaluate<BLACK>(pos, e);
  return e;
 }
 /// Entry::evaluate_shelter() calculates the shelter bonus and the storm
 /// penalty for a king, looking at the king file and the two closest files.
 template<Color Us>
 Score Entry::evaluate_shelter(const Position& pos, Square ksq) const {
  constexpr Color Them = ~Us;
  Bitboard b = pos.pieces(PAWN) & ~forward_ranks_bb(Them, ksq);
  Bitboard ourPawns = b & pos.pieces(Us) & ~pawnAttacks[Them];
  Bitboard theirPawns = b & pos.pieces(Them);
  Score bonus = make_score(5, 5);
  File center = std::clamp(file_of(ksq), FILE_B, FILE_G);
  for (File f = File(center - 1); f <= File(center + 1); ++f)
  {
      b = ourPawns & file_bb(f);
      int ourRank = b ? relative_rank(Us, frontmost_sq(Them, b)) : 0;
      b = theirPawns & file_bb(f);
      int theirRank = b ? relative_rank(Us, frontmost_sq(Them, b)) : 0;
      int d = edge_distance(f);
      bonus += make_score(ShelterStrength[d][ourRank], 0);
      if (ourRank && (ourRank == theirRank - 1))
          bonus -= BlockedStorm[theirRank];
      else
          bonus -= make_score(UnblockedStorm[d][theirRank], 0);
  }
  // King On File
  bonus -= KingOnFile[pos.is_on_semiopen_file(Us, ksq)][pos.is_on_semiopen_file(Them, ksq)];
  return bonus;
 }
 /// Entry::do_king_safety() calculates a bonus for king safety. It is called only
 /// when king square changes, which is about 20% of total king_safety() calls.
 template<Color Us>
 Score Entry::do_king_safety(const Position& pos) {
  Square ksq = pos.square<KING>(Us);
  kingSquares[Us] = ksq;
  castlingRights[Us] = pos.castling_rights(Us);
  auto compare = [](Score a, Score b) { return mg_value(a) < mg_value(b); };
  Score shelter = evaluate_shelter<Us>(pos, ksq);
  // If we can castle use the bonus after castling if it is bigger
  if (pos.can_castle(Us & KING_SIDE))
      shelter = std::max(shelter, evaluate_shelter<Us>(pos, relative_square(Us, SQ_G1)), compare);
  if (pos.can_castle(Us & QUEEN_SIDE))
      shelter = std::max(shelter, evaluate_shelter<Us>(pos, relative_square(Us, SQ_C1)), compare);
  // In endgame we like to bring our king near our closest pawn
  Bitboard pawns = pos.pieces(Us, PAWN);
  int minPawnDist = 6;
  if (pawns & attacks_bb<KING>(ksq))
      minPawnDist = 1;
  else while (pawns)
      minPawnDist = std::min(minPawnDist, distance(ksq, pop_lsb(pawns)));
  return shelter - make_score(0, 16 * minPawnDist);
 }
 // Explicit template instantiation
 template Score Entry::do_king_safety<WHITE>(const Position& pos);
 template Score Entry::do_king_safety<BLACK>(const Position& pos);
 } // namespace Pawns
 } // namespace Stockfish
@@ -0,0 +1,70 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef PAWNS_H_INCLUDED
 #define PAWNS_H_INCLUDED
 #include "misc.h"
 #include "position.h"
 #include "types.h"
 namespace Stockfish::Pawns {
 /// Pawns::Entry contains various information about a pawn structure. A lookup
 /// to the pawn hash table (performed by calling the probe function) returns a
 /// pointer to an Entry object.
 struct Entry {
  Score pawn_score(Color c) const { return scores[c]; }
  Bitboard pawn_attacks(Color c) const { return pawnAttacks[c]; }
  Bitboard passed_pawns(Color c) const { return passedPawns[c]; }
  Bitboard pawn_attacks_span(Color c) const { return pawnAttacksSpan[c]; }
  int passed_count() const { return popcount(passedPawns[WHITE] | passedPawns[BLACK]); }
  int blocked_count() const { return blockedCount; }
  template<Color Us>
  Score king_safety(const Position& pos) {
    return  kingSquares[Us] == pos.square<KING>(Us) && castlingRights[Us] == pos.castling_rights(Us)
          ? kingSafety[Us] : (kingSafety[Us] = do_king_safety<Us>(pos));
  }
  template<Color Us>
  Score do_king_safety(const Position& pos);
  template<Color Us>
  Score evaluate_shelter(const Position& pos, Square ksq) const;
  Key key;
  Score scores[COLOR_NB];
  Bitboard passedPawns[COLOR_NB];
  Bitboard pawnAttacks[COLOR_NB];
  Bitboard pawnAttacksSpan[COLOR_NB];
  Square kingSquares[COLOR_NB];
  Score kingSafety[COLOR_NB];
  int castlingRights[COLOR_NB];
  int blockedCount;
 };
 typedef HashTable<Entry, 131072> Table;
 Entry* probe(const Position& pos);
 } // namespace Stockfish::Pawns
 #endif // #ifndef PAWNS_H_INCLUDED
@@ -1,68 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef PERFT_H_INCLUDED
 #define PERFT_H_INCLUDED
 #include <cstdint>
 #include "movegen.h"
 #include "position.h"
 #include "types.h"
 #include "uci.h"
 namespace Stockfish::Benchmark {
 // Utility to verify move generation. All the leaf nodes up
 // to the given depth are generated and counted, and the sum is returned.
 template<bool Root>
 uint64_t perft(Position& pos, Depth depth) {
    StateInfo st;
    ASSERT_ALIGNED(&st, Eval::NNUE::CacheLineSize);
    uint64_t   cnt, nodes = 0;
    const bool leaf = (depth == 2);
    for (const auto& m : MoveList<LEGAL>(pos))
    {
        if (Root && depth <= 1)
            cnt = 1, nodes++;
        else
        {
            pos.do_move(m, st);
            cnt = leaf ? MoveList<LEGAL>(pos).size() : perft<false>(pos, depth - 1);
            nodes += cnt;
            pos.undo_move(m);
        }
        if (Root)
            sync_cout << UCIEngine::move(m, pos.is_chess960()) << ": " << cnt << sync_endl;
    }
    return nodes;
 }
 inline uint64_t perft(const std::string& fen, Depth depth, bool isChess960) {
    StateListPtr states(new std::deque<StateInfo>(1));
    Position     p;
    p.set(fen, isChess960, &states->back());
    return perft<true>(p, depth);
 }
 }
 #endif  // PERFT_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,356 +21,445 @@
 #include <cassert>
 #include <deque>
-#include <iosfwd>
+#include <memory> // For std::unique_ptr
 #include <memory>
 #include <string>
 #include "bitboard.h"
-#include "nnue/nnue_accumulator.h"
+#include "evaluate.h"
-#include "nnue/nnue_architecture.h"
+#include "psqt.h"
 #include "types.h"
 #include "nnue/nnue_accumulator.h"
 #include "tools/packed_sfen.h"
 #include "tools/sfen_packer.h"
 namespace Stockfish {
-class TranspositionTable;
+/// StateInfo struct stores information needed to restore a Position object to
-
+/// its previous state when we retract a move. Whenever a move is made on the
-// StateInfo struct stores information needed to restore a Position object to
+/// board (by calling Position::do_move), a StateInfo object must be passed.
 // its previous state when we retract a move. Whenever a move is made on the
 // board (by calling Position::do_move), a StateInfo object must be passed.
 struct StateInfo {
-    // Copied when making a move
+  // Copied when making a move
-    Key    materialKey;
+  Key    pawnKey;
-    Key    pawnKey;
+  Key    materialKey;
-    Key    minorPieceKey;
+  Value  nonPawnMaterial[COLOR_NB];
-    Key    nonPawnKey[COLOR_NB];
+  int    castlingRights;
-    Value  nonPawnMaterial[COLOR_NB];
+  int    rule50;
-    int    castlingRights;
+  int    pliesFromNull;
-    int    rule50;
+  Square epSquare;
    int    pliesFromNull;
    Square epSquare;
-    // Not copied when making a move (will be recomputed anyhow)
+  // Not copied when making a move (will be recomputed anyhow)
-    Key        key;
+  Key        key;
-    Bitboard   checkersBB;
+  Bitboard   checkersBB;
-    StateInfo* previous;
+  StateInfo* previous;
-    StateInfo* next;
+  Bitboard   blockersForKing[COLOR_NB];
-    Bitboard   blockersForKing[COLOR_NB];
+  Bitboard   pinners[COLOR_NB];
-    Bitboard   pinners[COLOR_NB];
+  Bitboard   checkSquares[PIECE_TYPE_NB];
-    Bitboard   checkSquares[PIECE_TYPE_NB];
+  Piece      capturedPiece;
-    Piece      capturedPiece;
+  int        repetition;
    int        repetition;
-    // Used by NNUE
+  // Used by NNUE
-    Eval::NNUE::Accumulator<Eval::NNUE::TransformedFeatureDimensionsBig>   accumulatorBig;
+  Eval::NNUE::Accumulator accumulator;
-    Eval::NNUE::Accumulator<Eval::NNUE::TransformedFeatureDimensionsSmall> accumulatorSmall;
+  DirtyPiece dirtyPiece;
    DirtyPiece                                                             dirtyPiece;
 };
-// A list to keep track of the position states along the setup moves (from the
+/// A list to keep track of the position states along the setup moves (from the
-// start position to the position just before the search starts). Needed by
+/// start position to the position just before the search starts). Needed by
-// 'draw by repetition' detection. Use a std::deque because pointers to
+/// 'draw by repetition' detection. Use a std::deque because pointers to
-// elements are not invalidated upon list resizing.
+/// elements are not invalidated upon list resizing.
-using StateListPtr = std::unique_ptr<std::deque<StateInfo>>;
+typedef std::unique_ptr<std::deque<StateInfo>> StateListPtr;
-// Position class stores information regarding the board representation as
+/// Position class stores information regarding the board representation as
-// pieces, side to move, hash keys, castling info, etc. Important methods are
+/// pieces, side to move, hash keys, castling info, etc. Important methods are
-// do_move() and undo_move(), used by the search to update node info when
+/// do_move() and undo_move(), used by the search to update node info when
-// traversing the search tree.
+/// traversing the search tree.
 class Thread;
 class Position {
-   public:
+public:
-    static void init();
+  static void init();
-    Position()                           = default;
+  Position() = default;
-    Position(const Position&)            = delete;
+  Position(const Position&) = delete;
-    Position& operator=(const Position&) = delete;
+  Position& operator=(const Position&) = delete;
-    // FEN string input/output
+  // FEN string input/output
-    Position&   set(const std::string& fenStr, bool isChess960, StateInfo* si);
+  Position& set(const std::string& fenStr, bool isChess960, StateInfo* si, Thread* th);
-    Position&   set(const std::string& code, Color c, StateInfo* si);
+  Position& set(const std::string& code, Color c, StateInfo* si);
-    std::string fen() const;
+  std::string fen() const;
-    // Position representation
+  // Position representation
-    Bitboard pieces(PieceType pt = ALL_PIECES) const;
+  Bitboard pieces(PieceType pt) const;
-    template<typename... PieceTypes>
+  Bitboard pieces(PieceType pt1, PieceType pt2) const;
-    Bitboard pieces(PieceType pt, PieceTypes... pts) const;
+  Bitboard pieces(Color c) const;
-    Bitboard pieces(Color c) const;
+  Bitboard pieces(Color c, PieceType pt) const;
-    template<typename... PieceTypes>
+  Bitboard pieces(Color c, PieceType pt1, PieceType pt2) const;
-    Bitboard pieces(Color c, PieceTypes... pts) const;
+  Piece piece_on(Square s) const;
-    Piece    piece_on(Square s) const;
+  Square ep_square() const;
-    Square   ep_square() const;
+  bool empty(Square s) const;
-    bool     empty(Square s) const;
+  template<PieceType Pt> int count(Color c) const;
-    template<PieceType Pt>
+  template<PieceType Pt> int count() const;
-    int count(Color c) const;
+  template<PieceType Pt> Square square(Color c) const;
-    template<PieceType Pt>
+  bool is_on_semiopen_file(Color c, Square s) const;
    int count() const;
    template<PieceType Pt>
    Square square(Color c) const;
-    // Castling
+  // Castling
-    CastlingRights castling_rights(Color c) const;
+  CastlingRights castling_rights(Color c) const;
-    bool           can_castle(CastlingRights cr) const;
+  bool can_castle(CastlingRights cr) const;
-    bool           castling_impeded(CastlingRights cr) const;
+  bool castling_impeded(CastlingRights cr) const;
-    Square         castling_rook_square(CastlingRights cr) const;
+  Square castling_rook_square(CastlingRights cr) const;
-    // Checking
+  // Checking
-    Bitboard checkers() const;
+  Bitboard checkers() const;
-    Bitboard blockers_for_king(Color c) const;
+  Bitboard blockers_for_king(Color c) const;
-    Bitboard check_squares(PieceType pt) const;
+  Bitboard check_squares(PieceType pt) const;
-    Bitboard pinners(Color c) const;
+  Bitboard pinners(Color c) const;
-    // Attacks to/from a given square
+  // Attacks to/from a given square
-    Bitboard attackers_to(Square s) const;
+  Bitboard attackers_to(Square s) const;
-    Bitboard attackers_to(Square s, Bitboard occupied) const;
+  Bitboard attackers_to(Square s, Bitboard occupied) const;
-    bool     attackers_to_exist(Square s, Bitboard occupied, Color c) const;
+  Bitboard slider_blockers(Bitboard sliders, Square s, Bitboard& pinners) const;
-    void     update_slider_blockers(Color c) const;
+  template<PieceType Pt> Bitboard attacks_by(Color c) const;
    template<PieceType Pt>
    Bitboard attacks_by(Color c) const;
-    // Properties of moves
+  // Properties of moves
-    bool  legal(Move m) const;
+  bool legal(Move m) const;
-    bool  pseudo_legal(const Move m) const;
+  bool pseudo_legal(const Move m) const;
-    bool  capture(Move m) const;
+  bool capture(Move m) const;
-    bool  capture_stage(Move m) const;
+  bool capture_or_promotion(Move m) const;
-    bool  gives_check(Move m) const;
+  bool gives_check(Move m) const;
-    Piece moved_piece(Move m) const;
+  Piece moved_piece(Move m) const;
-    Piece captured_piece() const;
+  Piece captured_piece() const;
-    // Doing and undoing moves
+  // Piece specific
-    void do_move(Move m, StateInfo& newSt, const TranspositionTable* tt);
+  bool pawn_passed(Color c, Square s) const;
-    void do_move(Move m, StateInfo& newSt, bool givesCheck, const TranspositionTable* tt);
+  bool opposite_bishops() const;
-    void undo_move(Move m);
+  int  pawns_on_same_color_squares(Color c, Square s) const;
    void do_null_move(StateInfo& newSt, const TranspositionTable& tt);
    void undo_null_move();
-    // Static Exchange Evaluation
+  // Doing and undoing moves
-    bool see_ge(Move m, int threshold = 0) const;
+  void do_move(Move m, StateInfo& newSt);
  void do_move(Move m, StateInfo& newSt, bool givesCheck);
  void undo_move(Move m);
  void do_null_move(StateInfo& newSt);
  void undo_null_move();
-    // Accessing hash keys
+  // Static Exchange Evaluation
-    Key key() const;
+  bool see_ge(Move m, Value threshold = VALUE_ZERO) const;
    Key material_key() const;
    Key pawn_key() const;
    Key minor_piece_key() const;
    Key non_pawn_key(Color c) const;
-    // Other properties of the position
+  // Accessing hash keys
-    Color side_to_move() const;
+  Key key() const;
-    int   game_ply() const;
+  Key key_after(Move m) const;
-    bool  is_chess960() const;
+  Key material_key() const;
-    bool  is_draw(int ply) const;
+  Key pawn_key() const;
    bool  is_repetition(int ply) const;
    bool  upcoming_repetition(int ply) const;
    bool  has_repeated() const;
    int   rule50_count() const;
    Value non_pawn_material(Color c) const;
    Value non_pawn_material() const;
-    // Position consistency check, for debugging
+  // Other properties of the position
-    bool pos_is_ok() const;
+  Color side_to_move() const;
-    void flip();
+  int game_ply() const;
  bool is_chess960() const;
  Thread* this_thread() const;
  bool is_draw(int ply) const;
  bool is_fifty_move_draw() const;
  bool is_three_fold_repetition() const;
  bool has_game_cycle(int ply) const;
  bool has_repeated() const;
  int rule50_count() const;
  Score psq_score() const;
  Value non_pawn_material(Color c) const;
  Value non_pawn_material() const;
-    // Used by NNUE
+  // Position consistency check, for debugging
-    StateInfo* state() const;
+  bool pos_is_ok() const;
  void flip();
-    void put_piece(Piece pc, Square s);
+  // Used by NNUE
-    void remove_piece(Square s);
+  StateInfo* state() const;
-   private:
+  // --sfenization helper
    // Initialization helpers (used while setting up a position)
    void set_castling_right(Color c, Square rfrom);
    void set_state() const;
    void set_check_info() const;
-    // Other helpers
+  friend int Tools::set_from_packed_sfen(Position& pos, const Tools::PackedSfen& sfen, StateInfo* si, Thread* th, bool frc);
    void move_piece(Square from, Square to);
    template<bool Do>
    void do_castling(Color us, Square from, Square& to, Square& rfrom, Square& rto);
    template<bool AfterMove>
    Key adjust_key50(Key k) const;
-    // Data members
+  // Get the packed sfen. Returns to the buffer specified in the argument.
-    Piece      board[SQUARE_NB];
+  // Do not include gamePly in pack.
-    Bitboard   byTypeBB[PIECE_TYPE_NB];
+  void sfen_pack(Tools::PackedSfen& sfen, bool resetCastlingRights);
-    Bitboard   byColorBB[COLOR_NB];
+
-    int        pieceCount[PIECE_NB];
+  // It is slow to go through sfen, so I made a function to set packed sfen directly.
-    int        castlingRightsMask[SQUARE_NB];
+  // Equivalent to pos.set(sfen_unpack(data),si,th);.
-    Square     castlingRookSquare[CASTLING_RIGHT_NB];
+  // If there is a problem with the passed phase and there is an error, non-zero is returned.
-    Bitboard   castlingPath[CASTLING_RIGHT_NB];
+  // PackedSfen does not include gamePly so it cannot be restored. If you want to set it, specify it with an argument.
-    StateInfo* st;
+  int set_from_packed_sfen(const Tools::PackedSfen& sfen, StateInfo* si, Thread* th, bool frc);
-    int        gamePly;
+
-    Color      sideToMove;
+  void clear() { std::memset(this, 0, sizeof(Position)); }
-    bool       chess960;
+
  // Give the board, hand piece, and turn, and return the sfen.
  //static std::string sfen_from_rawdata(Piece board[81], Hand hands[2], Color turn, int gamePly);
  // Returns the position of the ball on the c side.
  Square king_square(Color c) const { return lsb(pieces(c, KING)); }
  void put_piece(Piece pc, Square s);
  void remove_piece(Square s);
 private:
  // Initialization helpers (used while setting up a position)
  void set_castling_right(Color c, Square rfrom);
  void set_state(StateInfo* si) const;
  void set_check_info(StateInfo* si) const;
  // Other helpers
  void move_piece(Square from, Square to);
  template<bool Do>
  void do_castling(Color us, Square from, Square& to, Square& rfrom, Square& rto);
  // Data members
  Piece board[SQUARE_NB];
  Bitboard byTypeBB[PIECE_TYPE_NB];
  Bitboard byColorBB[COLOR_NB];
  int pieceCount[PIECE_NB];
  int castlingRightsMask[SQUARE_NB];
  Square castlingRookSquare[CASTLING_RIGHT_NB];
  Bitboard castlingPath[CASTLING_RIGHT_NB];
  Thread* thisThread;
  StateInfo* st;
  int gamePly;
  Color sideToMove;
  Score psq;
  bool chess960;
 };
-std::ostream& operator<<(std::ostream& os, const Position& pos);
+extern std::ostream& operator<<(std::ostream& os, const Position& pos);
-inline Color Position::side_to_move() const { return sideToMove; }
+inline Color Position::side_to_move() const {
  return sideToMove;
 }
 inline Piece Position::piece_on(Square s) const {
-    assert(is_ok(s));
+  assert(is_ok(s));
-    return board[s];
+  return board[s];
 }
-inline bool Position::empty(Square s) const { return piece_on(s) == NO_PIECE; }
+inline bool Position::empty(Square s) const {
-
+  return piece_on(s) == NO_PIECE;
 inline Piece Position::moved_piece(Move m) const { return piece_on(m.from_sq()); }
 inline Bitboard Position::pieces(PieceType pt) const { return byTypeBB[pt]; }
 template<typename... PieceTypes>
 inline Bitboard Position::pieces(PieceType pt, PieceTypes... pts) const {
    return pieces(pt) | pieces(pts...);
 }
-inline Bitboard Position::pieces(Color c) const { return byColorBB[c]; }
+inline Piece Position::moved_piece(Move m) const {
-
+  return piece_on(from_sq(m));
 template<typename... PieceTypes>
 inline Bitboard Position::pieces(Color c, PieceTypes... pts) const {
    return pieces(c) & pieces(pts...);
 }
-template<PieceType Pt>
+inline Bitboard Position::pieces(PieceType pt = ALL_PIECES) const {
-inline int Position::count(Color c) const {
+  return byTypeBB[pt];
    return pieceCount[make_piece(c, Pt)];
 }
-template<PieceType Pt>
+inline Bitboard Position::pieces(PieceType pt1, PieceType pt2) const {
-inline int Position::count() const {
+  return pieces(pt1) | pieces(pt2);
    return count<Pt>(WHITE) + count<Pt>(BLACK);
 }
-template<PieceType Pt>
+inline Bitboard Position::pieces(Color c) const {
-inline Square Position::square(Color c) const {
+  return byColorBB[c];
    assert(count<Pt>(c) == 1);
    return lsb(pieces(c, Pt));
 }
-inline Square Position::ep_square() const { return st->epSquare; }
+inline Bitboard Position::pieces(Color c, PieceType pt) const {
  return pieces(c) & pieces(pt);
 }
-inline bool Position::can_castle(CastlingRights cr) const { return st->castlingRights & cr; }
+inline Bitboard Position::pieces(Color c, PieceType pt1, PieceType pt2) const {
  return pieces(c) & (pieces(pt1) | pieces(pt2));
 }
 template<PieceType Pt> inline int Position::count(Color c) const {
  return pieceCount[make_piece(c, Pt)];
 }
 template<PieceType Pt> inline int Position::count() const {
  return count<Pt>(WHITE) + count<Pt>(BLACK);
 }
 template<PieceType Pt> inline Square Position::square(Color c) const {
  assert(count<Pt>(c) == 1);
  return lsb(pieces(c, Pt));
 }
 inline Square Position::ep_square() const {
  return st->epSquare;
 }
 inline bool Position::is_on_semiopen_file(Color c, Square s) const {
  return !(pieces(c, PAWN) & file_bb(s));
 }
 inline bool Position::can_castle(CastlingRights cr) const {
  return st->castlingRights & cr;
 }
 inline CastlingRights Position::castling_rights(Color c) const {
-    return c & CastlingRights(st->castlingRights);
+  return c & CastlingRights(st->castlingRights);
 }
 inline bool Position::castling_impeded(CastlingRights cr) const {
-    assert(cr == WHITE_OO || cr == WHITE_OOO || cr == BLACK_OO || cr == BLACK_OOO);
+  assert(cr == WHITE_OO || cr == WHITE_OOO || cr == BLACK_OO || cr == BLACK_OOO);
-    return pieces() & castlingPath[cr];
+
  return pieces() & castlingPath[cr];
 }
 inline Square Position::castling_rook_square(CastlingRights cr) const {
-    assert(cr == WHITE_OO || cr == WHITE_OOO || cr == BLACK_OO || cr == BLACK_OOO);
+  assert(cr == WHITE_OO || cr == WHITE_OOO || cr == BLACK_OO || cr == BLACK_OOO);
-    return castlingRookSquare[cr];
+
  return castlingRookSquare[cr];
 }
-inline Bitboard Position::attackers_to(Square s) const { return attackers_to(s, pieces()); }
+inline Bitboard Position::attackers_to(Square s) const {
  return attackers_to(s, pieces());
 }
 template<PieceType Pt>
 inline Bitboard Position::attacks_by(Color c) const {
-    if constexpr (Pt == PAWN)
+  if constexpr (Pt == PAWN)
-        return c == WHITE ? pawn_attacks_bb<WHITE>(pieces(WHITE, PAWN))
+      return c == WHITE ? pawn_attacks_bb<WHITE>(pieces(WHITE, PAWN))
-                          : pawn_attacks_bb<BLACK>(pieces(BLACK, PAWN));
+                        : pawn_attacks_bb<BLACK>(pieces(BLACK, PAWN));
-    else
+  else
-    {
+  {
-        Bitboard threats   = 0;
+      Bitboard threats = 0;
-        Bitboard attackers = pieces(c, Pt);
+      Bitboard attackers = pieces(c, Pt);
-        while (attackers)
+      while (attackers)
-            threats |= attacks_bb<Pt>(pop_lsb(attackers), pieces());
+          threats |= attacks_bb<Pt>(pop_lsb(attackers), pieces());
-        return threats;
+      return threats;
-    }
+  }
 }
-inline Bitboard Position::checkers() const { return st->checkersBB; }
+inline Bitboard Position::checkers() const {
-
+  return st->checkersBB;
 inline Bitboard Position::blockers_for_king(Color c) const { return st->blockersForKing[c]; }
 inline Bitboard Position::pinners(Color c) const { return st->pinners[c]; }
 inline Bitboard Position::check_squares(PieceType pt) const { return st->checkSquares[pt]; }
 inline Key Position::key() const { return adjust_key50<false>(st->key); }
 template<bool AfterMove>
 inline Key Position::adjust_key50(Key k) const {
    return st->rule50 < 14 - AfterMove ? k : k ^ make_key((st->rule50 - (14 - AfterMove)) / 8);
 }
-inline Key Position::pawn_key() const { return st->pawnKey; }
+inline Bitboard Position::blockers_for_king(Color c) const {
  return st->blockersForKing[c];
 }
-inline Key Position::material_key() const { return st->materialKey; }
+inline Bitboard Position::pinners(Color c) const {
  return st->pinners[c];
 }
-inline Key Position::minor_piece_key() const { return st->minorPieceKey; }
+inline Bitboard Position::check_squares(PieceType pt) const {
  return st->checkSquares[pt];
 }
-inline Key Position::non_pawn_key(Color c) const { return st->nonPawnKey[c]; }
+inline bool Position::pawn_passed(Color c, Square s) const {
  return !(pieces(~c, PAWN) & passed_pawn_span(c, s));
 }
-inline Value Position::non_pawn_material(Color c) const { return st->nonPawnMaterial[c]; }
+inline int Position::pawns_on_same_color_squares(Color c, Square s) const {
  return popcount(pieces(c, PAWN) & ((DarkSquares & s) ? DarkSquares : ~DarkSquares));
 }
 inline Key Position::key() const {
  return st->rule50 < 14 ? st->key
                         : st->key ^ make_key((st->rule50 - 14) / 8);
 }
 inline Key Position::pawn_key() const {
  return st->pawnKey;
 }
 inline Key Position::material_key() const {
  return st->materialKey;
 }
 inline Score Position::psq_score() const {
  return psq;
 }
 inline Value Position::non_pawn_material(Color c) const {
  return st->nonPawnMaterial[c];
 }
 inline Value Position::non_pawn_material() const {
-    return non_pawn_material(WHITE) + non_pawn_material(BLACK);
+  return non_pawn_material(WHITE) + non_pawn_material(BLACK);
 }
-inline int Position::game_ply() const { return gamePly; }
+inline int Position::game_ply() const {
  return gamePly;
 }
-inline int Position::rule50_count() const { return st->rule50; }
+inline int Position::rule50_count() const {
  return st->rule50;
 }
-inline bool Position::is_chess960() const { return chess960; }
+inline bool Position::opposite_bishops() const {
  return   count<BISHOP>(WHITE) == 1
        && count<BISHOP>(BLACK) == 1
        && opposite_colors(square<BISHOP>(WHITE), square<BISHOP>(BLACK));
 }
 inline bool Position::is_chess960() const {
  return chess960;
 }
 inline bool Position::capture_or_promotion(Move m) const {
  assert(is_ok(m));
  return type_of(m) != NORMAL ? type_of(m) != CASTLING : !empty(to_sq(m));
 }
 inline bool Position::capture(Move m) const {
-    assert(m.is_ok());
+  assert(is_ok(m));
-    return (!empty(m.to_sq()) && m.type_of() != CASTLING) || m.type_of() == EN_PASSANT;
+  // Castling is encoded as "king captures rook"
  return (!empty(to_sq(m)) && type_of(m) != CASTLING) || type_of(m) == EN_PASSANT;
 }
-// Returns true if a move is generated from the capture stage, having also
+inline Piece Position::captured_piece() const {
-// queen promotions covered, i.e. consistency with the capture stage move
+  return st->capturedPiece;
 // generation is needed to avoid the generation of duplicate moves.
 inline bool Position::capture_stage(Move m) const {
    assert(m.is_ok());
    return capture(m) || m.promotion_type() == QUEEN;
 }
-inline Piece Position::captured_piece() const { return st->capturedPiece; }
+inline Thread* Position::this_thread() const {
  return thisThread;
 }
 inline void Position::put_piece(Piece pc, Square s) {
-    board[s] = pc;
+  board[s] = pc;
-    byTypeBB[ALL_PIECES] |= byTypeBB[type_of(pc)] |= s;
+  byTypeBB[ALL_PIECES] |= byTypeBB[type_of(pc)] |= s;
-    byColorBB[color_of(pc)] |= s;
+  byColorBB[color_of(pc)] |= s;
-    pieceCount[pc]++;
+  pieceCount[pc]++;
-    pieceCount[make_piece(color_of(pc), ALL_PIECES)]++;
+  pieceCount[make_piece(color_of(pc), ALL_PIECES)]++;
  psq += PSQT::psq[pc][s];
 }
 inline void Position::remove_piece(Square s) {
-    Piece pc = board[s];
+  Piece pc = board[s];
-    byTypeBB[ALL_PIECES] ^= s;
+  byTypeBB[ALL_PIECES] ^= s;
-    byTypeBB[type_of(pc)] ^= s;
+  byTypeBB[type_of(pc)] ^= s;
-    byColorBB[color_of(pc)] ^= s;
+  byColorBB[color_of(pc)] ^= s;
-    board[s] = NO_PIECE;
+  board[s] = NO_PIECE;
-    pieceCount[pc]--;
+  pieceCount[pc]--;
-    pieceCount[make_piece(color_of(pc), ALL_PIECES)]--;
+  pieceCount[make_piece(color_of(pc), ALL_PIECES)]--;
  psq -= PSQT::psq[pc][s];
 }
 inline void Position::move_piece(Square from, Square to) {
-    Piece    pc     = board[from];
+  Piece pc = board[from];
-    Bitboard fromTo = from | to;
+  Bitboard fromTo = from | to;
-    byTypeBB[ALL_PIECES] ^= fromTo;
+  byTypeBB[ALL_PIECES] ^= fromTo;
-    byTypeBB[type_of(pc)] ^= fromTo;
+  byTypeBB[type_of(pc)] ^= fromTo;
-    byColorBB[color_of(pc)] ^= fromTo;
+  byColorBB[color_of(pc)] ^= fromTo;
-    board[from] = NO_PIECE;
+  board[from] = NO_PIECE;
-    board[to]   = pc;
+  board[to] = pc;
  psq += PSQT::psq[pc][to] - PSQT::psq[pc][from];
 }
-inline void Position::do_move(Move m, StateInfo& newSt, const TranspositionTable* tt = nullptr) {
+inline void Position::do_move(Move m, StateInfo& newSt) {
-    do_move(m, newSt, gives_check(m), tt);
+  do_move(m, newSt, gives_check(m));
 }
-inline StateInfo* Position::state() const { return st; }
+inline StateInfo* Position::state() const {
-}  // namespace Stockfish
+  return st;
 }
-#endif  // #ifndef POSITION_H_INCLUDED
+static const char* const StartFEN = "rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1";
 } // namespace Stockfish
 #endif // #ifndef POSITION_H_INCLUDED
@@ -0,0 +1,131 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "psqt.h"
 #include <algorithm>
 #include "bitboard.h"
 #include "types.h"
 namespace Stockfish {
 namespace
 {
 auto constexpr S = make_score;
 // 'Bonus' contains Piece-Square parameters.
 // Scores are explicit for files A to D, implicitly mirrored for E to H.
 constexpr Score Bonus[][RANK_NB][int(FILE_NB) / 2] = {
  { },
  { },
  { // Knight
   { S(-175, -96), S(-92,-65), S(-74,-49), S(-73,-21) },
   { S( -77, -67), S(-41,-54), S(-27,-18), S(-15,  8) },
   { S( -61, -40), S(-17,-27), S(  6, -8), S( 12, 29) },
   { S( -35, -35), S(  8, -2), S( 40, 13), S( 49, 28) },
   { S( -34, -45), S( 13,-16), S( 44,  9), S( 51, 39) },
   { S(  -9, -51), S( 22,-44), S( 58,-16), S( 53, 17) },
   { S( -67, -69), S(-27,-50), S(  4,-51), S( 37, 12) },
   { S(-201,-100), S(-83,-88), S(-56,-56), S(-26,-17) }
  },
  { // Bishop
   { S(-37,-40), S(-4 ,-21), S( -6,-26), S(-16, -8) },
   { S(-11,-26), S(  6, -9), S( 13,-12), S(  3,  1) },
   { S(-5 ,-11), S( 15, -1), S( -4, -1), S( 12,  7) },
   { S(-4 ,-14), S(  8, -4), S( 18,  0), S( 27, 12) },
   { S(-8 ,-12), S( 20, -1), S( 15,-10), S( 22, 11) },
   { S(-11,-21), S(  4,  4), S(  1,  3), S(  8,  4) },
   { S(-12,-22), S(-10,-14), S(  4, -1), S(  0,  1) },
   { S(-34,-32), S(  1,-29), S(-10,-26), S(-16,-17) }
  },
  { // Rook
   { S(-31, -9), S(-20,-13), S(-14,-10), S(-5, -9) },
   { S(-21,-12), S(-13, -9), S( -8, -1), S( 6, -2) },
   { S(-25,  6), S(-11, -8), S( -1, -2), S( 3, -6) },
   { S(-13, -6), S( -5,  1), S( -4, -9), S(-6,  7) },
   { S(-27, -5), S(-15,  8), S( -4,  7), S( 3, -6) },
   { S(-22,  6), S( -2,  1), S(  6, -7), S(12, 10) },
   { S( -2,  4), S( 12,  5), S( 16, 20), S(18, -5) },
   { S(-17, 18), S(-19,  0), S( -1, 19), S( 9, 13) }
  },
  { // Queen
   { S( 3,-69), S(-5,-57), S(-5,-47), S( 4,-26) },
   { S(-3,-54), S( 5,-31), S( 8,-22), S(12, -4) },
   { S(-3,-39), S( 6,-18), S(13, -9), S( 7,  3) },
   { S( 4,-23), S( 5, -3), S( 9, 13), S( 8, 24) },
   { S( 0,-29), S(14, -6), S(12,  9), S( 5, 21) },
   { S(-4,-38), S(10,-18), S( 6,-11), S( 8,  1) },
   { S(-5,-50), S( 6,-27), S(10,-24), S( 8, -8) },
   { S(-2,-74), S(-2,-52), S( 1,-43), S(-2,-34) }
  },
  { // King
   { S(271,  1), S(327, 45), S(271, 85), S(198, 76) },
   { S(278, 53), S(303,100), S(234,133), S(179,135) },
   { S(195, 88), S(258,130), S(169,169), S(120,175) },
   { S(164,103), S(190,156), S(138,172), S( 98,172) },
   { S(154, 96), S(179,166), S(105,199), S( 70,199) },
   { S(123, 92), S(145,172), S( 81,184), S( 31,191) },
   { S( 88, 47), S(120,121), S( 65,116), S( 33,131) },
   { S( 59, 11), S( 89, 59), S( 45, 73), S( -1, 78) }
  }
 };
 constexpr Score PBonus[RANK_NB][FILE_NB] =
  { // Pawn (asymmetric distribution)
   { },
   { S(  2, -8), S(  4, -6), S( 11,  9), S( 18,  5), S( 16, 16), S( 21,  6), S(  9, -6), S( -3,-18) },
   { S( -9, -9), S(-15, -7), S( 11,-10), S( 15,  5), S( 31,  2), S( 23,  3), S(  6, -8), S(-20, -5) },
   { S( -3,  7), S(-20,  1), S(  8, -8), S( 19, -2), S( 39,-14), S( 17,-13), S(  2,-11), S( -5, -6) },
   { S( 11, 12), S( -4,  6), S(-11,  2), S(  2, -6), S( 11, -5), S(  0, -4), S(-12, 14), S(  5,  9) },
   { S(  3, 27), S(-11, 18), S( -6, 19), S( 22, 29), S( -8, 30), S( -5,  9), S(-14,  8), S(-11, 14) },
   { S( -7, -1), S(  6,-14), S( -2, 13), S(-11, 22), S(  4, 24), S(-14, 17), S( 10,  7), S( -9,  7) }
  };
 } // namespace
 namespace PSQT
 {
 Score psq[PIECE_NB][SQUARE_NB];
 // PSQT::init() initializes piece-square tables: the white halves of the tables are
 // copied from Bonus[] and PBonus[], adding the piece value, then the black halves of
 // the tables are initialized by flipping and changing the sign of the white scores.
 void init() {
  for (Piece pc : {W_PAWN, W_KNIGHT, W_BISHOP, W_ROOK, W_QUEEN, W_KING})
  {
    Score score = make_score(PieceValue[MG][pc], PieceValue[EG][pc]);
    for (Square s = SQ_A1; s <= SQ_H8; ++s)
    {
      File f = File(edge_distance(file_of(s)));
      psq[ pc][s] = score + (type_of(pc) == PAWN ? PBonus[rank_of(s)][file_of(s)]
                                                 : Bonus[pc][rank_of(s)][f]);
      psq[~pc][flip_rank(s)] = -psq[pc][s];
    }
  }
 }
 } // namespace PSQT
 } // namespace Stockfish
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -16,27 +16,23 @@
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef BENCHMARK_H_INCLUDED
 #define BENCHMARK_H_INCLUDED
-#include <iosfwd>
+#ifndef PSQT_H_INCLUDED
-#include <string>
+#define PSQT_H_INCLUDED
 #include <vector>
 namespace Stockfish::Benchmark {
-std::vector<std::string> setup_bench(const std::string&, std::istream&);
+#include "types.h"
 struct BenchmarkSetup {
    int                      ttSize;
    int                      threads;
    std::vector<std::string> commands;
    std::string              originalInvocation;
    std::string              filledInvocation;
 };
-BenchmarkSetup setup_benchmark(std::istream&);
+namespace Stockfish::PSQT
 {
-}  // namespace Stockfish
+extern Score psq[PIECE_NB][SQUARE_NB];
-#endif  // #ifndef BENCHMARK_H_INCLUDED
+// Fill psqt array from a set of internally linked parameters
 extern void init();
 } // namespace Stockfish::PSQT
 #endif // PSQT_H_INCLUDED
@@ -1,48 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "score.h"
 #include <cassert>
 #include <cmath>
 #include <cstdlib>
 #include "uci.h"
 namespace Stockfish {
 Score::Score(Value v, const Position& pos) {
    assert(-VALUE_INFINITE < v && v < VALUE_INFINITE);
    if (!is_decisive(v))
    {
        score = InternalUnits{UCIEngine::to_cp(v, pos)};
    }
    else if (std::abs(v) <= VALUE_TB)
    {
        auto distance = VALUE_TB - std::abs(v);
        score         = (v > 0) ? Tablebase{distance, true} : Tablebase{-distance, false};
    }
    else
    {
        auto distance = VALUE_MATE - std::abs(v);
        score         = (v > 0) ? Mate{distance} : Mate{-distance};
    }
 }
 }
@@ -1,70 +0,0 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef SCORE_H_INCLUDED
 #define SCORE_H_INCLUDED
 #include <variant>
 #include <utility>
 #include "types.h"
 namespace Stockfish {
 class Position;
 class Score {
   public:
    struct Mate {
        int plies;
    };
    struct Tablebase {
        int  plies;
        bool win;
    };
    struct InternalUnits {
        int value;
    };
    Score() = default;
    Score(Value v, const Position& pos);
    template<typename T>
    bool is() const {
        return std::holds_alternative<T>(score);
    }
    template<typename T>
    T get() const {
        return std::get<T>(score);
    }
    template<typename F>
    decltype(auto) visit(F&& f) const {
        return std::visit(std::forward<F>(f), score);
    }
   private:
    std::variant<Mate, Tablebase, InternalUnits> score;
 };
 }
 #endif  // #ifndef SCORE_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -19,348 +19,132 @@
 #ifndef SEARCH_H_INCLUDED
 #define SEARCH_H_INCLUDED
 #include <algorithm>
 #include <array>
 #include <atomic>
 #include <cassert>
 #include <cstddef>
 #include <cstdint>
 #include <functional>
 #include <memory>
 #include <string>
 #include <string_view>
 #include <vector>
 #include "history.h"
 #include "misc.h"
-#include "nnue/network.h"
+#include "movepick.h"
 #include "nnue/nnue_accumulator.h"
 #include "numa.h"
 #include "position.h"
 #include "score.h"
 #include "syzygy/tbprobe.h"
 #include "timeman.h"
 #include "types.h"
 #include "uci.h"
 namespace Stockfish {
-// Different node types, used as a template parameter
+class Position;
 enum NodeType {
    NonPV,
    PV,
    Root
 };
 class TranspositionTable;
 class ThreadPool;
 class OptionsMap;
 namespace Search {
-// Stack struct keeps track of the information we need to remember from nodes
+/// Threshold used for countermoves based pruning
-// shallower and deeper in the tree during the search. Each search thread has
+constexpr int CounterMovePruneThreshold = 0;
-// its own array of Stack objects, indexed by the current ply.
+
 extern bool prune_at_shallow_depth;
 /// Stack struct keeps track of the information we need to remember from nodes
 /// shallower and deeper in the tree during the search. Each search thread has
 /// its own array of Stack objects, indexed by the current ply.
 struct Stack {
-    Move*                       pv;
+  Move* pv;
-    PieceToHistory*             continuationHistory;
+  PieceToHistory* continuationHistory;
-    CorrectionHistory<PieceTo>* continuationCorrectionHistory;
+  int ply;
-    int                         ply;
+  Move currentMove;
-    Move                        currentMove;
+  Move excludedMove;
-    Move                        excludedMove;
+  Move killers[2];
-    Value                       staticEval;
+  Value staticEval;
-    int                         statScore;
+  int statScore;
-    int                         moveCount;
+  int moveCount;
-    bool                        inCheck;
+  bool inCheck;
-    bool                        ttPv;
+  bool ttPv;
-    bool                        ttHit;
+  bool ttHit;
-    int                         cutoffCnt;
+  int doubleExtensions;
-    int                         reduction;
+  int cutoffCnt;
    bool                        isTTMove;
 };
-// RootMove struct is used for moves at the root of the tree. For each root move
+/// RootMove struct is used for moves at the root of the tree. For each root move
-// we store a score and a PV (really a refutation in the case of moves which
+/// we store a score and a PV (really a refutation in the case of moves which
-// fail low). Score is normally set at -VALUE_INFINITE for all non-pv moves.
+/// fail low). Score is normally set at -VALUE_INFINITE for all non-pv moves.
 struct RootMove {
-    explicit RootMove(Move m) :
+  explicit RootMove(Move m) : pv(1, m) {}
-        pv(1, m) {}
+  bool extract_ponder_from_tt(Position& pos);
-    bool extract_ponder_from_tt(const TranspositionTable& tt, Position& pos);
+  bool operator==(const Move& m) const { return pv[0] == m; }
-    bool operator==(const Move& m) const { return pv[0] == m; }
+  bool operator<(const RootMove& m) const { // Sort in descending order
-    // Sort in descending order
+    return m.score != score ? m.score < score
-    bool operator<(const RootMove& m) const {
+                            : m.previousScore < previousScore;
-        return m.score != score ? m.score < score : m.previousScore < previousScore;
+  }
    }
-    uint64_t          effort           = 0;
+  Value score = -VALUE_INFINITE;
-    Value             score            = -VALUE_INFINITE;
+  Value previousScore = -VALUE_INFINITE;
-    Value             previousScore    = -VALUE_INFINITE;
+  Value averageScore = -VALUE_INFINITE;
-    Value             averageScore     = -VALUE_INFINITE;
+  int selDepth = 0;
-    Value             meanSquaredScore = -VALUE_INFINITE * VALUE_INFINITE;
+  int tbRank = 0;
-    Value             uciScore         = -VALUE_INFINITE;
+  Value tbScore;
-    bool              scoreLowerbound  = false;
+  std::vector<Move> pv;
    bool              scoreUpperbound  = false;
    int               selDepth         = 0;
    int               tbRank           = 0;
    Value             tbScore;
    std::vector<Move> pv;
 };
-using RootMoves = std::vector<RootMove>;
+typedef std::vector<RootMove> RootMoves;
-// LimitsType struct stores information sent by the caller about the analysis required.
+/// LimitsType struct stores information sent by GUI about available time to
 /// search the current move, maximum depth/time, or if we are in analysis mode.
 struct LimitsType {
-    // Init explicitly due to broken value-initialization of non POD in MSVC
+  LimitsType() { // Init explicitly due to broken value-initialization of non POD in MSVC
-    LimitsType() {
+    time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = npmsec = movetime = TimePoint(0);
-        time[WHITE] = time[BLACK] = inc[WHITE] = inc[BLACK] = npmsec = movetime = TimePoint(0);
+    movestogo = depth = mate = perft = infinite = 0;
-        movestogo = depth = mate = perft = infinite = 0;
+    nodes = 0;
-        nodes                                       = 0;
+    silent = false;
-        ponderMode                                  = false;
+  }
    }
-    bool use_time_management() const { return time[WHITE] || time[BLACK]; }
+  bool use_time_management() const {
    return time[WHITE] || time[BLACK];
  }
-    std::vector<std::string> searchmoves;
+  std::vector<Move> searchmoves;
-    TimePoint                time[COLOR_NB], inc[COLOR_NB], npmsec, movetime, startTime;
+  TimePoint time[COLOR_NB], inc[COLOR_NB], npmsec, movetime, startTime;
-    int                      movestogo, depth, mate, perft, infinite;
+  int movestogo, depth, mate, perft, infinite;
-    uint64_t                 nodes;
+  int64_t nodes;
-    bool                     ponderMode;
+  // Silent mode that does not output to the screen (for continuous self-play in process)
  // Do not output PV at this time.
  bool silent;
 };
 extern LimitsType Limits;
-// The UCI stores the uci options, thread pool, and transposition table.
+void init();
-// This struct is used to easily forward data to the Search::Worker class.
+void clear();
 struct SharedState {
    SharedState(const OptionsMap&                               optionsMap,
                ThreadPool&                                     threadPool,
                TranspositionTable&                             transpositionTable,
                const LazyNumaReplicated<Eval::NNUE::Networks>& nets) :
        options(optionsMap),
        threads(threadPool),
        tt(transpositionTable),
        networks(nets) {}
-    const OptionsMap&                               options;
+// A pair of reader and evaluation value. Returned by Tools::search(),Tools::qsearch().
-    ThreadPool&                                     threads;
+using ValueAndPV = std::pair<Value, std::vector<Move>>;
    TranspositionTable&                             tt;
    const LazyNumaReplicated<Eval::NNUE::Networks>& networks;
 };
-class Worker;
+ValueAndPV qsearch(Position& pos);
 ValueAndPV search(Position& pos, int depth_, size_t multiPV = 1, uint64_t nodesLimit = 0);
-// Null Object Pattern, implement a common interface for the SearchManagers.
+namespace MCTS {
 // A Null Object will be given to non-mainthread workers.
 class ISearchManager {
   public:
    virtual ~ISearchManager() {}
    virtual void check_time(Search::Worker&) = 0;
 };
-struct InfoShort {
+  struct MctsContinuation {
-    int   depth;
+    std::uint64_t numVisits;
-    Score score;
+    Value value;
-};
+    float actionValue;
    std::vector<Move> pv;
  };
-struct InfoFull: InfoShort {
+  ValueAndPV search_mcts(
-    int              selDepth;
+    Position& pos,
-    size_t           multiPV;
+    std::uint64_t nodes,
-    std::string_view wdl;
+    Depth leafDepth,
-    std::string_view bound;
+    float explorationFactor);
    size_t           timeMs;
    size_t           nodes;
    size_t           nps;
    size_t           tbHits;
    std::string_view pv;
    int              hashfull;
 };
-struct InfoIteration {
+  std::vector<MctsContinuation> search_mcts_multipv(
-    int              depth;
+    Position& pos,
-    std::string_view currmove;
+    std::uint64_t numPlayouts,
-    size_t           currmovenumber;
+    Depth leafDepth,
-};
+    float explorationFactor);
 }
-// Skill structure is used to implement strength limit. If we have a UCI_Elo,
+}
 // we convert it to an appropriate skill level, anchored to the Stash engine.
 // This method is based on a fit of the Elo results for games played between
 // Stockfish at various skill levels and various versions of the Stash engine.
 // Skill 0 .. 19 now covers CCRL Blitz Elo from 1320 to 3190, approximately
 // Reference: https://github.com/vondele/Stockfish/commit/a08b8d4e9711c2
 struct Skill {
    // Lowest and highest Elo ratings used in the skill level calculation
    constexpr static int LowestElo  = 1320;
    constexpr static int HighestElo = 3190;
-    Skill(int skill_level, int uci_elo) {
+} // namespace Stockfish
        if (uci_elo)
        {
            double e = double(uci_elo - LowestElo) / (HighestElo - LowestElo);
            level = std::clamp((((37.2473 * e - 40.8525) * e + 22.2943) * e - 0.311438), 0.0, 19.0);
        }
        else
            level = double(skill_level);
    }
    bool enabled() const { return level < 20.0; }
    bool time_to_pick(Depth depth) const { return depth == 1 + int(level); }
    Move pick_best(const RootMoves&, size_t multiPV);
-    double level;
+#endif // #ifndef SEARCH_H_INCLUDED
    Move   best = Move::none();
 };
 // SearchManager manages the search from the main thread. It is responsible for
 // keeping track of the time, and storing data strictly related to the main thread.
 class SearchManager: public ISearchManager {
   public:
    using UpdateShort    = std::function<void(const InfoShort&)>;
    using UpdateFull     = std::function<void(const InfoFull&)>;
    using UpdateIter     = std::function<void(const InfoIteration&)>;
    using UpdateBestmove = std::function<void(std::string_view, std::string_view)>;
    struct UpdateContext {
        UpdateShort    onUpdateNoMoves;
        UpdateFull     onUpdateFull;
        UpdateIter     onIter;
        UpdateBestmove onBestmove;
    };
    SearchManager(const UpdateContext& updateContext) :
        updates(updateContext) {}
    void check_time(Search::Worker& worker) override;
    void pv(Search::Worker&           worker,
            const ThreadPool&         threads,
            const TranspositionTable& tt,
            Depth                     depth);
    Stockfish::TimeManagement tm;
    double                    originalTimeAdjust;
    int                       callsCnt;
    std::atomic_bool          ponder;
    std::array<Value, 4> iterValue;
    double               previousTimeReduction;
    Value                bestPreviousScore;
    Value                bestPreviousAverageScore;
    bool                 stopOnPonderhit;
    size_t id;
    const UpdateContext& updates;
 };
 class NullSearchManager: public ISearchManager {
   public:
    void check_time(Search::Worker&) override {}
 };
 // Search::Worker is the class that does the actual search.
 // It is instantiated once per thread, and it is responsible for keeping track
 // of the search history, and storing data required for the search.
 class Worker {
   public:
    Worker(SharedState&, std::unique_ptr<ISearchManager>, size_t, NumaReplicatedAccessToken);
    // Called at instantiation to initialize reductions tables.
    // Reset histories, usually before a new game.
    void clear();
    // Called when the program receives the UCI 'go' command.
    // It searches from the root position and outputs the "bestmove".
    void start_searching();
    bool is_mainthread() const { return threadIdx == 0; }
    void ensure_network_replicated();
    // Public because they need to be updatable by the stats
    ButterflyHistory mainHistory;
    LowPlyHistory    lowPlyHistory;
    CapturePieceToHistory captureHistory;
    ContinuationHistory   continuationHistory[2][2];
    PawnHistory           pawnHistory;
    CorrectionHistory<Pawn>         pawnCorrectionHistory;
    CorrectionHistory<Minor>        minorPieceCorrectionHistory;
    CorrectionHistory<NonPawn>      nonPawnCorrectionHistory[COLOR_NB];
    CorrectionHistory<Continuation> continuationCorrectionHistory;
   private:
    void iterative_deepening();
    // This is the main search function, for both PV and non-PV nodes
    template<NodeType nodeType>
    Value search(Position& pos, Stack* ss, Value alpha, Value beta, Depth depth, bool cutNode);
    // Quiescence search function, which is called by the main search
    template<NodeType nodeType>
    Value qsearch(Position& pos, Stack* ss, Value alpha, Value beta);
    Depth reduction(bool i, Depth d, int mn, int delta) const;
    // Pointer to the search manager, only allowed to be called by the main thread
    SearchManager* main_manager() const {
        assert(threadIdx == 0);
        return static_cast<SearchManager*>(manager.get());
    }
    TimePoint elapsed() const;
    TimePoint elapsed_time() const;
    Value evaluate(const Position&);
    LimitsType limits;
    size_t                pvIdx, pvLast;
    std::atomic<uint64_t> nodes, tbHits, bestMoveChanges;
    int                   selDepth, nmpMinPly;
    Value optimism[COLOR_NB];
    Position  rootPos;
    StateInfo rootState;
    RootMoves rootMoves;
    Depth     rootDepth, completedDepth;
    Value     rootDelta;
    size_t                    threadIdx;
    NumaReplicatedAccessToken numaAccessToken;
    // Reductions lookup table initialized at startup
    std::array<int, MAX_MOVES> reductions;  // [depth or moveNumber]
    // The main thread has a SearchManager, the others have a NullSearchManager
    std::unique_ptr<ISearchManager> manager;
    Tablebases::Config tbConfig;
    const OptionsMap&                               options;
    ThreadPool&                                     threads;
    TranspositionTable&                             tt;
    const LazyNumaReplicated<Eval::NNUE::Networks>& networks;
    // Used by NNUE
    Eval::NNUE::AccumulatorCaches refreshTable;
    friend class Stockfish::ThreadPool;
    friend class SearchManager;
 };
 struct ConthistBonus {
    int index;
    int weight;
 };
 }  // namespace Search
 }  // namespace Stockfish
 #endif  // #ifndef SEARCH_H_INCLUDED
@@ -0,0 +1,387 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.
  Stockfish 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 General Public License for more details.
  You should have received a copy of the GNU General Public License
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #ifndef STOCKFISH_SIMD_H_INCLUDED
 #define STOCKFISH_SIMD_H_INCLUDED
 #if defined(USE_AVX2)
 # include <immintrin.h>
 #elif defined(USE_SSE41)
 # include <smmintrin.h>
 #elif defined(USE_SSSE3)
 # include <tmmintrin.h>
 #elif defined(USE_SSE2)
 # include <emmintrin.h>
 #elif defined(USE_MMX)
 # include <mmintrin.h>
 #elif defined(USE_NEON)
 # include <arm_neon.h>
 #endif
 // The inline asm is only safe for GCC, where it is necessary to get good codegen.
 // See https://gcc.gnu.org/bugzilla/show_bug.cgi?id=101693
 // Clang does fine without it.
 // Play around here: https://godbolt.org/z/7EWqrYq51
 #if (defined(__GNUC__) && !defined(__clang__) && !defined(__INTEL_COMPILER))
 #define USE_INLINE_ASM
 #endif
 // Use either the AVX512 or AVX-VNNI version of the VNNI instructions.
 #if defined(USE_AVXVNNI)
 #define VNNI_PREFIX "%{vex%} "
 #else
 #define VNNI_PREFIX ""
 #endif
 namespace Stockfish::Simd {
 #if defined (USE_AVX512)
    [[maybe_unused]] static int m512_hadd(__m512i sum, int bias) {
      return _mm512_reduce_add_epi32(sum) + bias;
    }
    /*
      Parameters:
        sum0 = [zmm0.i128[0], zmm0.i128[1], zmm0.i128[2], zmm0.i128[3]]
        sum1 = [zmm1.i128[0], zmm1.i128[1], zmm1.i128[2], zmm1.i128[3]]
        sum2 = [zmm2.i128[0], zmm2.i128[1], zmm2.i128[2], zmm2.i128[3]]
        sum3 = [zmm3.i128[0], zmm3.i128[1], zmm3.i128[2], zmm3.i128[3]]
      Returns:
        ret = [
          reduce_add_epi32(zmm0.i128[0]), reduce_add_epi32(zmm1.i128[0]), reduce_add_epi32(zmm2.i128[0]), reduce_add_epi32(zmm3.i128[0]),
          reduce_add_epi32(zmm0.i128[1]), reduce_add_epi32(zmm1.i128[1]), reduce_add_epi32(zmm2.i128[1]), reduce_add_epi32(zmm3.i128[1]),
          reduce_add_epi32(zmm0.i128[2]), reduce_add_epi32(zmm1.i128[2]), reduce_add_epi32(zmm2.i128[2]), reduce_add_epi32(zmm3.i128[2]),
          reduce_add_epi32(zmm0.i128[3]), reduce_add_epi32(zmm1.i128[3]), reduce_add_epi32(zmm2.i128[3]), reduce_add_epi32(zmm3.i128[3])
        ]
    */
    [[maybe_unused]] static __m512i m512_hadd128x16_interleave(
        __m512i sum0, __m512i sum1, __m512i sum2, __m512i sum3) {
      __m512i sum01a = _mm512_unpacklo_epi32(sum0, sum1);
      __m512i sum01b = _mm512_unpackhi_epi32(sum0, sum1);
      __m512i sum23a = _mm512_unpacklo_epi32(sum2, sum3);
      __m512i sum23b = _mm512_unpackhi_epi32(sum2, sum3);
      __m512i sum01 = _mm512_add_epi32(sum01a, sum01b);
      __m512i sum23 = _mm512_add_epi32(sum23a, sum23b);
      __m512i sum0123a = _mm512_unpacklo_epi64(sum01, sum23);
      __m512i sum0123b = _mm512_unpackhi_epi64(sum01, sum23);
      return _mm512_add_epi32(sum0123a, sum0123b);
    }
    [[maybe_unused]] static __m128i m512_haddx4(
        __m512i sum0, __m512i sum1, __m512i sum2, __m512i sum3,
        __m128i bias) {
      __m512i sum = m512_hadd128x16_interleave(sum0, sum1, sum2, sum3);
      __m256i sum256lo = _mm512_castsi512_si256(sum);
      __m256i sum256hi = _mm512_extracti64x4_epi64(sum, 1);
      sum256lo = _mm256_add_epi32(sum256lo, sum256hi);
      __m128i sum128lo = _mm256_castsi256_si128(sum256lo);
      __m128i sum128hi = _mm256_extracti128_si256(sum256lo, 1);
      return _mm_add_epi32(_mm_add_epi32(sum128lo, sum128hi), bias);
    }
    [[maybe_unused]] static void m512_add_dpbusd_epi32(
        __m512i& acc,
        __m512i a,
        __m512i b) {
 # if defined (USE_VNNI)
 #   if defined (USE_INLINE_ASM)
      asm(
        "vpdpbusd %[b], %[a], %[acc]\n\t"
        : [acc]"+v"(acc)
        : [a]"v"(a), [b]"vm"(b)
      );
 #   else
      acc = _mm512_dpbusd_epi32(acc, a, b);
 #   endif
 # else
 #   if defined (USE_INLINE_ASM)
      __m512i tmp = _mm512_maddubs_epi16(a, b);
      asm(
          "vpmaddwd    %[tmp], %[ones], %[tmp]\n\t"
          "vpaddd      %[acc], %[tmp], %[acc]\n\t"
          : [acc]"+v"(acc), [tmp]"+&v"(tmp)
          : [ones]"v"(_mm512_set1_epi16(1))
      );
 #   else
      __m512i product0 = _mm512_maddubs_epi16(a, b);
      product0 = _mm512_madd_epi16(product0, _mm512_set1_epi16(1));
      acc = _mm512_add_epi32(acc, product0);
 #   endif
 # endif
    }
    [[maybe_unused]] static void m512_add_dpbusd_epi32x2(
        __m512i& acc,
        __m512i a0, __m512i b0,
        __m512i a1, __m512i b1) {
 # if defined (USE_VNNI)
 #   if defined (USE_INLINE_ASM)
      asm(
        "vpdpbusd %[b0], %[a0], %[acc]\n\t"
        "vpdpbusd %[b1], %[a1], %[acc]\n\t"
        : [acc]"+v"(acc)
        : [a0]"v"(a0), [b0]"vm"(b0), [a1]"v"(a1), [b1]"vm"(b1)
      );
 #   else
      acc = _mm512_dpbusd_epi32(acc, a0, b0);
      acc = _mm512_dpbusd_epi32(acc, a1, b1);
 #   endif
 # else
 #   if defined (USE_INLINE_ASM)
      __m512i tmp0 = _mm512_maddubs_epi16(a0, b0);
      __m512i tmp1 = _mm512_maddubs_epi16(a1, b1);
      asm(
          "vpaddsw     %[tmp0], %[tmp1], %[tmp0]\n\t"
          "vpmaddwd    %[tmp0], %[ones], %[tmp0]\n\t"
          "vpaddd      %[acc], %[tmp0], %[acc]\n\t"
          : [acc]"+v"(acc), [tmp0]"+&v"(tmp0)
          : [tmp1]"v"(tmp1), [ones]"v"(_mm512_set1_epi16(1))
      );
 #   else
      __m512i product0 = _mm512_maddubs_epi16(a0, b0);
      __m512i product1 = _mm512_maddubs_epi16(a1, b1);
      product0 = _mm512_adds_epi16(product0, product1);
      product0 = _mm512_madd_epi16(product0, _mm512_set1_epi16(1));
      acc = _mm512_add_epi32(acc, product0);
 #   endif
 # endif
    }
 #endif
 #if defined (USE_AVX2)
    [[maybe_unused]] static int m256_hadd(__m256i sum, int bias) {
      __m128i sum128 = _mm_add_epi32(_mm256_castsi256_si128(sum), _mm256_extracti128_si256(sum, 1));
      sum128 = _mm_add_epi32(sum128, _mm_shuffle_epi32(sum128, _MM_PERM_BADC));
      sum128 = _mm_add_epi32(sum128, _mm_shuffle_epi32(sum128, _MM_PERM_CDAB));
      return _mm_cvtsi128_si32(sum128) + bias;
    }
    [[maybe_unused]] static __m128i m256_haddx4(
        __m256i sum0, __m256i sum1, __m256i sum2, __m256i sum3,
        __m128i bias) {
      sum0 = _mm256_hadd_epi32(sum0, sum1);
      sum2 = _mm256_hadd_epi32(sum2, sum3);
      sum0 = _mm256_hadd_epi32(sum0, sum2);
      __m128i sum128lo = _mm256_castsi256_si128(sum0);
      __m128i sum128hi = _mm256_extracti128_si256(sum0, 1);
      return _mm_add_epi32(_mm_add_epi32(sum128lo, sum128hi), bias);
    }
    [[maybe_unused]] static void m256_add_dpbusd_epi32(
        __m256i& acc,
        __m256i a,
        __m256i b) {
 # if defined (USE_VNNI)
 #   if defined (USE_INLINE_ASM)
      asm(
        VNNI_PREFIX "vpdpbusd %[b], %[a], %[acc]\n\t"
        : [acc]"+v"(acc)
        : [a]"v"(a), [b]"vm"(b)
      );
 #   else
      acc = _mm256_dpbusd_epi32(acc, a, b);
 #   endif
 # else
 #   if defined (USE_INLINE_ASM)
      __m256i tmp = _mm256_maddubs_epi16(a, b);
      asm(
          "vpmaddwd    %[tmp], %[ones], %[tmp]\n\t"
          "vpaddd      %[acc], %[tmp], %[acc]\n\t"
          : [acc]"+v"(acc), [tmp]"+&v"(tmp)
          : [ones]"v"(_mm256_set1_epi16(1))
      );
 #   else
      __m256i product0 = _mm256_maddubs_epi16(a, b);
      product0 = _mm256_madd_epi16(product0, _mm256_set1_epi16(1));
      acc = _mm256_add_epi32(acc, product0);
 #   endif
 # endif
    }
    [[maybe_unused]] static void m256_add_dpbusd_epi32x2(
        __m256i& acc,
        __m256i a0, __m256i b0,
        __m256i a1, __m256i b1) {
 # if defined (USE_VNNI)
 #   if defined (USE_INLINE_ASM)
      asm(
        VNNI_PREFIX "vpdpbusd %[b0], %[a0], %[acc]\n\t"
        VNNI_PREFIX "vpdpbusd %[b1], %[a1], %[acc]\n\t"
        : [acc]"+v"(acc)
        : [a0]"v"(a0), [b0]"vm"(b0), [a1]"v"(a1), [b1]"vm"(b1)
      );
 #   else
      acc = _mm256_dpbusd_epi32(acc, a0, b0);
      acc = _mm256_dpbusd_epi32(acc, a1, b1);
 #   endif
 # else
 #   if defined (USE_INLINE_ASM)
      __m256i tmp0 = _mm256_maddubs_epi16(a0, b0);
      __m256i tmp1 = _mm256_maddubs_epi16(a1, b1);
      asm(
          "vpaddsw     %[tmp0], %[tmp1], %[tmp0]\n\t"
          "vpmaddwd    %[tmp0], %[ones], %[tmp0]\n\t"
          "vpaddd      %[acc], %[tmp0], %[acc]\n\t"
          : [acc]"+v"(acc), [tmp0]"+&v"(tmp0)
          : [tmp1]"v"(tmp1), [ones]"v"(_mm256_set1_epi16(1))
      );
 #   else
      __m256i product0 = _mm256_maddubs_epi16(a0, b0);
      __m256i product1 = _mm256_maddubs_epi16(a1, b1);
      product0 = _mm256_adds_epi16(product0, product1);
      product0 = _mm256_madd_epi16(product0, _mm256_set1_epi16(1));
      acc = _mm256_add_epi32(acc, product0);
 #   endif
 # endif
    }
 #endif
 #if defined (USE_SSSE3)
    [[maybe_unused]] static int m128_hadd(__m128i sum, int bias) {
      sum = _mm_add_epi32(sum, _mm_shuffle_epi32(sum, 0x4E)); //_MM_PERM_BADC
      sum = _mm_add_epi32(sum, _mm_shuffle_epi32(sum, 0xB1)); //_MM_PERM_CDAB
      return _mm_cvtsi128_si32(sum) + bias;
    }
    [[maybe_unused]] static __m128i m128_haddx4(
        __m128i sum0, __m128i sum1, __m128i sum2, __m128i sum3,
        __m128i bias) {
      sum0 = _mm_hadd_epi32(sum0, sum1);
      sum2 = _mm_hadd_epi32(sum2, sum3);
      sum0 = _mm_hadd_epi32(sum0, sum2);
      return _mm_add_epi32(sum0, bias);
    }
    [[maybe_unused]] static void m128_add_dpbusd_epi32(
        __m128i& acc,
        __m128i a,
        __m128i b) {
 #   if defined (USE_INLINE_ASM)
      __m128i tmp = _mm_maddubs_epi16(a, b);
      asm(
          "pmaddwd    %[ones], %[tmp]\n\t"
          "paddd      %[tmp], %[acc]\n\t"
          : [acc]"+v"(acc), [tmp]"+&v"(tmp)
          : [ones]"v"(_mm_set1_epi16(1))
      );
 #   else
      __m128i product0 = _mm_maddubs_epi16(a, b);
      product0 = _mm_madd_epi16(product0, _mm_set1_epi16(1));
      acc = _mm_add_epi32(acc, product0);
 #   endif
    }
    [[maybe_unused]] static void m128_add_dpbusd_epi32x2(
        __m128i& acc,
        __m128i a0, __m128i b0,
        __m128i a1, __m128i b1) {
 #   if defined (USE_INLINE_ASM)
      __m128i tmp0 = _mm_maddubs_epi16(a0, b0);
      __m128i tmp1 = _mm_maddubs_epi16(a1, b1);
      asm(
          "paddsw     %[tmp1], %[tmp0]\n\t"
          "pmaddwd    %[ones], %[tmp0]\n\t"
          "paddd      %[tmp0], %[acc]\n\t"
          : [acc]"+v"(acc), [tmp0]"+&v"(tmp0)
          : [tmp1]"v"(tmp1), [ones]"v"(_mm_set1_epi16(1))
      );
 #   else
      __m128i product0 = _mm_maddubs_epi16(a0, b0);
      __m128i product1 = _mm_maddubs_epi16(a1, b1);
      product0 = _mm_adds_epi16(product0, product1);
      product0 = _mm_madd_epi16(product0, _mm_set1_epi16(1));
      acc = _mm_add_epi32(acc, product0);
 #   endif
    }
 #endif
 #if defined (USE_NEON)
    [[maybe_unused]] static int neon_m128_reduce_add_epi32(int32x4_t s) {
 #   if USE_NEON >= 8
      return vaddvq_s32(s);
 #   else
      return s[0] + s[1] + s[2] + s[3];
 #   endif
    }
    [[maybe_unused]] static int neon_m128_hadd(int32x4_t sum, int bias) {
      return neon_m128_reduce_add_epi32(sum) + bias;
    }
    [[maybe_unused]] static int32x4_t neon_m128_haddx4(
        int32x4_t sum0, int32x4_t sum1, int32x4_t sum2, int32x4_t sum3,
        int32x4_t bias) {
      int32x4_t hsums {
        neon_m128_reduce_add_epi32(sum0),
        neon_m128_reduce_add_epi32(sum1),
        neon_m128_reduce_add_epi32(sum2),
        neon_m128_reduce_add_epi32(sum3)
      };
      return vaddq_s32(hsums, bias);
    }
    [[maybe_unused]] static void neon_m128_add_dpbusd_epi32x2(
        int32x4_t& acc,
        int8x8_t a0, int8x8_t b0,
        int8x8_t a1, int8x8_t b1) {
      int16x8_t product = vmull_s8(a0, b0);
      product = vmlal_s8(product, a1, b1);
      acc = vpadalq_s16(acc, product);
    }
 #endif
 }
 #endif // STOCKFISH_SIMD_H_INCLUDED
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -19,60 +19,60 @@
 #ifndef TBPROBE_H
 #define TBPROBE_H
-#include <string>
+#include <ostream>
 #include <vector>
-
+#include "../search.h"
 namespace Stockfish {
 class Position;
 class OptionsMap;
 using Depth = int;
 namespace Search {
 struct RootMove;
 using RootMoves = std::vector<RootMove>;
 }
 }
 namespace Stockfish::Tablebases {
 struct Config {
    int   cardinality = 0;
    bool  rootInTB    = false;
    bool  useRule50   = false;
    Depth probeDepth  = 0;
 };
 enum WDLScore {
-    WDLLoss        = -2,  // Loss
+    WDLLoss        = -2, // Loss
-    WDLBlessedLoss = -1,  // Loss, but draw under 50-move rule
+    WDLBlessedLoss = -1, // Loss, but draw under 50-move rule
-    WDLDraw        = 0,   // Draw
+    WDLDraw        =  0, // Draw
-    WDLCursedWin   = 1,   // Win, but draw under 50-move rule
+    WDLCursedWin   =  1, // Win, but draw under 50-move rule
-    WDLWin         = 2,   // Win
+    WDLWin         =  2, // Win
    WDLScoreNone  = -1000
 };
 // Possible states after a probing operation
 enum ProbeState {
-    FAIL              = 0,   // Probe failed (missing file table)
+    FAIL              =  0, // Probe failed (missing file table)
-    OK                = 1,   // Probe successful
+    OK                =  1, // Probe successful
-    CHANGE_STM        = -1,  // DTZ should check the other side
+    CHANGE_STM        = -1, // DTZ should check the other side
-    ZEROING_BEST_MOVE = 2    // Best move zeroes DTZ (capture or pawn move)
+    ZEROING_BEST_MOVE =  2  // Best move zeroes DTZ (capture or pawn move)
 };
 extern int MaxCardinality;
-
+void init(const std::string& paths);
 void     init(const std::string& paths);
 WDLScore probe_wdl(Position& pos, ProbeState* result);
-int      probe_dtz(Position& pos, ProbeState* result);
+int probe_dtz(Position& pos, ProbeState* result);
-bool     root_probe(Position& pos, Search::RootMoves& rootMoves, bool rule50, bool rankDTZ);
+bool root_probe(Position& pos, Search::RootMoves& rootMoves);
-bool     root_probe_wdl(Position& pos, Search::RootMoves& rootMoves, bool rule50);
+bool root_probe_wdl(Position& pos, Search::RootMoves& rootMoves);
-Config   rank_root_moves(const OptionsMap&  options,
+void rank_root_moves(Position& pos, Search::RootMoves& rootMoves);
                         Position&          pos,
                         Search::RootMoves& rootMoves,
                         bool               rankDTZ = false);
-}  // namespace Stockfish::Tablebases
+inline std::ostream& operator<<(std::ostream& os, const WDLScore v) {
    os << (v == WDLLoss        ? "Loss" :
           v == WDLBlessedLoss ? "Blessed loss" :
           v == WDLDraw        ? "Draw" :
           v == WDLCursedWin   ? "Cursed win" :
           v == WDLWin         ? "Win" : "None");
    return os;
 }
 inline std::ostream& operator<<(std::ostream& os, const ProbeState v) {
    os << (v == FAIL              ? "Failed" :
           v == OK                ? "Success" :
           v == CHANGE_STM        ? "Probed opponent side" :
           v == ZEROING_BEST_MOVE ? "Best move zeroes DTZ" : "None");
    return os;
 }
 } // namespace Stockfish::Tablebases
 #endif
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -16,395 +16,288 @@
  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 #include "thread.h"
 #include <algorithm>
 #include <cassert>
 #include <deque>
 #include <memory>
 #include <string>
 #include <unordered_map>
 #include <utility>
 #include <algorithm> // For std::count
 #include "movegen.h"
 #include "search.h"
-#include "syzygy/tbprobe.h"
+#include "thread.h"
 #include "timeman.h"
 #include "types.h"
 #include "uci.h"
-#include "ucioption.h"
+#include "syzygy/tbprobe.h"
 #include "tt.h"
 namespace Stockfish {
-// Constructor launches the thread and waits until it goes to sleep
+ThreadPool Threads; // Global object
 // in idle_loop(). Note that 'searching' and 'exit' should be already set.
 Thread::Thread(Search::SharedState&                    sharedState,
               std::unique_ptr<Search::ISearchManager> sm,
               size_t                                  n,
               OptionalThreadToNumaNodeBinder          binder) :
    idx(n),
    nthreads(sharedState.options["Threads"]),
    stdThread(&Thread::idle_loop, this) {
    wait_for_search_finished();
-    run_custom_job([this, &binder, &sharedState, &sm, n]() {
+/// Thread constructor launches the thread and waits until it goes to sleep
-        // Use the binder to [maybe] bind the threads to a NUMA node before doing
+/// in idle_loop(). Note that 'searching' and 'exit' should be already set.
        // the Worker allocation. Ideally we would also allocate the SearchManager
        // here, but that's minor.
        this->numaAccessToken = binder();
        this->worker =
          std::make_unique<Search::Worker>(sharedState, std::move(sm), n, this->numaAccessToken);
    });
-    wait_for_search_finished();
+Thread::Thread(size_t n) : idx(n), stdThread(&Thread::idle_loop, this), maxNodes(0) {
  wait_for_search_finished();
  wait_for_worker_finished();
 }
-// Destructor wakes up the thread in idle_loop() and waits
+/// Thread destructor wakes up the thread in idle_loop() and waits
-// for its termination. Thread should be already waiting.
+/// for its termination. Thread should be already waiting.
 Thread::~Thread() {
-    assert(!searching);
+  assert(!searching);
-    exit = true;
+  exit = true;
-    start_searching();
+  start_searching();
-    stdThread.join();
+  stdThread.join();
 }
-// Wakes up the thread that will start the search
+
 /// Thread::clear() reset histories, usually before a new game
 void Thread::clear() {
  counterMoves.fill(MOVE_NONE);
  mainHistory.fill(0);
  captureHistory.fill(0);
  previousDepth = 0;
  for (bool inCheck : { false, true })
      for (StatsType c : { NoCaptures, Captures })
      {
          for (auto& to : continuationHistory[inCheck][c])
                for (auto& h : to)
                      h->fill(-71);
          continuationHistory[inCheck][c][NO_PIECE][0]->fill(Search::CounterMovePruneThreshold - 1);
      }
 }
 /// Thread::start_searching() wakes up the thread that will start the search
 void Thread::start_searching() {
-    assert(worker != nullptr);
+
-    run_custom_job([this]() { worker->start_searching(); });
+  std::lock_guard<std::mutex> lk(mutex);
  searching = true;
  cv.notify_one(); // Wake up the thread in idle_loop()
 }
-// Clears the histories for the thread worker (usually before a new game)
+void Thread::execute_with_worker(std::function<void(Thread&)> t)
-void Thread::clear_worker() {
+{
-    assert(worker != nullptr);
+  std::lock_guard<std::mutex> lk(mutex);
-    run_custom_job([this]() { worker->clear(); });
+  worker = std::move(t);
  searching = true;
  cv.notify_one(); // Wake up the thread in idle_loop()
 }
-// Blocks on the condition variable until the thread has finished searching
+
 /// Thread::wait_for_search_finished() blocks on the condition variable
 /// until the thread has finished searching.
 void Thread::wait_for_search_finished() {
-    std::unique_lock<std::mutex> lk(mutex);
+  std::unique_lock<std::mutex> lk(mutex);
-    cv.wait(lk, [&] { return !searching; });
+  cv.wait(lk, [&]{ return !searching; });
 }
-// Launching a function in the thread
+
-void Thread::run_custom_job(std::function<void()> f) {
+void Thread::wait_for_worker_finished() {
-    {
+
-        std::unique_lock<std::mutex> lk(mutex);
+  std::unique_lock<std::mutex> lk(mutex);
-        cv.wait(lk, [&] { return !searching; });
+  cv.wait(lk, [&]{ return !searching; });
        jobFunc   = std::move(f);
        searching = true;
    }
    cv.notify_one();
 }
-void Thread::ensure_network_replicated() { worker->ensure_network_replicated(); }
+/// Thread::idle_loop() is where the thread is parked, blocked on the
-
+/// condition variable, when it has no work to do.
 // Thread gets parked here, blocked on the condition variable
 // when the thread has no work to do.
 void Thread::idle_loop() {
    while (true)
    {
        std::unique_lock<std::mutex> lk(mutex);
        searching = false;
        cv.notify_one();  // Wake up anyone waiting for search finished
        cv.wait(lk, [&] { return searching; });
-        if (exit)
+  // If OS already scheduled us on a different group than 0 then don't overwrite
-            return;
+  // the choice, eventually we are one of many one-threaded processes running on
  // some Windows NUMA hardware, for instance in fishtest. To make it simple,
  // just check if running threads are below a threshold, in this case all this
  // NUMA machinery is not needed.
  if (Options["Threads"] > 8)
      WinProcGroup::bindThisThread(idx);
-        std::function<void()> job = std::move(jobFunc);
+  while (true)
-        jobFunc                   = nullptr;
+  {
      std::unique_lock<std::mutex> lk(mutex);
      searching = false;
      worker = nullptr;
      cv.notify_one(); // Wake up anyone waiting for search finished
      cv.wait(lk, [&]{ return searching; });
-        lk.unlock();
+      if (exit)
          return;
-        if (job)
+      auto wrk = std::move(worker);
-            job();
+
-    }
+      lk.unlock();
      if (wrk)
      {
        wrk(*this);
      }
      else
      {
        search();
      }
  }
 }
-Search::SearchManager* ThreadPool::main_manager() { return main_thread()->worker->main_manager(); }
+/// ThreadPool::set() creates/destroys threads to match the requested number.
 /// Created and launched threads will immediately go to sleep in idle_loop.
 /// Upon resizing, threads are recreated to allow for binding if necessary.
-uint64_t ThreadPool::nodes_searched() const { return accumulate(&Search::Worker::nodes); }
+void ThreadPool::set(size_t requested) {
 uint64_t ThreadPool::tb_hits() const { return accumulate(&Search::Worker::tbHits); }
-// Creates/destroys threads to match the requested number.
+  if (size() > 0)   // destroy any existing thread(s)
-// Created and launched threads will immediately go to sleep in idle_loop.
+  {
-// Upon resizing, threads are recreated to allow for binding if necessary.
+      main()->wait_for_search_finished();
 void ThreadPool::set(const NumaConfig&                           numaConfig,
                     Search::SharedState                         sharedState,
                     const Search::SearchManager::UpdateContext& updateContext) {
-    if (threads.size() > 0)  // destroy any existing thread(s)
+      while (size() > 0)
-    {
+          delete back(), pop_back();
-        main_thread()->wait_for_search_finished();
+  }
-        threads.clear();
+  if (requested > 0)   // create new thread(s)
  {
      push_back(new MainThread(0));
-        boundThreadToNumaNode.clear();
+      while (size() < requested)
-    }
+          push_back(new Thread(size()));
      clear();
-    const size_t requested = sharedState.options["Threads"];
+      // Reallocate the hash with the new threadpool size
      TT.resize(size_t(Options["Hash"]));
-    if (requested > 0)  // create new thread(s)
+      // Init thread number dependent search params.
-    {
+      Search::init();
-        // Binding threads may be problematic when there's multiple NUMA nodes and
+  }
        // multiple Stockfish instances running. In particular, if each instance
        // runs a single thread then they would all be mapped to the first NUMA node.
        // This is undesirable, and so the default behaviour (i.e. when the user does not
        // change the NumaConfig UCI setting) is to not bind the threads to processors
        // unless we know for sure that we span NUMA nodes and replication is required.
        const std::string numaPolicy(sharedState.options["NumaPolicy"]);
        const bool        doBindThreads = [&]() {
            if (numaPolicy == "none")
                return false;
            if (numaPolicy == "auto")
                return numaConfig.suggests_binding_threads(requested);
            // numaPolicy == "system", or explicitly set by the user
            return true;
        }();
        boundThreadToNumaNode = doBindThreads
                                ? numaConfig.distribute_threads_among_numa_nodes(requested)
                                : std::vector<NumaIndex>{};
        while (threads.size() < requested)
        {
            const size_t    threadId = threads.size();
            const NumaIndex numaId   = doBindThreads ? boundThreadToNumaNode[threadId] : 0;
            auto            manager  = threadId == 0 ? std::unique_ptr<Search::ISearchManager>(
                                             std::make_unique<Search::SearchManager>(updateContext))
                                                     : std::make_unique<Search::NullSearchManager>();
            // When not binding threads we want to force all access to happen
            // from the same NUMA node, because in case of NUMA replicated memory
            // accesses we don't want to trash cache in case the threads get scheduled
            // on the same NUMA node.
            auto binder = doBindThreads ? OptionalThreadToNumaNodeBinder(numaConfig, numaId)
                                        : OptionalThreadToNumaNodeBinder(numaId);
            threads.emplace_back(
              std::make_unique<Thread>(sharedState, std::move(manager), threadId, binder));
        }
        clear();
        main_thread()->wait_for_search_finished();
    }
 }
-// Sets threadPool data to initial values
+/// ThreadPool::clear() sets threadPool data to initial values
 void ThreadPool::clear() {
    if (threads.size() == 0)
        return;
-    for (auto&& th : threads)
+  for (Thread* th : *this)
-        th->clear_worker();
+      th->clear();
-    for (auto&& th : threads)
+  main()->callsCnt = 0;
-        th->wait_for_search_finished();
+  main()->bestPreviousScore = VALUE_INFINITE;
-
+  main()->bestPreviousAverageScore = VALUE_INFINITE;
-    // These two affect the time taken on the first move of a game:
+  main()->previousTimeReduction = 1.0;
    main_manager()->bestPreviousAverageScore = VALUE_INFINITE;
    main_manager()->previousTimeReduction    = 0.85;
    main_manager()->callsCnt           = 0;
    main_manager()->bestPreviousScore  = VALUE_INFINITE;
    main_manager()->originalTimeAdjust = -1;
    main_manager()->tm.clear();
 }
-void ThreadPool::run_on_thread(size_t threadId, std::function<void()> f) {
+void ThreadPool::execute_with_workers(const std::function<void(Thread&)>& worker)
-    assert(threads.size() > threadId);
+{
-    threads[threadId]->run_custom_job(std::move(f));
+  for(Thread* th : *this)
  {
    th->execute_with_worker(worker);
  }
 }
-void ThreadPool::wait_on_thread(size_t threadId) {
+/// ThreadPool::start_thinking() wakes up main thread waiting in idle_loop() and
-    assert(threads.size() > threadId);
+/// returns immediately. Main thread will wake up other threads and start the search.
    threads[threadId]->wait_for_search_finished();
 }
-size_t ThreadPool::num_threads() const { return threads.size(); }
+void ThreadPool::start_thinking(Position& pos, StateListPtr& states,
                                const Search::LimitsType& limits, bool ponderMode) {
  main()->wait_for_search_finished();
-// Wakes up main thread waiting in idle_loop() and returns immediately.
+  main()->stopOnPonderhit = stop = false;
-// Main thread will wake up other threads and start the search.
+  increaseDepth = true;
-void ThreadPool::start_thinking(const OptionsMap&  options,
+  main()->ponder = ponderMode;
-                                Position&          pos,
+  Search::Limits = limits;
-                                StateListPtr&      states,
+  Search::RootMoves rootMoves;
                                Search::LimitsType limits) {
-    main_thread()->wait_for_search_finished();
+  for (const auto& m : MoveList<LEGAL>(pos))
      if (   limits.searchmoves.empty()
          || std::count(limits.searchmoves.begin(), limits.searchmoves.end(), m))
          rootMoves.emplace_back(m);
-    main_manager()->stopOnPonderhit = stop = abortedSearch = false;
+  // After ownership transfer 'states' becomes empty, so if we stop the search
-    main_manager()->ponder                                 = limits.ponderMode;
+  // and call 'go' again without setting a new position states.get() == NULL.
  assert(states.get() || setupStates.get());
-    increaseDepth = true;
+  if (states.get())
      setupStates = std::move(states); // Ownership transfer, states is now empty
-    Search::RootMoves rootMoves;
+  // We use Position::set() to set root position across threads. But there are
-    const auto        legalmoves = MoveList<LEGAL>(pos);
+  // some StateInfo fields (previous, pliesFromNull, capturedPiece) that cannot
  // be deduced from a fen string, so set() clears them and they are set from
  // setupStates->back() later. The rootState is per thread, earlier states are shared
  // since they are read-only.
  for (Thread* th : *this)
  {
      th->nodes = th->tbHits = th->nmpMinPly = th->bestMoveChanges = 0;
      th->rootDepth = th->completedDepth = 0;
      th->rootMoves = rootMoves;
      th->rootPos.set(pos.fen(), pos.is_chess960(), &th->rootState, th);
      th->rootState = setupStates->back();
  }
-    for (const auto& uciMove : limits.searchmoves)
+  main()->start_searching();
    {
        auto move = UCIEngine::to_move(pos, uciMove);
        if (std::find(legalmoves.begin(), legalmoves.end(), move) != legalmoves.end())
            rootMoves.emplace_back(move);
    }
    if (rootMoves.empty())
        for (const auto& m : legalmoves)
            rootMoves.emplace_back(m);
    Tablebases::Config tbConfig = Tablebases::rank_root_moves(options, pos, rootMoves);
    // After ownership transfer 'states' becomes empty, so if we stop the search
    // and call 'go' again without setting a new position states.get() == nullptr.
    assert(states.get() || setupStates.get());
    if (states.get())
        setupStates = std::move(states);  // Ownership transfer, states is now empty
    // We use Position::set() to set root position across threads. But there are
    // some StateInfo fields (previous, pliesFromNull, capturedPiece) that cannot
    // be deduced from a fen string, so set() clears them and they are set from
    // setupStates->back() later. The rootState is per thread, earlier states are
    // shared since they are read-only.
    for (auto&& th : threads)
    {
        th->run_custom_job([&]() {
            th->worker->limits = limits;
            th->worker->nodes = th->worker->tbHits = th->worker->nmpMinPly =
              th->worker->bestMoveChanges          = 0;
            th->worker->rootDepth = th->worker->completedDepth = 0;
            th->worker->rootMoves                              = rootMoves;
            th->worker->rootPos.set(pos.fen(), pos.is_chess960(), &th->worker->rootState);
            th->worker->rootState = setupStates->back();
            th->worker->tbConfig  = tbConfig;
        });
    }
    for (auto&& th : threads)
        th->wait_for_search_finished();
    main_thread()->start_searching();
 }
 Thread* ThreadPool::get_best_thread() const {
-    Thread* bestThread = threads.front().get();
+    Thread* bestThread = front();
-    Value   minScore   = VALUE_NONE;
+    std::map<Move, int64_t> votes;
    Value minScore = VALUE_NONE;
-    std::unordered_map<Move, int64_t, Move::MoveHash> votes(
+    // Find minimum score of all threads
-      2 * std::min(size(), bestThread->worker->rootMoves.size()));
+    for (Thread* th: *this)
-
+        minScore = std::min(minScore, th->rootMoves[0].score);
    // Find the minimum score of all threads
    for (auto&& th : threads)
        minScore = std::min(minScore, th->worker->rootMoves[0].score);
    // Vote according to score and depth, and select the best thread
-    auto thread_voting_value = [minScore](Thread* th) {
+    for (Thread* th : *this)
        return (th->worker->rootMoves[0].score - minScore + 14) * int(th->worker->completedDepth);
    };
    for (auto&& th : threads)
        votes[th->worker->rootMoves[0].pv[0]] += thread_voting_value(th.get());
    for (auto&& th : threads)
    {
-        const auto bestThreadScore = bestThread->worker->rootMoves[0].score;
+        votes[th->rootMoves[0].pv[0]] +=
-        const auto newThreadScore  = th->worker->rootMoves[0].score;
+            (th->rootMoves[0].score - minScore + 14) * int(th->completedDepth);
-        const auto& bestThreadPV = bestThread->worker->rootMoves[0].pv;
+        if (abs(bestThread->rootMoves[0].score) >= VALUE_TB_WIN_IN_MAX_PLY)
        const auto& newThreadPV  = th->worker->rootMoves[0].pv;
        const auto bestThreadMoveVote = votes[bestThreadPV[0]];
        const auto newThreadMoveVote  = votes[newThreadPV[0]];
        const bool bestThreadInProvenWin = is_win(bestThreadScore);
        const bool newThreadInProvenWin  = is_win(newThreadScore);
        const bool bestThreadInProvenLoss =
          bestThreadScore != -VALUE_INFINITE && is_loss(bestThreadScore);
        const bool newThreadInProvenLoss =
          newThreadScore != -VALUE_INFINITE && is_loss(newThreadScore);
        // We make sure not to pick a thread with truncated principal variation
        const bool betterVotingValue =
          thread_voting_value(th.get()) * int(newThreadPV.size() > 2)
          > thread_voting_value(bestThread) * int(bestThreadPV.size() > 2);
        if (bestThreadInProvenWin)
        {
-            // Make sure we pick the shortest mate / TB conversion
+            // Make sure we pick the shortest mate / TB conversion or stave off mate the longest
-            if (newThreadScore > bestThreadScore)
+            if (th->rootMoves[0].score > bestThread->rootMoves[0].score)
-                bestThread = th.get();
+                bestThread = th;
        }
-        else if (bestThreadInProvenLoss)
+        else if (   th->rootMoves[0].score >= VALUE_TB_WIN_IN_MAX_PLY
-        {
+                 || (   th->rootMoves[0].score > VALUE_TB_LOSS_IN_MAX_PLY
-            // Make sure we pick the shortest mated / TB conversion
+                     && votes[th->rootMoves[0].pv[0]] > votes[bestThread->rootMoves[0].pv[0]]))
-            if (newThreadInProvenLoss && newThreadScore < bestThreadScore)
+            bestThread = th;
                bestThread = th.get();
        }
        else if (newThreadInProvenWin || newThreadInProvenLoss
                 || (!is_loss(newThreadScore)
                     && (newThreadMoveVote > bestThreadMoveVote
                         || (newThreadMoveVote == bestThreadMoveVote && betterVotingValue))))
            bestThread = th.get();
    }
    return bestThread;
 }
-// Start non-main threads.
+/// Start non-main threads
-// Will be invoked by main thread after it has started searching.
+
 void ThreadPool::start_searching() {
-    for (auto&& th : threads)
+    for (Thread* th : *this)
-        if (th != threads.front())
+        if (th != front())
            th->start_searching();
 }
-// Wait for non-main threads
+/// Wait for non-main threads
 void ThreadPool::wait_for_search_finished() const {
-    for (auto&& th : threads)
+    for (Thread* th : *this)
-        if (th != threads.front())
+        if (th != front())
            th->wait_for_search_finished();
 }
 std::vector<size_t> ThreadPool::get_bound_thread_count_by_numa_node() const {
    std::vector<size_t> counts;
-    if (!boundThreadToNumaNode.empty())
+void ThreadPool::wait_for_workers_finished() const {
    {
        NumaIndex highestNumaNode = 0;
        for (NumaIndex n : boundThreadToNumaNode)
            if (n > highestNumaNode)
                highestNumaNode = n;
-        counts.resize(highestNumaNode + 1, 0);
+    for (Thread* th : *this)
-
+        th->wait_for_worker_finished();
        for (NumaIndex n : boundThreadToNumaNode)
            counts[n] += 1;
    }
    return counts;
 }
-void ThreadPool::ensure_network_replicated() {
+} // namespace Stockfish
    for (auto&& th : threads)
        th->ensure_network_replicated();
 }
 }  // namespace Stockfish
@@ -1,6 +1,6 @@
 /*
  Stockfish, a UCI chess playing engine derived from Glaurung 2.1
-  Copyright (C) 2004-2025 The Stockfish developers (see AUTHORS file)
+  Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
  Stockfish is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
@@ -21,158 +21,206 @@
 #include <atomic>
 #include <condition_variable>
 #include <cstddef>
 #include <cstdint>
 #include <functional>
 #include <memory>
 #include <mutex>
 #include <thread>
 #include <vector>
 #include <functional>
-#include "numa.h"
+#include "material.h"
 #include "movepick.h"
 #include "pawns.h"
 #include "position.h"
 #include "search.h"
 #include "thread_win32_osx.h"
 namespace Stockfish {
 /// Thread class keeps together all the thread-related stuff. We use
 /// per-thread pawn and material hash tables so that once we get a
 /// pointer to an entry its life time is unlimited and we don't have
 /// to care about someone changing the entry under our feet.
-class OptionsMap;
+namespace Detail {
 using Value = int;
-// Sometimes we don't want to actually bind the threads, but the recipient still
+  template <typename T>
-// needs to think it runs on *some* NUMA node, such that it can access structures
+  struct TypeIdentity {
-// that rely on NUMA node knowledge. This class encapsulates this optional process
+    using Type = T;
-// such that the recipient does not need to know whether the binding happened or not.
+  };
 class OptionalThreadToNumaNodeBinder {
   public:
    OptionalThreadToNumaNodeBinder(NumaIndex n) :
        numaConfig(nullptr),
        numaId(n) {}
-    OptionalThreadToNumaNodeBinder(const NumaConfig& cfg, NumaIndex n) :
+}
        numaConfig(&cfg),
        numaId(n) {}
    NumaReplicatedAccessToken operator()() const {
        if (numaConfig != nullptr)
            return numaConfig->bind_current_thread_to_numa_node(numaId);
        else
            return NumaReplicatedAccessToken(numaId);
    }
   private:
    const NumaConfig* numaConfig;
    NumaIndex         numaId;
 };
 // Abstraction of a thread. It contains a pointer to the worker and a native thread.
 // After construction, the native thread is started with idle_loop()
 // waiting for a signal to start searching.
 // When the signal is received, the thread starts searching and when
 // the search is finished, it goes back to idle_loop() waiting for a new signal.
 class Thread {
   public:
    Thread(Search::SharedState&,
           std::unique_ptr<Search::ISearchManager>,
           size_t,
           OptionalThreadToNumaNodeBinder);
    virtual ~Thread();
-    void idle_loop();
+  std::mutex mutex;
-    void start_searching();
+  std::condition_variable cv;
-    void clear_worker();
+  size_t idx;
-    void run_custom_job(std::function<void()> f);
+  bool exit = false, searching = true; // Set before starting std::thread
  std::function<void(Thread&)> worker;
  std::function<void(Position&)> on_eval_callback;
  NativeThread stdThread;
-    void ensure_network_replicated();
+public:
  explicit Thread(size_t);
  virtual ~Thread();
  virtual void search();
-    // Thread has been slightly altered to allow running custom jobs, so
+  // The function object to be executed is taken by value to remove
-    // this name is no longer correct. However, this class (and ThreadPool)
+  // the need for separate lvalue and rvalue overloads.
-    // require further work to make them properly generic while maintaining
+  // The worker thread needs to have ownership of the task
-    // appropriate specificity regarding search, from the point of view of an
+  // to be executed because otherwise there's no way to manage its lifetime.
-    // outside user, so renaming of this function is left for whenever that happens.
+  virtual void execute_with_worker(std::function<void(Thread&)> t);
    void   wait_for_search_finished();
    size_t id() const { return idx; }
-    std::unique_ptr<Search::Worker> worker;
+  void clear();
-    std::function<void()>           jobFunc;
+  void idle_loop();
  void start_searching();
  void wait_for_search_finished();
  size_t id() const { return idx; }
-   private:
+  void wait_for_worker_finished();
-    std::mutex                mutex;
+
-    std::condition_variable   cv;
+  template <typename FuncT>
-    size_t                    idx, nthreads;
+  void set_eval_callback(FuncT&& f) { on_eval_callback = std::forward<FuncT>(f); }
-    bool                      exit = false, searching = true;  // Set before starting std::thread
+
-    NativeThread              stdThread;
+  void clear_eval_callback() { on_eval_callback = nullptr; }
-    NumaReplicatedAccessToken numaAccessToken;
+
  void on_eval() { if (on_eval_callback) on_eval_callback(rootPos); }
  Pawns::Table pawnsTable;
  Material::Table materialTable;
  size_t pvIdx, pvLast;
  RunningAverage complexityAverage;
  std::atomic<uint64_t> nodes, tbHits, bestMoveChanges;
  int selDepth, nmpMinPly;
  Color nmpColor;
  Value bestValue, optimism[COLOR_NB];
  uint64_t maxNodes;
  Position rootPos;
  StateInfo rootState;
  Search::RootMoves rootMoves;
  Depth rootDepth, completedDepth, depth, previousDepth;
  Value rootDelta;
  CounterMoveHistory counterMoves;
  ButterflyHistory mainHistory;
  CapturePieceToHistory captureHistory;
  ContinuationHistory continuationHistory[2][2];
  Score trend;
  int failedHighCnt;
  bool rootInTB;
  int Cardinality;
  bool UseRule50;
  Depth ProbeDepth;
 };
-// ThreadPool struct handles all the threads-related stuff like init, starting,
+/// MainThread is a derived class specific for main thread
 // parking and, most importantly, launching a thread. All the access to threads
 // is done through this class.
 class ThreadPool {
   public:
    ThreadPool() {}
-    ~ThreadPool() {
+struct MainThread : public Thread {
        // destroy any existing thread(s)
        if (threads.size() > 0)
        {
            main_thread()->wait_for_search_finished();
-            threads.clear();
+  using Thread::Thread;
  void search() override;
  void check_time();
  double previousTimeReduction;
  Value bestPreviousScore;
  Value bestPreviousAverageScore;
  Value iterValue[4];
  int callsCnt;
  bool stopOnPonderhit;
  std::atomic_bool ponder;
 };
 /// ThreadPool struct handles all the threads-related stuff like init, starting,
 /// parking and, most importantly, launching a thread. All the access to threads
 /// is done through this class.
 struct ThreadPool : public std::vector<Thread*> {
  // Each thread gets its own copy of the `worker` function object.
  // This means that each worker thread will have exclusive access
  // to the state of the `worker` function object.
  void execute_with_workers(const std::function<void(Thread&)>& worker);
  template <typename IndexT, typename FuncT>
  void for_each_index_with_workers(
    IndexT begin,
    typename Detail::TypeIdentity<IndexT>::Type end,
    FuncT func)
  {
    // This value must outlive the function call.
    // It's fairly safe if we make it static
    // because for_each_index_with_workers
    // is not reentrant nor thread safe.
    static std::atomic<IndexT> i_atomic;
    i_atomic.store(begin);
    execute_with_workers(
      [end, func](Thread& th) mutable {
        for(;;) {
          const auto i = i_atomic.fetch_add(1);
          if (i >= end)
            break;
          func(th, i);
        }
-    }
+      });
  }
-    ThreadPool(const ThreadPool&) = delete;
+  template <typename IndexT, typename FuncT>
-    ThreadPool(ThreadPool&&)      = delete;
+  void for_each_index_chunk_with_workers(
    IndexT begin,
    typename Detail::TypeIdentity<IndexT>::Type end,
    FuncT func)
  {
    // This value must outlive the function call.
    // It's fairly safe if we make it static
    // because for_each_index_with_workers
    // is not reentrant nor thread safe.
    const IndexT size = end - begin;
    const IndexT chunk_size = (size + this->size()) / this->size();
-    ThreadPool& operator=(const ThreadPool&) = delete;
+    execute_with_workers(
-    ThreadPool& operator=(ThreadPool&&)      = delete;
+      [chunk_size, end, func](Thread& th) mutable {
        const IndexT thread_id = th.id();
        const IndexT offset = chunk_size * thread_id;
        if (offset >= end)
          return;
-    void   start_thinking(const OptionsMap&, Position&, StateListPtr&, Search::LimitsType);
+        const IndexT count = offset + chunk_size > end ? end - offset : chunk_size;
-    void   run_on_thread(size_t threadId, std::function<void()> f);
+        func(th, offset, count);
-    void   wait_on_thread(size_t threadId);
+      });
-    size_t num_threads() const;
+  }
    void   clear();
    void   set(const NumaConfig& numaConfig,
               Search::SharedState,
               const Search::SearchManager::UpdateContext&);
-    Search::SearchManager* main_manager();
+  void start_thinking(Position&, StateListPtr&, const Search::LimitsType&, bool = false);
-    Thread*                main_thread() const { return threads.front().get(); }
+  void clear();
-    uint64_t               nodes_searched() const;
+  void set(size_t);
    uint64_t               tb_hits() const;
    Thread*                get_best_thread() const;
    void                   start_searching();
    void                   wait_for_search_finished() const;
-    std::vector<size_t> get_bound_thread_count_by_numa_node() const;
+  MainThread* main()        const { return static_cast<MainThread*>(front()); }
  uint64_t nodes_searched() const { return accumulate(&Thread::nodes); }
  uint64_t tb_hits()        const { return accumulate(&Thread::tbHits); }
  Thread* get_best_thread() const;
  void start_searching();
  void wait_for_search_finished() const;
  void wait_for_workers_finished() const;
-    void ensure_network_replicated();
+  std::atomic_bool stop, increaseDepth;
-    std::atomic_bool stop, abortedSearch, increaseDepth;
+private:
  StateListPtr setupStates;
-    auto cbegin() const noexcept { return threads.cbegin(); }
+  uint64_t accumulate(std::atomic<uint64_t> Thread::* member) const {
    auto begin() noexcept { return threads.begin(); }
    auto end() noexcept { return threads.end(); }
    auto cend() const noexcept { return threads.cend(); }
    auto size() const noexcept { return threads.size(); }
    auto empty() const noexcept { return threads.empty(); }
-   private:
+    uint64_t sum = 0;
-    StateListPtr                         setupStates;
+    for (Thread* th : *this)
-    std::vector<std::unique_ptr<Thread>> threads;
+        sum += (th->*member).load(std::memory_order_relaxed);
-    std::vector<NumaIndex>               boundThreadToNumaNode;
+    return sum;
-
+  }
    uint64_t accumulate(std::atomic<uint64_t> Search::Worker::*member) const {
        uint64_t sum = 0;
        for (auto&& th : threads)
            sum += (th->worker.get()->*member).load(std::memory_order_relaxed);
        return sum;
    }
 };
-}  // namespace Stockfish
+extern ThreadPool Threads;
-#endif  // #ifndef THREAD_H_INCLUDED
+} // namespace Stockfish
 #endif // #ifndef THREAD_H_INCLUDED
--- a/Show More
+++ b/Show More