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 questions only not deleted user 5784

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.

21 votes
4 answers
5k views

What is the theoretical limit for the number of consecutive checks?

The known record for the longest sequence of consecutive checks (i.e. white checks, then black checks on the next move, white checks next, and so on) in a legal position without promoted pieces, is 37 …
Peter's user avatar
  • 3,429
22 votes
4 answers
5k views

What is the longest known sequence of forced moves leading to a checkmate for one side?

By forced move, it is meant that the player has only one legal move. [fen "7k/q5Q1/p4PPK/6PP/8/5P2/8/8 b - - 0 1"] 1... Qxg7+ 2. fxg7+ Kg8 3. f4 a5 4. f5 a4 5. f6 a3 6. f7# Above is an example wit …
Peter's user avatar
  • 3,429
9 votes
3 answers
2k views

Full board with full point mutual zugzwang

I have two questions. 1) Is there a position with all pieces on board such that the side to move loses? 2) Is there a position with all pieces on board such that the side to move is checkmated in 1? …
Peter's user avatar
  • 3,429