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
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
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 answers only user 15632

A puzzle related to the game of chess. Questions about chess which aren't puzzles are off-topic but can be asked on Chess Stack Exchange.

16
votes
Pawn + Rook: Knight: Bishop + Queen: Another variant for the Bishop (there are even more):
answered Sep 1 '15 by Sleafar
19
votes
Here is a possible ...
answered Nov 8 '15 by Sleafar
7
votes
15
votes
@klm123 found a way to beat the mandarin again. However Li Chai used a different method in the original story.
answered Apr 9 '16 by Sleafar
3
votes
I have a solution with 6 rooks:
answered Oct 15 '16 by Sleafar
2
votes
The gibberish can be decoded ... I tried to decode the moves ...
answered May 11 '18 by Sleafar
7
votes
General thoughts Base Question Complete winning strategy (in all cases the rook has more moves left than the number specified for the bishop): 1. ... Bg7 2. Rh5 (Bishop has 11 moves left) 1. ... …
answered Aug 24 '15 by Sleafar
18
votes
@boboquack found the only solution. The following list shows suggestions from comments and other answers together with their refutation. You can click each link to show an image/animation.
answered Nov 15 '17 by Sleafar
14
votes
answered Nov 4 '16 by Sleafar
9
votes
The player who will win this game on an $8 \times 8$ board is: Computer based proof I managed to significantly increase the speed of my previously posted program, so I was able to calculate the re …
answered Nov 17 '15 by Sleafar