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 |
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.
9
votes
Computer endgame strength without tablebases
Without tablebases, engines might not know that a rook pawn and wrong bishop is only a draw. …
36
votes
Accepted
Can a rook win against a knight in the endgame?
If you're interested in a specific position, you can check out the Nalimov Tablebases online. They have completely solved every position with 6 or fewer pieces on the board. …