Skip to main content
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
Search options not deleted user 35006

Chess problems consist of a board position and a task. Most ask for a line of play that mates black in a set amount of moves, or a combination that results in a winning position. Many other types exist, including, but not limited to, construction tasks for various positions and proof games that have numerous goals, selfmates, helpmates, and retrograde analysis. Tournaments and championships exist for composing of original problems and for speed-solving.

15 votes
1 answer
3k views

Checkmate in ω² moves with finitely many pieces

The post Checkmate in ω moves? has inspired a lot of discussion and mathematical research into positions on an infinite chessboard where white can mate in a transfinite amount of moves. The current re …
Andreas Tsevas's user avatar
21 votes
Accepted

Checkmate in ω² moves with finitely many pieces

Introducing a position of game value ω² with finitely many pieces In the following position with finitely many pieces, White has mate-in-ω² (Black to move): (For convenience, I put the position into a …
Andreas Tsevas's user avatar
3 votes
1 answer
298 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 la …
Andreas Tsevas's user avatar