Reverse Puzzling - Curious Chess
$begingroup$
George rubbed his hands together. "What have you got for me today?" he asked.
I showed him the pieces set up on the chess board and told him the stipulation.
"That's a very strange one." He said. "Where did it come from?"
I told him it was written in 1874 and the name of the author.
"Interesting, interesting. So you can't move the pawns, eh? Mmm. Well, Dijkstra should do it no problem."
My eyes widened at the thought but George was nothing if not thorough.
Half an hour later, I returned and George proudly announced the answer gesturing grandly at the whiteboard: "Twenty-seven! And there are two ways to do it."
I looked in awe at the whiteboard.
What was the puzzle that I gave George?
chess reverse-puzzling
asked 3 hours ago
Dr XorileDr Xorile
11.9k22566
$endgroup$
add a comment |
$begingroup$
George rubbed his hands together. "What have you got for me today?" he asked.
I showed him the pieces set up on the chess board and told him the stipulation.
"That's a very strange one." He said. "Where did it come from?"
I told him it was written in 1874 and the name of the author.
"Interesting, interesting. So you can't move the pawns, eh? Mmm. Well, Dijkstra should do it no problem."
My eyes widened at the thought but George was nothing if not thorough.
Half an hour later, I returned and George proudly announced the answer gesturing grandly at the whiteboard: "Twenty-seven! And there are two ways to do it."
I looked in awe at the whiteboard.
What was the puzzle that I gave George?
chess reverse-puzzling
asked 3 hours ago
Dr XorileDr Xorile
11.9k22566
$endgroup$
add a comment |
$begingroup$
George rubbed his hands together. "What have you got for me today?" he asked.
I showed him the pieces set up on the chess board and told him the stipulation.
"That's a very strange one." He said. "Where did it come from?"
I told him it was written in 1874 and the name of the author.
"Interesting, interesting. So you can't move the pawns, eh? Mmm. Well, Dijkstra should do it no problem."
My eyes widened at the thought but George was nothing if not thorough.
Half an hour later, I returned and George proudly announced the answer gesturing grandly at the whiteboard: "Twenty-seven! And there are two ways to do it."
I looked in awe at the whiteboard.
What was the puzzle that I gave George?
chess reverse-puzzling
asked 3 hours ago
Dr XorileDr Xorile
11.9k22566
$endgroup$
George rubbed his hands together. "What have you got for me today?" he asked.
I showed him the pieces set up on the chess board and told him the stipulation.
"That's a very strange one." He said. "Where did it come from?"
I told him it was written in 1874 and the name of the author.
"Interesting, interesting. So you can't move the pawns, eh? Mmm. Well, Dijkstra should do it no problem."
My eyes widened at the thought but George was nothing if not thorough.
Half an hour later, I returned and George proudly announced the answer gesturing grandly at the whiteboard: "Twenty-seven! And there are two ways to do it."
I looked in awe at the whiteboard.
What was the puzzle that I gave George?
chess reverse-puzzling
chess reverse-puzzling
asked 3 hours ago
Dr XorileDr Xorile
11.9k22566
asked 3 hours ago
Dr XorileDr Xorile
11.9k22566
asked 3 hours ago
Dr XorileDr Xorile
11.9k22566
asked 3 hours ago
Dr XorileDr Xorile
11.9k22566
asked 3 hours ago
Dr XorileDr Xorile
11.9k22566
11.9k22566
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Well, this is frustrating. The puzzle is clearly
the one described under the heading "logjam" here but the actual problem is given as a 4x4 table of images, and the images no longer exist, and my attempts to find the problem elsewhere on the internet have failed. But I think the position is
. P P P
. P R P
P P B K
n . B R
and the stipulation is that only W is to move, and that he is to capture the BN on what I would call a1 but I suppose we should in fact regard as e1 (so that this is the "southeast" quadrant of an ordinary 8x8 board), without moving any of the pawns.
The name of the author is
W A Shinkman, who I think was quite a prolific composer of ingenious chess problems. The citation on the page I linked above says that this problem is from the Deutsche Schachzeitung in June 1874.
Incidentally, my response to the problem would be pretty much the same as George's, though I'd be more inclined to get a computer to solve it rather than trying to do it on a whiteboard.
answered 2 hours ago
Gareth McCaughan♦Gareth McCaughan
61.2k3152236
$endgroup$
$begingroup$
Great job. Am I right in saying that @boboquack got there first? Nice job finding Shinkman.
$endgroup$
– Dr Xorile
36 mins ago
$begingroup$
@DrXorile Look at the timestamps. This answer was posted 23 minutes earlier than the other.
$endgroup$
– Daniel Mathias
8 secs ago
add a comment |
$begingroup$
I believe that this is a:
Move tree map of a chess maze (I couldn't find it online but here is a rendition, click to take to a board on lichess):
with the rules that:
No pawn may be moved and the objective is for the white king to take the black knight.
George is trying to:
Find the minimum number of moves to win and find how many ways there are to do it
and has used:
Djikstra's algorithm to navigate the move tree with the stipulation that no position may be repeated (so that the graph isn't infinite)
answered 2 hours ago
boboquackboboquack
15.4k149118
$endgroup$
$begingroup$
Less than an hour! Boom! Nice! Was it too easy, or were you just that good?
$endgroup$
– Dr Xorile
37 mins ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f79208%2freverse-puzzling-curious-chess%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Well, this is frustrating. The puzzle is clearly
the one described under the heading "logjam" here but the actual problem is given as a 4x4 table of images, and the images no longer exist, and my attempts to find the problem elsewhere on the internet have failed. But I think the position is
. P P P
. P R P
P P B K
n . B R
and the stipulation is that only W is to move, and that he is to capture the BN on what I would call a1 but I suppose we should in fact regard as e1 (so that this is the "southeast" quadrant of an ordinary 8x8 board), without moving any of the pawns.
The name of the author is
W A Shinkman, who I think was quite a prolific composer of ingenious chess problems. The citation on the page I linked above says that this problem is from the Deutsche Schachzeitung in June 1874.
Incidentally, my response to the problem would be pretty much the same as George's, though I'd be more inclined to get a computer to solve it rather than trying to do it on a whiteboard.
answered 2 hours ago
Gareth McCaughan♦Gareth McCaughan
61.2k3152236
$endgroup$
$begingroup$
Great job. Am I right in saying that @boboquack got there first? Nice job finding Shinkman.
$endgroup$
– Dr Xorile
36 mins ago
$begingroup$
@DrXorile Look at the timestamps. This answer was posted 23 minutes earlier than the other.
$endgroup$
– Daniel Mathias
8 secs ago
add a comment |
$begingroup$
Well, this is frustrating. The puzzle is clearly
the one described under the heading "logjam" here but the actual problem is given as a 4x4 table of images, and the images no longer exist, and my attempts to find the problem elsewhere on the internet have failed. But I think the position is
. P P P
. P R P
P P B K
n . B R
and the stipulation is that only W is to move, and that he is to capture the BN on what I would call a1 but I suppose we should in fact regard as e1 (so that this is the "southeast" quadrant of an ordinary 8x8 board), without moving any of the pawns.
The name of the author is
W A Shinkman, who I think was quite a prolific composer of ingenious chess problems. The citation on the page I linked above says that this problem is from the Deutsche Schachzeitung in June 1874.
Incidentally, my response to the problem would be pretty much the same as George's, though I'd be more inclined to get a computer to solve it rather than trying to do it on a whiteboard.
answered 2 hours ago
Gareth McCaughan♦Gareth McCaughan
61.2k3152236
$endgroup$
$begingroup$
Great job. Am I right in saying that @boboquack got there first? Nice job finding Shinkman.
$endgroup$
– Dr Xorile
36 mins ago
$begingroup$
@DrXorile Look at the timestamps. This answer was posted 23 minutes earlier than the other.
$endgroup$
– Daniel Mathias
8 secs ago
add a comment |
$begingroup$
Well, this is frustrating. The puzzle is clearly
the one described under the heading "logjam" here but the actual problem is given as a 4x4 table of images, and the images no longer exist, and my attempts to find the problem elsewhere on the internet have failed. But I think the position is
. P P P
. P R P
P P B K
n . B R
and the stipulation is that only W is to move, and that he is to capture the BN on what I would call a1 but I suppose we should in fact regard as e1 (so that this is the "southeast" quadrant of an ordinary 8x8 board), without moving any of the pawns.
The name of the author is
W A Shinkman, who I think was quite a prolific composer of ingenious chess problems. The citation on the page I linked above says that this problem is from the Deutsche Schachzeitung in June 1874.
Incidentally, my response to the problem would be pretty much the same as George's, though I'd be more inclined to get a computer to solve it rather than trying to do it on a whiteboard.
answered 2 hours ago
Gareth McCaughan♦Gareth McCaughan
61.2k3152236
$endgroup$
Well, this is frustrating. The puzzle is clearly
the one described under the heading "logjam" here but the actual problem is given as a 4x4 table of images, and the images no longer exist, and my attempts to find the problem elsewhere on the internet have failed. But I think the position is
. P P P
. P R P
P P B K
n . B R
and the stipulation is that only W is to move, and that he is to capture the BN on what I would call a1 but I suppose we should in fact regard as e1 (so that this is the "southeast" quadrant of an ordinary 8x8 board), without moving any of the pawns.
The name of the author is
W A Shinkman, who I think was quite a prolific composer of ingenious chess problems. The citation on the page I linked above says that this problem is from the Deutsche Schachzeitung in June 1874.
Incidentally, my response to the problem would be pretty much the same as George's, though I'd be more inclined to get a computer to solve it rather than trying to do it on a whiteboard.
answered 2 hours ago
Gareth McCaughan♦Gareth McCaughan
61.2k3152236
answered 2 hours ago
Gareth McCaughan♦Gareth McCaughan
61.2k3152236
answered 2 hours ago
Gareth McCaughan♦Gareth McCaughan
61.2k3152236
answered 2 hours ago
Gareth McCaughan♦Gareth McCaughan
61.2k3152236
61.2k3152236
$begingroup$
Great job. Am I right in saying that @boboquack got there first? Nice job finding Shinkman.
$endgroup$
– Dr Xorile
36 mins ago
$begingroup$
@DrXorile Look at the timestamps. This answer was posted 23 minutes earlier than the other.
$endgroup$
– Daniel Mathias
8 secs ago
add a comment |
$begingroup$
Great job. Am I right in saying that @boboquack got there first? Nice job finding Shinkman.
$endgroup$
– Dr Xorile
36 mins ago
$begingroup$
@DrXorile Look at the timestamps. This answer was posted 23 minutes earlier than the other.
$endgroup$
– Daniel Mathias
8 secs ago
$begingroup$
Great job. Am I right in saying that @boboquack got there first? Nice job finding Shinkman.
$endgroup$
– Dr Xorile
36 mins ago
$begingroup$
Great job. Am I right in saying that @boboquack got there first? Nice job finding Shinkman.
$endgroup$
– Dr Xorile
36 mins ago
$begingroup$
@DrXorile Look at the timestamps. This answer was posted 23 minutes earlier than the other.
$endgroup$
– Daniel Mathias
8 secs ago
$begingroup$
@DrXorile Look at the timestamps. This answer was posted 23 minutes earlier than the other.
$endgroup$
– Daniel Mathias
8 secs ago
add a comment |
$begingroup$
I believe that this is a:
Move tree map of a chess maze (I couldn't find it online but here is a rendition, click to take to a board on lichess):
with the rules that:
No pawn may be moved and the objective is for the white king to take the black knight.
George is trying to:
Find the minimum number of moves to win and find how many ways there are to do it
and has used:
Djikstra's algorithm to navigate the move tree with the stipulation that no position may be repeated (so that the graph isn't infinite)
answered 2 hours ago
boboquackboboquack
15.4k149118
$endgroup$
$begingroup$
Less than an hour! Boom! Nice! Was it too easy, or were you just that good?
$endgroup$
– Dr Xorile
37 mins ago
add a comment |
$begingroup$
I believe that this is a:
Move tree map of a chess maze (I couldn't find it online but here is a rendition, click to take to a board on lichess):
with the rules that:
No pawn may be moved and the objective is for the white king to take the black knight.
George is trying to:
Find the minimum number of moves to win and find how many ways there are to do it
and has used:
Djikstra's algorithm to navigate the move tree with the stipulation that no position may be repeated (so that the graph isn't infinite)
answered 2 hours ago
boboquackboboquack
15.4k149118
$endgroup$
$begingroup$
Less than an hour! Boom! Nice! Was it too easy, or were you just that good?
$endgroup$
– Dr Xorile
37 mins ago
add a comment |
$begingroup$
I believe that this is a:
Move tree map of a chess maze (I couldn't find it online but here is a rendition, click to take to a board on lichess):
with the rules that:
No pawn may be moved and the objective is for the white king to take the black knight.
George is trying to:
Find the minimum number of moves to win and find how many ways there are to do it
and has used:
Djikstra's algorithm to navigate the move tree with the stipulation that no position may be repeated (so that the graph isn't infinite)
answered 2 hours ago
boboquackboboquack
15.4k149118
$endgroup$
I believe that this is a:
Move tree map of a chess maze (I couldn't find it online but here is a rendition, click to take to a board on lichess):
with the rules that:
No pawn may be moved and the objective is for the white king to take the black knight.
George is trying to:
Find the minimum number of moves to win and find how many ways there are to do it
and has used:
Djikstra's algorithm to navigate the move tree with the stipulation that no position may be repeated (so that the graph isn't infinite)
answered 2 hours ago
boboquackboboquack
15.4k149118
answered 2 hours ago
boboquackboboquack
15.4k149118
answered 2 hours ago
boboquackboboquack
15.4k149118
answered 2 hours ago
boboquackboboquack
15.4k149118
15.4k149118
$begingroup$
Less than an hour! Boom! Nice! Was it too easy, or were you just that good?
$endgroup$
– Dr Xorile
37 mins ago
add a comment |
$begingroup$
Less than an hour! Boom! Nice! Was it too easy, or were you just that good?
$endgroup$
– Dr Xorile
37 mins ago
$begingroup$
Less than an hour! Boom! Nice! Was it too easy, or were you just that good?
$endgroup$
– Dr Xorile
37 mins ago
$begingroup$
Less than an hour! Boom! Nice! Was it too easy, or were you just that good?
$endgroup$
– Dr Xorile
37 mins ago
add a comment |
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f79208%2freverse-puzzling-curious-chess%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
