Mixing
Knights Problem
$begingroup$
There are 2 white knights and 2 black knights positioned at a (3 X 3) chess board. Find the minimum number of moves required to replace the blacks with whites and the whites with blacks.
I tried the above in 19 steps and reckon that I'm wrong. Please help !!
I guess the catch here is to position the knights in
0w0
w0b
0b0
or
0b0
w0b
0w0
0 -> empty space | w -> white knight | b -> black knights
What is your take on this? Here is my solution, but it seems that my answer takes longer number of steps.
EDIT
For some of those who still have some doubts regarding the question, the final configuration should be:
BoW
ooo
BoW
logical-deduction chess
asked Jan 30 at 2:22
jayjay
1344
$endgroup$
add a comment |
$begingroup$
There are 2 white knights and 2 black knights positioned at a (3 X 3) chess board. Find the minimum number of moves required to replace the blacks with whites and the whites with blacks.
I tried the above in 19 steps and reckon that I'm wrong. Please help !!
I guess the catch here is to position the knights in
0w0
w0b
0b0
or
0b0
w0b
0w0
0 -> empty space | w -> white knight | b -> black knights
What is your take on this? Here is my solution, but it seems that my answer takes longer number of steps.
EDIT
For some of those who still have some doubts regarding the question, the final configuration should be:
BoW
ooo
BoW
logical-deduction chess
asked Jan 30 at 2:22
jayjay
1344
$endgroup$
$begingroup$
Welcome to Puzzling SE! If you haven't already done so, please take the tour! You'll also get a free badge :). Normally, asking questions like these are slightly frowned upon as in can bring a lot of speculations or a variety of answers. This one might be okay though, so I would need some confirmation.
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
Do you have to source of the puzzle by chance?
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
@North Didn't get your first comment. What type of question is this? Is it not suitable to ask at this platform. Sorry, but I don't have any source.
$endgroup$
– jay
Jan 30 at 12:13
$begingroup$
This is a classic puzzle, which I think I've seen discussed in a Martin Gardner book/column, and maybe also in one of H.E. Dudeney's books. Variants of this puzzle have been posted here before, e.g. Desegregate the knights with a different goal, and Switch the knights on a 3x4 board, and Swapping knights on a 4x4 board.
$endgroup$
– Jaap Scherphuis
Jan 30 at 13:25
$begingroup$
@jay No, no, this puzzle is fine, I was just concerned it might warrant a lot of different answers. clearly it didn't though :)
$endgroup$
– North
Jan 30 at 14:09
add a comment |
$begingroup$
There are 2 white knights and 2 black knights positioned at a (3 X 3) chess board. Find the minimum number of moves required to replace the blacks with whites and the whites with blacks.
I tried the above in 19 steps and reckon that I'm wrong. Please help !!
I guess the catch here is to position the knights in
0w0
w0b
0b0
or
0b0
w0b
0w0
0 -> empty space | w -> white knight | b -> black knights
What is your take on this? Here is my solution, but it seems that my answer takes longer number of steps.
EDIT
For some of those who still have some doubts regarding the question, the final configuration should be:
BoW
ooo
BoW
logical-deduction chess
asked Jan 30 at 2:22
jayjay
1344
$endgroup$
There are 2 white knights and 2 black knights positioned at a (3 X 3) chess board. Find the minimum number of moves required to replace the blacks with whites and the whites with blacks.
I tried the above in 19 steps and reckon that I'm wrong. Please help !!
I guess the catch here is to position the knights in
0w0
w0b
0b0
or
0b0
w0b
0w0
0 -> empty space | w -> white knight | b -> black knights
What is your take on this? Here is my solution, but it seems that my answer takes longer number of steps.
EDIT
For some of those who still have some doubts regarding the question, the final configuration should be:
BoW
ooo
BoW
logical-deduction chess
logical-deduction chess
asked Jan 30 at 2:22
jayjay
1344
asked Jan 30 at 2:22
jayjay
1344
edited Jan 30 at 12:10
jay
asked Jan 30 at 2:22
jayjay
1344
asked Jan 30 at 2:22
jayjay
1344
asked Jan 30 at 2:22
jayjay
1344
1344
$begingroup$
Welcome to Puzzling SE! If you haven't already done so, please take the tour! You'll also get a free badge :). Normally, asking questions like these are slightly frowned upon as in can bring a lot of speculations or a variety of answers. This one might be okay though, so I would need some confirmation.
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
Do you have to source of the puzzle by chance?
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
@North Didn't get your first comment. What type of question is this? Is it not suitable to ask at this platform. Sorry, but I don't have any source.
$endgroup$
– jay
Jan 30 at 12:13
$begingroup$
This is a classic puzzle, which I think I've seen discussed in a Martin Gardner book/column, and maybe also in one of H.E. Dudeney's books. Variants of this puzzle have been posted here before, e.g. Desegregate the knights with a different goal, and Switch the knights on a 3x4 board, and Swapping knights on a 4x4 board.
$endgroup$
– Jaap Scherphuis
Jan 30 at 13:25
$begingroup$
@jay No, no, this puzzle is fine, I was just concerned it might warrant a lot of different answers. clearly it didn't though :)
$endgroup$
– North
Jan 30 at 14:09
add a comment |
$begingroup$
Welcome to Puzzling SE! If you haven't already done so, please take the tour! You'll also get a free badge :). Normally, asking questions like these are slightly frowned upon as in can bring a lot of speculations or a variety of answers. This one might be okay though, so I would need some confirmation.
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
Do you have to source of the puzzle by chance?
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
@North Didn't get your first comment. What type of question is this? Is it not suitable to ask at this platform. Sorry, but I don't have any source.
$endgroup$
– jay
Jan 30 at 12:13
$begingroup$
This is a classic puzzle, which I think I've seen discussed in a Martin Gardner book/column, and maybe also in one of H.E. Dudeney's books. Variants of this puzzle have been posted here before, e.g. Desegregate the knights with a different goal, and Switch the knights on a 3x4 board, and Swapping knights on a 4x4 board.
$endgroup$
– Jaap Scherphuis
Jan 30 at 13:25
$begingroup$
@jay No, no, this puzzle is fine, I was just concerned it might warrant a lot of different answers. clearly it didn't though :)
$endgroup$
– North
Jan 30 at 14:09
$begingroup$
Welcome to Puzzling SE! If you haven't already done so, please take the tour! You'll also get a free badge :). Normally, asking questions like these are slightly frowned upon as in can bring a lot of speculations or a variety of answers. This one might be okay though, so I would need some confirmation.
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
Welcome to Puzzling SE! If you haven't already done so, please take the tour! You'll also get a free badge :). Normally, asking questions like these are slightly frowned upon as in can bring a lot of speculations or a variety of answers. This one might be okay though, so I would need some confirmation.
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
Do you have to source of the puzzle by chance?
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
Do you have to source of the puzzle by chance?
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
@North Didn't get your first comment. What type of question is this? Is it not suitable to ask at this platform. Sorry, but I don't have any source.
$endgroup$
– jay
Jan 30 at 12:13
$begingroup$
@North Didn't get your first comment. What type of question is this? Is it not suitable to ask at this platform. Sorry, but I don't have any source.
$endgroup$
– jay
Jan 30 at 12:13
$begingroup$
This is a classic puzzle, which I think I've seen discussed in a Martin Gardner book/column, and maybe also in one of H.E. Dudeney's books. Variants of this puzzle have been posted here before, e.g. Desegregate the knights with a different goal, and Switch the knights on a 3x4 board, and Swapping knights on a 4x4 board.
$endgroup$
– Jaap Scherphuis
Jan 30 at 13:25
$begingroup$
This is a classic puzzle, which I think I've seen discussed in a Martin Gardner book/column, and maybe also in one of H.E. Dudeney's books. Variants of this puzzle have been posted here before, e.g. Desegregate the knights with a different goal, and Switch the knights on a 3x4 board, and Swapping knights on a 4x4 board.
$endgroup$
– Jaap Scherphuis
Jan 30 at 13:25
$begingroup$
@jay No, no, this puzzle is fine, I was just concerned it might warrant a lot of different answers. clearly it didn't though :)
$endgroup$
– North
Jan 30 at 14:09
$begingroup$
@jay No, no, this puzzle is fine, I was just concerned it might warrant a lot of different answers. clearly it didn't though :)
$endgroup$
– North
Jan 30 at 14:09
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
If you numbered the board like this:
Then it is easy to notice that:
The route of each knights is a cycle of:
$dots - 1 - 6 - 7 - 2 - 9 - 4 - 3 - 8 - dots$
(i.e. from $2$ can go to $7$ or $9$ and etc.)
Therefore:
We want to move white from $1&7$ to $9&3$, for black from the $9&3$ to $1&7$.
It is straightforward that the minimum movement we should take is shifting them all $4$ times to right or left.
Hence, $4 times 4 = 16$ moves is the optimal one.
answered Jan 30 at 3:31
athinathin
8,48522776
$endgroup$
$begingroup$
that's a much better proof than what I did - which was to sit down to a 3x3 chessboard I happened to have leftover from a woodworking project. Proof > brute force.
$endgroup$
– Van
Jan 30 at 3:39
add a comment |
$begingroup$
Although @athin seems to have proven it impossible, I can't find any problem with my solution in
8 moves
Here it is:
1. Na3 Nc3
2. Nc1 Na1
3. Nc2 Nb2
4. Na2 Nb3
Since the path is cyclic, there are working positions reached along the way too, of course.
answered Jan 30 at 5:09
BassBass
30.9k472188
$endgroup$
1
$begingroup$
Eh, can the starting positions be different than the one given by OP?
$endgroup$
– athin
Jan 30 at 6:22
$begingroup$
@athin, OP seems to have given three different starting positions, and there's nothing forbidding it, so, yes, I guess?
$endgroup$
– Bass
Jan 30 at 6:49
$begingroup$
OP gave 1 starting position, and 2 "almost there" positions that they were aiming at (neither of which were ever actually reached in the solution I devised - I suspect that it was "forcing" those positions that pushed OPs score up to 19 instead of 16)
$endgroup$
– Chronocidal
Jan 30 at 13:23
$begingroup$
@Chronocidal, ah, it is indeed possible to interpret "I tried the above" as meaning "I tried the above, which also had the fixed starting position below", and "position the knights" as "position the knights by moving them from the fixed starting position". Judging from OP's later edit, this might even be what OP meant. That didn't really occur to me at all.
$endgroup$
– Bass
Jan 30 at 13:31
add a comment |
$begingroup$
I can get you down to 16 moves. I don't know if I can do any better.
Start off by
moving all four corners onto the black squares, giving
oWo
BoW
oBo
Then, instead of returning to the original square, move
them onto a corner one rotation away from where they started. This gives:
BoB
ooo
WoW
Eight moves total, so far.
Follow the same process for four more moves, and you wind up with:
oWo
WoB
oBo
and then, four more moves (for a total of sixteen):
BoW
ooo
BoW
answered Jan 30 at 3:26
VanVan
59312
$endgroup$
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%2f79032%2fknights-problem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If you numbered the board like this:
Then it is easy to notice that:
The route of each knights is a cycle of:
$dots - 1 - 6 - 7 - 2 - 9 - 4 - 3 - 8 - dots$
(i.e. from $2$ can go to $7$ or $9$ and etc.)
Therefore:
We want to move white from $1&7$ to $9&3$, for black from the $9&3$ to $1&7$.
It is straightforward that the minimum movement we should take is shifting them all $4$ times to right or left.
Hence, $4 times 4 = 16$ moves is the optimal one.
answered Jan 30 at 3:31
athinathin
8,48522776
$endgroup$
$begingroup$
that's a much better proof than what I did - which was to sit down to a 3x3 chessboard I happened to have leftover from a woodworking project. Proof > brute force.
$endgroup$
– Van
Jan 30 at 3:39
add a comment |
$begingroup$
If you numbered the board like this:
Then it is easy to notice that:
The route of each knights is a cycle of:
$dots - 1 - 6 - 7 - 2 - 9 - 4 - 3 - 8 - dots$
(i.e. from $2$ can go to $7$ or $9$ and etc.)
Therefore:
We want to move white from $1&7$ to $9&3$, for black from the $9&3$ to $1&7$.
It is straightforward that the minimum movement we should take is shifting them all $4$ times to right or left.
Hence, $4 times 4 = 16$ moves is the optimal one.
answered Jan 30 at 3:31
athinathin
8,48522776
$endgroup$
$begingroup$
that's a much better proof than what I did - which was to sit down to a 3x3 chessboard I happened to have leftover from a woodworking project. Proof > brute force.
$endgroup$
– Van
Jan 30 at 3:39
add a comment |
$begingroup$
If you numbered the board like this:
Then it is easy to notice that:
The route of each knights is a cycle of:
$dots - 1 - 6 - 7 - 2 - 9 - 4 - 3 - 8 - dots$
(i.e. from $2$ can go to $7$ or $9$ and etc.)
Therefore:
We want to move white from $1&7$ to $9&3$, for black from the $9&3$ to $1&7$.
It is straightforward that the minimum movement we should take is shifting them all $4$ times to right or left.
Hence, $4 times 4 = 16$ moves is the optimal one.
answered Jan 30 at 3:31
athinathin
8,48522776
$endgroup$
If you numbered the board like this:
Then it is easy to notice that:
The route of each knights is a cycle of:
$dots - 1 - 6 - 7 - 2 - 9 - 4 - 3 - 8 - dots$
(i.e. from $2$ can go to $7$ or $9$ and etc.)
Therefore:
We want to move white from $1&7$ to $9&3$, for black from the $9&3$ to $1&7$.
It is straightforward that the minimum movement we should take is shifting them all $4$ times to right or left.
Hence, $4 times 4 = 16$ moves is the optimal one.
answered Jan 30 at 3:31
athinathin
8,48522776
answered Jan 30 at 3:31
athinathin
8,48522776
answered Jan 30 at 3:31
athinathin
8,48522776
answered Jan 30 at 3:31
athinathin
8,48522776
8,48522776
$begingroup$
that's a much better proof than what I did - which was to sit down to a 3x3 chessboard I happened to have leftover from a woodworking project. Proof > brute force.
$endgroup$
– Van
Jan 30 at 3:39
add a comment |
$begingroup$
that's a much better proof than what I did - which was to sit down to a 3x3 chessboard I happened to have leftover from a woodworking project. Proof > brute force.
$endgroup$
– Van
Jan 30 at 3:39
$begingroup$
that's a much better proof than what I did - which was to sit down to a 3x3 chessboard I happened to have leftover from a woodworking project. Proof > brute force.
$endgroup$
– Van
Jan 30 at 3:39
$begingroup$
that's a much better proof than what I did - which was to sit down to a 3x3 chessboard I happened to have leftover from a woodworking project. Proof > brute force.
$endgroup$
– Van
Jan 30 at 3:39
add a comment |
$begingroup$
Although @athin seems to have proven it impossible, I can't find any problem with my solution in
8 moves
Here it is:
1. Na3 Nc3
2. Nc1 Na1
3. Nc2 Nb2
4. Na2 Nb3
Since the path is cyclic, there are working positions reached along the way too, of course.
answered Jan 30 at 5:09
BassBass
30.9k472188
$endgroup$
1
$begingroup$
Eh, can the starting positions be different than the one given by OP?
$endgroup$
– athin
Jan 30 at 6:22
$begingroup$
@athin, OP seems to have given three different starting positions, and there's nothing forbidding it, so, yes, I guess?
$endgroup$
– Bass
Jan 30 at 6:49
$begingroup$
OP gave 1 starting position, and 2 "almost there" positions that they were aiming at (neither of which were ever actually reached in the solution I devised - I suspect that it was "forcing" those positions that pushed OPs score up to 19 instead of 16)
$endgroup$
– Chronocidal
Jan 30 at 13:23
$begingroup$
@Chronocidal, ah, it is indeed possible to interpret "I tried the above" as meaning "I tried the above, which also had the fixed starting position below", and "position the knights" as "position the knights by moving them from the fixed starting position". Judging from OP's later edit, this might even be what OP meant. That didn't really occur to me at all.
$endgroup$
– Bass
Jan 30 at 13:31
add a comment |
$begingroup$
Although @athin seems to have proven it impossible, I can't find any problem with my solution in
8 moves
Here it is:
1. Na3 Nc3
2. Nc1 Na1
3. Nc2 Nb2
4. Na2 Nb3
Since the path is cyclic, there are working positions reached along the way too, of course.
answered Jan 30 at 5:09
BassBass
30.9k472188
$endgroup$
1
$begingroup$
Eh, can the starting positions be different than the one given by OP?
$endgroup$
– athin
Jan 30 at 6:22
$begingroup$
@athin, OP seems to have given three different starting positions, and there's nothing forbidding it, so, yes, I guess?
$endgroup$
– Bass
Jan 30 at 6:49
$begingroup$
OP gave 1 starting position, and 2 "almost there" positions that they were aiming at (neither of which were ever actually reached in the solution I devised - I suspect that it was "forcing" those positions that pushed OPs score up to 19 instead of 16)
$endgroup$
– Chronocidal
Jan 30 at 13:23
$begingroup$
@Chronocidal, ah, it is indeed possible to interpret "I tried the above" as meaning "I tried the above, which also had the fixed starting position below", and "position the knights" as "position the knights by moving them from the fixed starting position". Judging from OP's later edit, this might even be what OP meant. That didn't really occur to me at all.
$endgroup$
– Bass
Jan 30 at 13:31
add a comment |
$begingroup$
Although @athin seems to have proven it impossible, I can't find any problem with my solution in
8 moves
Here it is:
1. Na3 Nc3
2. Nc1 Na1
3. Nc2 Nb2
4. Na2 Nb3
Since the path is cyclic, there are working positions reached along the way too, of course.
answered Jan 30 at 5:09
BassBass
30.9k472188
$endgroup$
Although @athin seems to have proven it impossible, I can't find any problem with my solution in
8 moves
Here it is:
1. Na3 Nc3
2. Nc1 Na1
3. Nc2 Nb2
4. Na2 Nb3
Since the path is cyclic, there are working positions reached along the way too, of course.
answered Jan 30 at 5:09
BassBass
30.9k472188
answered Jan 30 at 5:09
BassBass
30.9k472188
answered Jan 30 at 5:09
BassBass
30.9k472188
answered Jan 30 at 5:09
BassBass
30.9k472188
30.9k472188
1
$begingroup$
Eh, can the starting positions be different than the one given by OP?
$endgroup$
– athin
Jan 30 at 6:22
$begingroup$
@athin, OP seems to have given three different starting positions, and there's nothing forbidding it, so, yes, I guess?
$endgroup$
– Bass
Jan 30 at 6:49
$begingroup$
OP gave 1 starting position, and 2 "almost there" positions that they were aiming at (neither of which were ever actually reached in the solution I devised - I suspect that it was "forcing" those positions that pushed OPs score up to 19 instead of 16)
$endgroup$
– Chronocidal
Jan 30 at 13:23
$begingroup$
@Chronocidal, ah, it is indeed possible to interpret "I tried the above" as meaning "I tried the above, which also had the fixed starting position below", and "position the knights" as "position the knights by moving them from the fixed starting position". Judging from OP's later edit, this might even be what OP meant. That didn't really occur to me at all.
$endgroup$
– Bass
Jan 30 at 13:31
add a comment |
1
$begingroup$
Eh, can the starting positions be different than the one given by OP?
$endgroup$
– athin
Jan 30 at 6:22
$begingroup$
@athin, OP seems to have given three different starting positions, and there's nothing forbidding it, so, yes, I guess?
$endgroup$
– Bass
Jan 30 at 6:49
$begingroup$
OP gave 1 starting position, and 2 "almost there" positions that they were aiming at (neither of which were ever actually reached in the solution I devised - I suspect that it was "forcing" those positions that pushed OPs score up to 19 instead of 16)
$endgroup$
– Chronocidal
Jan 30 at 13:23
$begingroup$
@Chronocidal, ah, it is indeed possible to interpret "I tried the above" as meaning "I tried the above, which also had the fixed starting position below", and "position the knights" as "position the knights by moving them from the fixed starting position". Judging from OP's later edit, this might even be what OP meant. That didn't really occur to me at all.
$endgroup$
– Bass
Jan 30 at 13:31
1
1
$begingroup$
Eh, can the starting positions be different than the one given by OP?
$endgroup$
– athin
Jan 30 at 6:22
$begingroup$
Eh, can the starting positions be different than the one given by OP?
$endgroup$
– athin
Jan 30 at 6:22
$begingroup$
@athin, OP seems to have given three different starting positions, and there's nothing forbidding it, so, yes, I guess?
$endgroup$
– Bass
Jan 30 at 6:49
$begingroup$
@athin, OP seems to have given three different starting positions, and there's nothing forbidding it, so, yes, I guess?
$endgroup$
– Bass
Jan 30 at 6:49
$begingroup$
OP gave 1 starting position, and 2 "almost there" positions that they were aiming at (neither of which were ever actually reached in the solution I devised - I suspect that it was "forcing" those positions that pushed OPs score up to 19 instead of 16)
$endgroup$
– Chronocidal
Jan 30 at 13:23
$begingroup$
OP gave 1 starting position, and 2 "almost there" positions that they were aiming at (neither of which were ever actually reached in the solution I devised - I suspect that it was "forcing" those positions that pushed OPs score up to 19 instead of 16)
$endgroup$
– Chronocidal
Jan 30 at 13:23
$begingroup$
@Chronocidal, ah, it is indeed possible to interpret "I tried the above" as meaning "I tried the above, which also had the fixed starting position below", and "position the knights" as "position the knights by moving them from the fixed starting position". Judging from OP's later edit, this might even be what OP meant. That didn't really occur to me at all.
$endgroup$
– Bass
Jan 30 at 13:31
$begingroup$
@Chronocidal, ah, it is indeed possible to interpret "I tried the above" as meaning "I tried the above, which also had the fixed starting position below", and "position the knights" as "position the knights by moving them from the fixed starting position". Judging from OP's later edit, this might even be what OP meant. That didn't really occur to me at all.
$endgroup$
– Bass
Jan 30 at 13:31
add a comment |
$begingroup$
I can get you down to 16 moves. I don't know if I can do any better.
Start off by
moving all four corners onto the black squares, giving
oWo
BoW
oBo
Then, instead of returning to the original square, move
them onto a corner one rotation away from where they started. This gives:
BoB
ooo
WoW
Eight moves total, so far.
Follow the same process for four more moves, and you wind up with:
oWo
WoB
oBo
and then, four more moves (for a total of sixteen):
BoW
ooo
BoW
answered Jan 30 at 3:26
VanVan
59312
$endgroup$
add a comment |
$begingroup$
I can get you down to 16 moves. I don't know if I can do any better.
Start off by
moving all four corners onto the black squares, giving
oWo
BoW
oBo
Then, instead of returning to the original square, move
them onto a corner one rotation away from where they started. This gives:
BoB
ooo
WoW
Eight moves total, so far.
Follow the same process for four more moves, and you wind up with:
oWo
WoB
oBo
and then, four more moves (for a total of sixteen):
BoW
ooo
BoW
answered Jan 30 at 3:26
VanVan
59312
$endgroup$
add a comment |
$begingroup$
I can get you down to 16 moves. I don't know if I can do any better.
Start off by
moving all four corners onto the black squares, giving
oWo
BoW
oBo
Then, instead of returning to the original square, move
them onto a corner one rotation away from where they started. This gives:
BoB
ooo
WoW
Eight moves total, so far.
Follow the same process for four more moves, and you wind up with:
oWo
WoB
oBo
and then, four more moves (for a total of sixteen):
BoW
ooo
BoW
answered Jan 30 at 3:26
VanVan
59312
$endgroup$
I can get you down to 16 moves. I don't know if I can do any better.
Start off by
moving all four corners onto the black squares, giving
oWo
BoW
oBo
Then, instead of returning to the original square, move
them onto a corner one rotation away from where they started. This gives:
BoB
ooo
WoW
Eight moves total, so far.
Follow the same process for four more moves, and you wind up with:
oWo
WoB
oBo
and then, four more moves (for a total of sixteen):
BoW
ooo
BoW
answered Jan 30 at 3:26
VanVan
59312
answered Jan 30 at 3:26
VanVan
59312
answered Jan 30 at 3:26
VanVan
59312
answered Jan 30 at 3:26
VanVan
59312
59312
add a comment |
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%2f79032%2fknights-problem%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
$begingroup$
Welcome to Puzzling SE! If you haven't already done so, please take the tour! You'll also get a free badge :). Normally, asking questions like these are slightly frowned upon as in can bring a lot of speculations or a variety of answers. This one might be okay though, so I would need some confirmation.
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
Do you have to source of the puzzle by chance?
$endgroup$
– North
Jan 30 at 3:03
$begingroup$
@North Didn't get your first comment. What type of question is this? Is it not suitable to ask at this platform. Sorry, but I don't have any source.
$endgroup$
– jay
Jan 30 at 12:13
$begingroup$
This is a classic puzzle, which I think I've seen discussed in a Martin Gardner book/column, and maybe also in one of H.E. Dudeney's books. Variants of this puzzle have been posted here before, e.g. Desegregate the knights with a different goal, and Switch the knights on a 3x4 board, and Swapping knights on a 4x4 board.
$endgroup$
– Jaap Scherphuis
Jan 30 at 13:25
$begingroup$
@jay No, no, this puzzle is fine, I was just concerned it might warrant a lot of different answers. clearly it didn't though :)
$endgroup$
– North
Jan 30 at 14:09