Lead the way to this Literary Knight to its final “DESTINATION”Knight on the keyboardThe Knight of WordsTrapping The KnightThis way up! Who am I?The Knight and the MazeI explore the final frontierThe Knight Checker or Football ChessWill this be my final Riley Riddle?“Murder!”, said the knightThe Not So Knights Challenge
New Site Design!
Leveraging cash for buying car
Should I email my professor to clear up a (possibly very irrelevant) awkward misunderstanding?
Does knowing the surface area of all faces uniquely determine a tetrahedron?
Explicit direct #include vs. Non-contractual transitive #include
Does anyone recognize these rockets, and their location?
2 Managed Packages in 1 Dev Org
How to make all magic-casting innate, but still rare?
Digital signature that is only verifiable by one specific person
How can a flywheel makes engine runs smoothly?
Manager wants to hire me; HR does not. How to proceed?
Huge Heap Table and table compression on SQL Server 2016
Will users know a CardView is clickable?
XML Query Question
Leaving job close to major deadlines
At what temperature should the earth be cooked to prevent human infection?
Interview was just a one hour panel. Got an offer the next day; do I accept or is this a red flag?
How do I gain the trust of other PCs?
Schedule Batch Apex too many rows
Using roof rails to set up hammock
Is swap gate equivalent to just exchanging the wire of the two qubits?
Is the infant mortality rate among African-American babies in Youngstown, Ohio greater than that of babies in Iran?
What are the mechanical differences between Adapt and Monstrosity?
How can I maintain game balance while allowing my player to craft genuinely useful items?
Lead the way to this Literary Knight to its final “DESTINATION”
Knight on the keyboardThe Knight of WordsTrapping The KnightThis way up! Who am I?The Knight and the MazeI explore the final frontierThe Knight Checker or Football ChessWill this be my final Riley Riddle?“Murder!”, said the knightThe Not So Knights Challenge
$begingroup$
As this Literary Knight (only chess move allowed) hops along, picks up a letter each time to make it to final
$DESTINATION$
Starting from a cell containing right D, ride the Knight picking up each successive letter on each hop to complete full journey.
You can get lost if you don’t take the right path.
Document the journey in chess notation
For example...A1, C2.......so on
In text form:
1 2 3 4 5 6 7 8
A D S I O E S O D
B E A N T I T N E
C T E O D O S I N
D I D N I T T D S
E S S D S D N S A
F E E I N E T E E
G N T E E A I N E
H D O N S I D I O
word chess word-ladder
edited 6 hours ago
osdavison
548111
asked 8 hours ago
UvcUvc
1,800325
$endgroup$
add a comment |
$begingroup$
As this Literary Knight (only chess move allowed) hops along, picks up a letter each time to make it to final
$DESTINATION$
Starting from a cell containing right D, ride the Knight picking up each successive letter on each hop to complete full journey.
You can get lost if you don’t take the right path.
Document the journey in chess notation
For example...A1, C2.......so on
In text form:
1 2 3 4 5 6 7 8
A D S I O E S O D
B E A N T I T N E
C T E O D O S I N
D I D N I T T D S
E S S D S D N S A
F E E I N E T E E
G N T E E A I N E
H D O N S I D I O
word chess word-ladder
edited 6 hours ago
osdavison
548111
asked 8 hours ago
UvcUvc
1,800325
$endgroup$
$begingroup$
Can the knight be placed at the same place more than 1 time ?
$endgroup$
– Ak19
8 hours ago
$begingroup$
As Knight journeys along, successive letters have to correspond to the exact order of letters in “DESTINATION”...otherwise it is on the wrong path..has to try another path.
$endgroup$
– Uvc
8 hours ago
add a comment |
$begingroup$
As this Literary Knight (only chess move allowed) hops along, picks up a letter each time to make it to final
$DESTINATION$
Starting from a cell containing right D, ride the Knight picking up each successive letter on each hop to complete full journey.
You can get lost if you don’t take the right path.
Document the journey in chess notation
For example...A1, C2.......so on
In text form:
1 2 3 4 5 6 7 8
A D S I O E S O D
B E A N T I T N E
C T E O D O S I N
D I D N I T T D S
E S S D S D N S A
F E E I N E T E E
G N T E E A I N E
H D O N S I D I O
word chess word-ladder
edited 6 hours ago
osdavison
548111
asked 8 hours ago
UvcUvc
1,800325
$endgroup$
As this Literary Knight (only chess move allowed) hops along, picks up a letter each time to make it to final
$DESTINATION$
Starting from a cell containing right D, ride the Knight picking up each successive letter on each hop to complete full journey.
You can get lost if you don’t take the right path.
Document the journey in chess notation
For example...A1, C2.......so on
In text form:
1 2 3 4 5 6 7 8
A D S I O E S O D
B E A N T I T N E
C T E O D O S I N
D I D N I T T D S
E S S D S D N S A
F E E I N E T E E
G N T E E A I N E
H D O N S I D I O
word chess word-ladder
word chess word-ladder
edited 6 hours ago
osdavison
548111
asked 8 hours ago
UvcUvc
1,800325
edited 6 hours ago
osdavison
548111
asked 8 hours ago
UvcUvc
1,800325
edited 6 hours ago
osdavison
548111
edited 6 hours ago
osdavison
548111
edited 6 hours ago
osdavison
548111
548111
asked 8 hours ago
UvcUvc
1,800325
asked 8 hours ago
UvcUvc
1,800325
asked 8 hours ago
UvcUvc
1,800325
1,800325
$begingroup$
Can the knight be placed at the same place more than 1 time ?
$endgroup$
– Ak19
8 hours ago
$begingroup$
As Knight journeys along, successive letters have to correspond to the exact order of letters in “DESTINATION”...otherwise it is on the wrong path..has to try another path.
$endgroup$
– Uvc
8 hours ago
add a comment |
$begingroup$
Can the knight be placed at the same place more than 1 time ?
$endgroup$
– Ak19
8 hours ago
$begingroup$
As Knight journeys along, successive letters have to correspond to the exact order of letters in “DESTINATION”...otherwise it is on the wrong path..has to try another path.
$endgroup$
– Uvc
8 hours ago
$begingroup$
Can the knight be placed at the same place more than 1 time ?
$endgroup$
– Ak19
8 hours ago
$begingroup$
Can the knight be placed at the same place more than 1 time ?
$endgroup$
– Ak19
8 hours ago
$begingroup$
As Knight journeys along, successive letters have to correspond to the exact order of letters in “DESTINATION”...otherwise it is on the wrong path..has to try another path.
$endgroup$
– Uvc
8 hours ago
$begingroup$
As Knight journeys along, successive letters have to correspond to the exact order of letters in “DESTINATION”...otherwise it is on the wrong path..has to try another path.
$endgroup$
– Uvc
8 hours ago
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
The only O connected to both an I and an N is in square A7. Working backwards,
the correct path is
H1, F2, E4, F6, H5, G7, E8, D6, B5, A7, C8.
Image:
answered 8 hours ago
scatterscatter
2934
New contributor
scatter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
sorry, ninja'd you by 2 mins 45 seconds... good game! :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
This is the answer, here you go :)
Method:
Start from left corner D. Try every path possible till I reach a dead end. If all possibilities fail, go to next D. Saw some other users trying to backtrack and finding pairs and relations. That was an effective search method, but perhaps finding the relations took more time than an exhaustive search in this small case?
answered 8 hours ago
Omega KryptonOmega Krypton
7,90821161
$endgroup$
$begingroup$
Great..how was it done
$endgroup$
– Uvc
8 hours ago
$begingroup$
@Uvc added explanation. btw, i recommend you awarding the check later so as to grab more puzzlers' attention to your hard work :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
Sure....I will wait till at least tomorrow .
$endgroup$
– Uvc
8 hours ago
$begingroup$
my method was rot13(gb tb onpxjneqf. gurer jrer zhpu srjre snyfr genvyf gung jnl). but on the other hand, I still wasn't fast enough!
$endgroup$
– SteveV
8 hours ago
$begingroup$
@SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
I was not the first, but my answer is
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
Reasoning: A7 must be the O used because it is the only O that leads from an I to a N. I then worked backwards from there, along auniquepath.
Edit: I later spotted two solutions:
The first E can be either F2 or G3, so the two solutions are
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
H1 G3 E4 F6 H5 G7 E8 D6 B5 A7 C8
P.S. I arrived at my answer independently.
answered 8 hours ago
Weather VaneWeather Vane
3,9971119
$endgroup$
$begingroup$
@Uvc were you expecting two paths to be found?
$endgroup$
– Weather Vane
7 hours ago
$begingroup$
No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
$endgroup$
– Uvc
6 hours ago
add a comment |
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%2f85096%2flead-the-way-to-this-literary-knight-to-its-final-destination%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$
The only O connected to both an I and an N is in square A7. Working backwards,
the correct path is
H1, F2, E4, F6, H5, G7, E8, D6, B5, A7, C8.
Image:
answered 8 hours ago
scatterscatter
2934
New contributor
scatter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
sorry, ninja'd you by 2 mins 45 seconds... good game! :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
The only O connected to both an I and an N is in square A7. Working backwards,
the correct path is
H1, F2, E4, F6, H5, G7, E8, D6, B5, A7, C8.
Image:
answered 8 hours ago
scatterscatter
2934
New contributor
scatter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
sorry, ninja'd you by 2 mins 45 seconds... good game! :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
The only O connected to both an I and an N is in square A7. Working backwards,
the correct path is
H1, F2, E4, F6, H5, G7, E8, D6, B5, A7, C8.
Image:
answered 8 hours ago
scatterscatter
2934
New contributor
scatter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
The only O connected to both an I and an N is in square A7. Working backwards,
the correct path is
H1, F2, E4, F6, H5, G7, E8, D6, B5, A7, C8.
Image:
answered 8 hours ago
scatterscatter
2934
New contributor
scatter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 8 hours ago
scatterscatter
2934
New contributor
scatter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered 8 hours ago
scatterscatter
2934
answered 8 hours ago
scatterscatter
2934
2934
New contributor
scatter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
scatter is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
sorry, ninja'd you by 2 mins 45 seconds... good game! :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
sorry, ninja'd you by 2 mins 45 seconds... good game! :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
sorry, ninja'd you by 2 mins 45 seconds... good game! :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
sorry, ninja'd you by 2 mins 45 seconds... good game! :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
This is the answer, here you go :)
Method:
Start from left corner D. Try every path possible till I reach a dead end. If all possibilities fail, go to next D. Saw some other users trying to backtrack and finding pairs and relations. That was an effective search method, but perhaps finding the relations took more time than an exhaustive search in this small case?
answered 8 hours ago
Omega KryptonOmega Krypton
7,90821161
$endgroup$
$begingroup$
Great..how was it done
$endgroup$
– Uvc
8 hours ago
$begingroup$
@Uvc added explanation. btw, i recommend you awarding the check later so as to grab more puzzlers' attention to your hard work :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
Sure....I will wait till at least tomorrow .
$endgroup$
– Uvc
8 hours ago
$begingroup$
my method was rot13(gb tb onpxjneqf. gurer jrer zhpu srjre snyfr genvyf gung jnl). but on the other hand, I still wasn't fast enough!
$endgroup$
– SteveV
8 hours ago
$begingroup$
@SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
This is the answer, here you go :)
Method:
Start from left corner D. Try every path possible till I reach a dead end. If all possibilities fail, go to next D. Saw some other users trying to backtrack and finding pairs and relations. That was an effective search method, but perhaps finding the relations took more time than an exhaustive search in this small case?
answered 8 hours ago
Omega KryptonOmega Krypton
7,90821161
$endgroup$
$begingroup$
Great..how was it done
$endgroup$
– Uvc
8 hours ago
$begingroup$
@Uvc added explanation. btw, i recommend you awarding the check later so as to grab more puzzlers' attention to your hard work :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
Sure....I will wait till at least tomorrow .
$endgroup$
– Uvc
8 hours ago
$begingroup$
my method was rot13(gb tb onpxjneqf. gurer jrer zhpu srjre snyfr genvyf gung jnl). but on the other hand, I still wasn't fast enough!
$endgroup$
– SteveV
8 hours ago
$begingroup$
@SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
This is the answer, here you go :)
Method:
Start from left corner D. Try every path possible till I reach a dead end. If all possibilities fail, go to next D. Saw some other users trying to backtrack and finding pairs and relations. That was an effective search method, but perhaps finding the relations took more time than an exhaustive search in this small case?
answered 8 hours ago
Omega KryptonOmega Krypton
7,90821161
$endgroup$
This is the answer, here you go :)
Method:
Start from left corner D. Try every path possible till I reach a dead end. If all possibilities fail, go to next D. Saw some other users trying to backtrack and finding pairs and relations. That was an effective search method, but perhaps finding the relations took more time than an exhaustive search in this small case?
answered 8 hours ago
Omega KryptonOmega Krypton
7,90821161
edited 8 hours ago
answered 8 hours ago
Omega KryptonOmega Krypton
7,90821161
answered 8 hours ago
Omega KryptonOmega Krypton
7,90821161
answered 8 hours ago
Omega KryptonOmega Krypton
7,90821161
7,90821161
$begingroup$
Great..how was it done
$endgroup$
– Uvc
8 hours ago
$begingroup$
@Uvc added explanation. btw, i recommend you awarding the check later so as to grab more puzzlers' attention to your hard work :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
Sure....I will wait till at least tomorrow .
$endgroup$
– Uvc
8 hours ago
$begingroup$
my method was rot13(gb tb onpxjneqf. gurer jrer zhpu srjre snyfr genvyf gung jnl). but on the other hand, I still wasn't fast enough!
$endgroup$
– SteveV
8 hours ago
$begingroup$
@SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
Great..how was it done
$endgroup$
– Uvc
8 hours ago
$begingroup$
@Uvc added explanation. btw, i recommend you awarding the check later so as to grab more puzzlers' attention to your hard work :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
Sure....I will wait till at least tomorrow .
$endgroup$
– Uvc
8 hours ago
$begingroup$
my method was rot13(gb tb onpxjneqf. gurer jrer zhpu srjre snyfr genvyf gung jnl). but on the other hand, I still wasn't fast enough!
$endgroup$
– SteveV
8 hours ago
$begingroup$
@SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
Great..how was it done
$endgroup$
– Uvc
8 hours ago
$begingroup$
Great..how was it done
$endgroup$
– Uvc
8 hours ago
$begingroup$
@Uvc added explanation. btw, i recommend you awarding the check later so as to grab more puzzlers' attention to your hard work :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
@Uvc added explanation. btw, i recommend you awarding the check later so as to grab more puzzlers' attention to your hard work :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
Sure....I will wait till at least tomorrow .
$endgroup$
– Uvc
8 hours ago
$begingroup$
Sure....I will wait till at least tomorrow .
$endgroup$
– Uvc
8 hours ago
$begingroup$
my method was rot13(gb tb onpxjneqf. gurer jrer zhpu srjre snyfr genvyf gung jnl). but on the other hand, I still wasn't fast enough!
$endgroup$
– SteveV
8 hours ago
$begingroup$
my method was rot13(gb tb onpxjneqf. gurer jrer zhpu srjre snyfr genvyf gung jnl). but on the other hand, I still wasn't fast enough!
$endgroup$
– SteveV
8 hours ago
$begingroup$
@SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
$endgroup$
– Omega Krypton
8 hours ago
$begingroup$
@SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
$endgroup$
– Omega Krypton
8 hours ago
add a comment |
$begingroup$
I was not the first, but my answer is
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
Reasoning: A7 must be the O used because it is the only O that leads from an I to a N. I then worked backwards from there, along auniquepath.
Edit: I later spotted two solutions:
The first E can be either F2 or G3, so the two solutions are
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
H1 G3 E4 F6 H5 G7 E8 D6 B5 A7 C8
P.S. I arrived at my answer independently.
answered 8 hours ago
Weather VaneWeather Vane
3,9971119
$endgroup$
$begingroup$
@Uvc were you expecting two paths to be found?
$endgroup$
– Weather Vane
7 hours ago
$begingroup$
No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
$endgroup$
– Uvc
6 hours ago
add a comment |
$begingroup$
I was not the first, but my answer is
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
Reasoning: A7 must be the O used because it is the only O that leads from an I to a N. I then worked backwards from there, along auniquepath.
Edit: I later spotted two solutions:
The first E can be either F2 or G3, so the two solutions are
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
H1 G3 E4 F6 H5 G7 E8 D6 B5 A7 C8
P.S. I arrived at my answer independently.
answered 8 hours ago
Weather VaneWeather Vane
3,9971119
$endgroup$
$begingroup$
@Uvc were you expecting two paths to be found?
$endgroup$
– Weather Vane
7 hours ago
$begingroup$
No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
$endgroup$
– Uvc
6 hours ago
add a comment |
$begingroup$
I was not the first, but my answer is
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
Reasoning: A7 must be the O used because it is the only O that leads from an I to a N. I then worked backwards from there, along auniquepath.
Edit: I later spotted two solutions:
The first E can be either F2 or G3, so the two solutions are
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
H1 G3 E4 F6 H5 G7 E8 D6 B5 A7 C8
P.S. I arrived at my answer independently.
answered 8 hours ago
Weather VaneWeather Vane
3,9971119
$endgroup$
I was not the first, but my answer is
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
Reasoning: A7 must be the O used because it is the only O that leads from an I to a N. I then worked backwards from there, along auniquepath.
Edit: I later spotted two solutions:
The first E can be either F2 or G3, so the two solutions are
D E S T I N A T I O N
H1 F2 E4 F6 H5 G7 E8 D6 B5 A7 C8
H1 G3 E4 F6 H5 G7 E8 D6 B5 A7 C8
P.S. I arrived at my answer independently.
answered 8 hours ago
Weather VaneWeather Vane
3,9971119
edited 6 hours ago
answered 8 hours ago
Weather VaneWeather Vane
3,9971119
answered 8 hours ago
Weather VaneWeather Vane
3,9971119
answered 8 hours ago
Weather VaneWeather Vane
3,9971119
3,9971119
$begingroup$
@Uvc were you expecting two paths to be found?
$endgroup$
– Weather Vane
7 hours ago
$begingroup$
No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
$endgroup$
– Uvc
6 hours ago
add a comment |
$begingroup$
@Uvc were you expecting two paths to be found?
$endgroup$
– Weather Vane
7 hours ago
$begingroup$
No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
$endgroup$
– Uvc
6 hours ago
$begingroup$
@Uvc were you expecting two paths to be found?
$endgroup$
– Weather Vane
7 hours ago
$begingroup$
@Uvc were you expecting two paths to be found?
$endgroup$
– Weather Vane
7 hours ago
$begingroup$
No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
$endgroup$
– Uvc
6 hours ago
$begingroup$
No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
$endgroup$
– Uvc
6 hours 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%2f85096%2flead-the-way-to-this-literary-knight-to-its-final-destination%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$
Can the knight be placed at the same place more than 1 time ?
$endgroup$
– Ak19
8 hours ago
$begingroup$
As Knight journeys along, successive letters have to correspond to the exact order of letters in “DESTINATION”...otherwise it is on the wrong path..has to try another path.
$endgroup$
– Uvc
8 hours ago