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 problems
Search options not deleted
user 30479
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.
31
votes
1
answer
7k
views
Can all 64 squares be attacked or defended by the eight pieces?
Can you place the eight (non-pawn) pieces of one color on an otherwise empty chess board, such that every square (including the squares that pieces are on), is attacked / defended?
This is a problem t …
- 411