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 tablebases
Search options questions only
not deleted
user 2429
Tablebases are databases that contain complete, exhaustively calculated moves and variations for a given collection of chess positions. E.g. the Nalimov tablebases contain full solutions for all endgames involving 6 pieces or less.
12
votes
5
answers
2k
views
How many legal but unreachable positions exist?
tablebases. … Here's a screenshot from the online Nalimov tablebases.
Now, in this unreachable position, I can add another piece like a knight on almost every square. …
- 8,875