Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*"
Favorites infavorites:mine
Status closed:yes
Types is:question
Exclude -[tag]
For more details on advanced search visit our help page
Results tagged with Search options user 10075

An engine is any machine or computer program that plays chess.

Next Chess Move offers a number of engines in the cloud including LC0, although they charge a subscription fee for access to more powerful hardware. At the time of writing, they provide an app on Android and iOS, though it doesn't appear to have any integration with desktop programs. …
answered Oct 1 '19 by konsolas
search around 60 thousand positions per second. By contrast, Stockfish, on a single core on my PC, searches over 2 million positions per second. While modern engines have a huge selection of techniques to … Stockfish (and most other engines) sported an evaluation of +8.31. A popular explanation for this is that Lc0 may not have had a significant number of games with multiple queens on the board in its …
answered Feb 21 '19 by konsolas
Fishtest tests proposed changes to Stockfish's code with SPRT to determine if they should be accepted. Broadly speaking, there are two types of changes which are tested in this way (non-functional cha …
answered May 31 '19 by konsolas
, MultiPV is implemented in alpha-beta engines by searching all the root moves, then searching the root again, skipping the root move, then searching again skipping the two already-found root moves … , etc. This significantly reduces the strength of alpha-beta engines in analysis, where you often want to take a look at multiple possible variations. MCTS, by contrast, expands out portions of the …
answered May 18 '19 by konsolas
As per: engine.analysis(board) now returns an AnalysisResult object, which has the property info that you wan …
answered Aug 7 '19 by konsolas
In an Alpha Beta search in that utilizes a Negamax framework, how does one collect principal variations to use in move ordering Every strong modern chess engine which uses alpha-beta search uses …
answered Jul 6 '19 by konsolas
This is difficult to answer definitively as there is obviously no way to say that there isn't someone somewhere working on an MCTS version of Stockfish. However, as of the time of writing, there exist …
answered May 30 '19 by konsolas
The answer is simple for traditional engines like Stockfish and the like: if multiple moves have the same evaluation, they pick whichever move was searched first. All strong alpha-beta engines … in 1/100th of a pawn, so there could be internal differentiation which is not visible to a user. MCTS engines like Lc0 make decisions based on the number of nodes searched in the subtrees of each move …
answered Oct 3 '19 by konsolas
Chess engines are, of course, able to analyse opening positions and come up with reasonable moves, but opening books still come with some advantages: Moving instantly in the opening saves a lot of … overwhelming majority of games are conducted starting from an opening position, but the engines themselves are not allowed their own books. When playing a human, many chess applications use books, but delay …
answered Mar 24 '19 by konsolas
Neither AlphaZero, nor Lc0 (an open source project based on the AlphaZero paper), use MCTS in its pure form, because they do not perform game rollouts - the search is simply called MCTS because the wa …
answered Feb 21 '19 by konsolas
Alpha-beta engines, in many endgame positions, will quickly find a mate and therefore will pick the move which prolongs the mate for the longest. Engines which use Monte Carlo Tree Search, however … ...Kg8 2.Kh6 Kh8 3.Kg5 Kg7 4.Kf5 Kg8 5.Kf6 Kf8 Lc0 does not play endgames as well as alpha-beta engines, but it tends to play them in a much more human manner. I would also suggest taking a look at Komodo 12 MCTS, which may also exhibit this type of behaviour. …
answered Mar 9 '19 by konsolas
The first three lines: info depth 31 seldepth 47 multipv 1 score cp -771 lowerbound nodes 86977322 nps 1898570 hashfull 990 tbhits 0 time 45812 pv f1f3 info depth 31 seldepth 47 multipv 1 score cp -7 …
answered Aug 6 '19 by konsolas
, using the opposite side as the set of occupied squares. BitBoard bb_pinners = slider_moves(king_square, bb_other_side) & bb_other_side; All bitboard engines should have some function similar to …
answered Aug 16 '19 by konsolas