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 answers only
not deleted
user 825
Calculation is the ability of a chess player to calculate variations in a given position.
15
votes
CPU v. GPU for chess engines
EDIT:
Few other points raised in http://web.archive.org/web/20201022142829/http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=32317
GPU not so good for recursion
GPU not so good for floating
…
- 22.7k
4
votes
Accepted
Why do engines run faster if you only have one line of analysis open?
That's normal, commonly known as multiPV analysis.
Without getting into too much technical details, analysing N number of principal variations require running the engine N times, one for each PV. We …
- 22.7k
4
votes
Accepted
Why does AlphaZero evaluate on the order of 1000 times less moves than Stockfish?
Very simple. Running a large neural network with floating numbers can’t be quicker than running a simple C++ function on integers.
AI machine learning is not new to chess. There were serious attempts …
- 22.7k
3
votes
Accepted
How can minimax chess engines do alpha-beta pruning without reaching the final positions?
If a chess engine isn't aware of the mate, then it will be happy to play the moves as Black. By the time it sees the checkmate, it'd be too late. Game over. 1-0.
Fortunately, your scenario is quite si …
- 22.7k