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 answers only
not deleted
user 11144
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.
4
votes
Are there attempts at creating practical endgame tablebases?
The answers given already should convince you it is not easy to concentrate on "practical". The case is not completely hopeless, though: if two of the pieces are pawns on the same line, chance is good …
- 17.3k
1
vote
What is the DTM for White is this 7 piece position?
I can't give an exact DTM answer, but this one will be off by only a few moves. If you replay the Syzygy line, you will see Black can only annoy White with countless stalemate shenanigans, but White w …
- 17.3k
6
votes
Has Explainable AI been applied to the endgame tablebases?
But already with the endgame KR/K, which is as much the drosophila of tablebases as chess is for KI, was handled this way, and for a CS project I wrote a whole miniarticle about exactly KR/K. …
- 17.3k
1
vote
How would I detect dead position in a tablebase?
You might be computationally better off if you "hotwire" the problem. Consider an orthodox tablebase:
Death 1: KB/K, KN/K. Trivial detection.
Death 2: Forced stalemate. Can be detected by playing jus …
- 17.3k