Repository navigation
Stockfish FAQ
Note: Stockfish is a command line program. You may want to use it in your own UCI-compatible chess GUI.
- Log in to Github
- Navigate our Actions
- Click on the first workflow run
- Scroll to the bottom of the page
- Select the corresponding binary
Note: You can also compile from source the latest commit. TODO: Compile from source wiki page
- Intel: 4th Gen and newer.
- AMD: Zen 3 and newer.
- AMD: Zen, Zen+ and Zen 2.
TODO
TODO
TODO
To get the best possible evaluation or the strongest move for a given position, the key thing is to let Stockfish analyze long enough, using a recent release (or development version), properly selected for the CPU architecture.
The following settings are important as well:
tl;dr: Maximum - 1 or 2.
Set the number of threads to the maximum available, possibly leaving 1 or 2 threads free for other tasks. SMT or Hyper-threading is beneficial, so normally the number of threads available is twice the number of cores available. Consumer hardware typically has at least 4-8 threads, Stockfish supports hundreds of threads.
tl;dr: Maximum - 1 or 2GiB.
Set the hash to nearly the maximum amount of memory (RAM) available, leaving some memory free for other tasks. The Hash can be any value, not just powers of two. The value is specified in MiB, and typical consumer hardware will have GiB of RAM. For a system with 8GiB of RAM one could use 6000 as a reasonable value for the Hash.
tl;dr: 1.
A higher value weakens the quality of the best move computed, as resources are used to compute other moves.
Stockfish may crash if fed incorrect fens, or fens with illegal positions. Full validation code is complex to write, and there is no established mechanism to communicate such an error back to the GUI.
On the other hand, the GUI must carefully check fens. If you find a GUI through which you can crash Stockfish or any other engine, then by all means report it to that GUI's developers.
Also known as "CPUs". TODO
Also known as "memory". TODO
Counter of iterative deepening loop. Regardless of the name, there is no simple connection to depth.
Also known as "seldepth". Is the depth of the deepest principal variation line in the search.
Also known as "number of lines" or "multiple lines". The top N moves and their principal variations can be computed. This gives additional insight in the options of the position. However, in Stockfish, this weakens the quality of the best move computed, as resources are used to compute other moves.
Also known as "Lazy SMP". The idea of executing the search function on N many threads and share the hash table. This allows for faster filling of the hash table, resulting in a faster and wider search.
The idea of ignoring certain parts of the search tree in order to reduce the amount of time it takes to execute a search.
In order to maximize the efficiency of alpha-beta search, we optimally want to try the best moves first.
Also known as "classic", "classical" or "HCE". TODO
Also known as "NNUE". TODO
New commits to stockfish can mostly be categorised in 2 categories:
- Non functional changes
- Functional changes
Changes that don't change the search behaviour, for example:
- Code cleanups
- Comments
- New commands
These change the search behaviour and lead to a different search tree.
Every functional patch (commit) has to be verified by Fishtest, our testing framework.
You can follow the steps described in our Fishtest wiki, to create your first test.
https://github.com/glinscott/fishtest/wiki/Creating-my-first-test