The Fastest Way-A Special Positional Challenge
$begingroup$
This is my first “find the fastest way to this position” chess puzzle” here on PSE. However, this is not for just some random position. Let me explain.
Tim Krabbe has said on his site-(Journal Entry 387)[https://timkr.home.xs4all.nl/chess2/diary.htm]-, that the record, at least in 2013 for the most mutual consecutive checks is 54. He says that a proof game was sent to him, but I cannot find the game anywhere. This makes this a special question, because this is not only for a puzzle, but for practical purposes as well.
This is today’s challenge. Try to find the fastest way that you can to this position: (I thought it would be fun to make it a competition!;D)
23 August 2013: 54 consecutive checks by Alexey Khanyan
The FEN string is this, for your convienence: [FEN "5q2/2q1pn1B/R1Q1R3/1B2r1B1/1q1k1Knq/rr5Q/B2NPN1N/3Qb1QQ w - - 0 1"]
The last move is by black. Then the position must occur.
This (site)[https://www.chess.com/forum/view/more-puzzles/consecutive-checks] has a few tips I believe, as someone showed how the position is legal.
chess construction
asked 7 mins ago
Rewan DemontayRewan Demontay
80917
$endgroup$
add a comment |
$begingroup$
This is my first “find the fastest way to this position” chess puzzle” here on PSE. However, this is not for just some random position. Let me explain.
Tim Krabbe has said on his site-(Journal Entry 387)[https://timkr.home.xs4all.nl/chess2/diary.htm]-, that the record, at least in 2013 for the most mutual consecutive checks is 54. He says that a proof game was sent to him, but I cannot find the game anywhere. This makes this a special question, because this is not only for a puzzle, but for practical purposes as well.
This is today’s challenge. Try to find the fastest way that you can to this position: (I thought it would be fun to make it a competition!;D)
23 August 2013: 54 consecutive checks by Alexey Khanyan
The FEN string is this, for your convienence: [FEN "5q2/2q1pn1B/R1Q1R3/1B2r1B1/1q1k1Knq/rr5Q/B2NPN1N/3Qb1QQ w - - 0 1"]
The last move is by black. Then the position must occur.
This (site)[https://www.chess.com/forum/view/more-puzzles/consecutive-checks] has a few tips I believe, as someone showed how the position is legal.
chess construction
asked 7 mins ago
Rewan DemontayRewan Demontay
80917
$endgroup$
add a comment |
$begingroup$
This is my first “find the fastest way to this position” chess puzzle” here on PSE. However, this is not for just some random position. Let me explain.
Tim Krabbe has said on his site-(Journal Entry 387)[https://timkr.home.xs4all.nl/chess2/diary.htm]-, that the record, at least in 2013 for the most mutual consecutive checks is 54. He says that a proof game was sent to him, but I cannot find the game anywhere. This makes this a special question, because this is not only for a puzzle, but for practical purposes as well.
This is today’s challenge. Try to find the fastest way that you can to this position: (I thought it would be fun to make it a competition!;D)
23 August 2013: 54 consecutive checks by Alexey Khanyan
The FEN string is this, for your convienence: [FEN "5q2/2q1pn1B/R1Q1R3/1B2r1B1/1q1k1Knq/rr5Q/B2NPN1N/3Qb1QQ w - - 0 1"]
The last move is by black. Then the position must occur.
This (site)[https://www.chess.com/forum/view/more-puzzles/consecutive-checks] has a few tips I believe, as someone showed how the position is legal.
chess construction
asked 7 mins ago
Rewan DemontayRewan Demontay
80917
$endgroup$
This is my first “find the fastest way to this position” chess puzzle” here on PSE. However, this is not for just some random position. Let me explain.
Tim Krabbe has said on his site-(Journal Entry 387)[https://timkr.home.xs4all.nl/chess2/diary.htm]-, that the record, at least in 2013 for the most mutual consecutive checks is 54. He says that a proof game was sent to him, but I cannot find the game anywhere. This makes this a special question, because this is not only for a puzzle, but for practical purposes as well.
This is today’s challenge. Try to find the fastest way that you can to this position: (I thought it would be fun to make it a competition!;D)
23 August 2013: 54 consecutive checks by Alexey Khanyan
The FEN string is this, for your convienence: [FEN "5q2/2q1pn1B/R1Q1R3/1B2r1B1/1q1k1Knq/rr5Q/B2NPN1N/3Qb1QQ w - - 0 1"]
The last move is by black. Then the position must occur.
This (site)[https://www.chess.com/forum/view/more-puzzles/consecutive-checks] has a few tips I believe, as someone showed how the position is legal.
chess construction
chess construction
asked 7 mins ago
Rewan DemontayRewan Demontay
80917
asked 7 mins ago
Rewan DemontayRewan Demontay
80917
asked 7 mins ago
Rewan DemontayRewan Demontay
80917
asked 7 mins ago
Rewan DemontayRewan Demontay
80917
asked 7 mins ago
Rewan DemontayRewan Demontay
80917
80917
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
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%2f81911%2fthe-fastest-way-a-special-positional-challenge%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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%2f81911%2fthe-fastest-way-a-special-positional-challenge%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
