Search Results
| 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) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with calculation
Search options questions only
not deleted
user 12873
Calculation is the ability of a chess player to calculate variations in a given position.
1
vote
2
answers
288
views
Why do engines run faster if you only have one line of analysis open?
When I load up an engine (like Stockfish), it reaches a higher depth quicker if I only leave one line of analysis open. If I leave multiple lines open, it runs slower. Why is this?
- 19.9k
4
votes
3
answers
1k
views
Why does AlphaZero evaluate on the order of 1000 times less moves than Stockfish?
According to Deep mind's article, Alpha Zero searches roughly 10,000 moves per decision, while Stockfish is around 10,000,000 moves. I'm aware that Alpha Zero uses Monte Carlo Tree Search while Stockf …
- 19.9k
5
votes
1
answer
706
views
How are chess engines able to rank a Mate in X above a Mate in X+Y?
According to an engine, a mate in X moves = +infinity, since it is a forced win for it.
Also according to an engine, a mate in X+Y moves = +infinity, since it's a forced win (just more moves, but an …
- 19.9k
7
votes
3
answers
2k
views
How can minimax chess engines do alpha-beta pruning without reaching the final positions?
In order to calculate far ahead, minimax chess engines must perform alpha-beta pruning, where they don't calculate positions that are obviously winning or obviously losing. Without doing pruning, engi …
- 19.9k