Skip to main content

All Questions

Tagged with
3 votes
1 answer
277 views

Mate-in-N problems where N scales indefinitely with board size

Motivation - Long range mating patterns This question is inspired by my recent interest in infinite chess and the post on MathOverflow Checkmate in ω moves?. Since my chess endgame skills are quite ...
Andreas Tsevas's user avatar
10 votes
3 answers
7k views

Is there a mathematical theorem that you can use to win a chess endgame?

Have mathematicians created any theorem that determines the outcome of a endgame? If so, how could it be used to win a specific endgame?
user avatar
2 votes
2 answers
697 views

How to mathematically determine if king and pawn versus king endgame is a draw or a win?

I am aware of questions such as this one which discussed a method of determining if a king pawn vs king endgame is a draw or not. The accepted answer gave detailed guidelines but is not mathematically ...
Zuriel's user avatar
  • 9,101
5 votes
2 answers
133 views

Endgames: How was "maximum moves required" determined before tablebases?

To use a simple example, tablebases show that KQ vs. K is won in at most ten moves. But chess books going back many decades, well before tablebases, say the same thing. How was this calculated?
TheChessGuest's user avatar
3 votes
1 answer
1k views

How many positions are there in n-pieces endgame tablebases for different values of n? [duplicate]

Note that I don't want the exact values, I only need approximations. And I am only interested in small values of n (not more than 12).
Fate's user avatar
  • 4,894