Bsrgvty

Dodging a Deathbeam travelling at speed of light

Is putting money in a 401(k) plan risky?

Would the US government of the 1960’s be able to feasibly recreate a modern laptop?

Comparison of C-Cl bond length in CH3Cl and CF3Cl

In what way were Renaissance battles like chess matches?

How to persuade players not to cheat?

What is self hosted version control system?

Removing characters from end of string from character to character

What does "T.O." mean?

How can you castle legally in Chess960 when the castling rook is on the king's destination square?

How do I complete the "A Brilliant Smile" triumph?

Was Tim's reaction to the electric fence realistic?

Is it possible to be admitted to CS PhD programs (in US) with scholarship at age 18?

Is it worth delving deep outside my field to revise a paper?

Can I say: “The train departs at 16 past every hour“?

Do any Star Trek characters play rock band instruments?

How do I prevent against authentication side-channel attacks?

Employer reneged on negotiated clauses that weren't part of agreed contract, citing budget cuts - what can I do?

What is the speed of "electricity"?

Using Arcane Eye Under Water

What is the type of English used in the King James Bible called?

Rising pizza dough in the fridge after punching it?

How exactly do you avoid fooling yourself?

Is this bible in Koine Greek?

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 Maze“Murder!”, said the knightThe Not So Knights ChallengePrime Knight travels through Prime CountryMagical Knight Moves with Effortless Ease in his Magical Kingdom

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty
margin-bottom:0;

.everyonelovesstackoverflowposition:absolute;height:1px;width:1px;opacity:0;top:0;left:0;pointer-events:none;

8

2

$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

share|improve this question

edited Jun 14 at 18:37

user44966

asked Jun 14 at 17:00

UvcUvc

2,82466 silver badges3131 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Can the knight be placed at the same place more than 1 time ?
  $endgroup$
  – Ak19
  Jun 14 at 17:04
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $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
  Jun 14 at 17:07
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Why "literary"?
  $endgroup$
  – Rand al'Thor
  Jun 15 at 11:33
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  I just wanted to bring out that it is more alphabets than Digits..Prime Knight is coming in the next one which will be bit more harder
  $endgroup$
  – Uvc
  Jun 15 at 11:40
  

  
  
  
  

add a comment
 | 

8

2

$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

share|improve this question

edited Jun 14 at 18:37

user44966

asked Jun 14 at 17:00

UvcUvc

2,82466 silver badges3131 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Can the knight be placed at the same place more than 1 time ?
  $endgroup$
  – Ak19
  Jun 14 at 17:04
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $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
  Jun 14 at 17:07
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Why "literary"?
  $endgroup$
  – Rand al'Thor
  Jun 15 at 11:33
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  I just wanted to bring out that it is more alphabets than Digits..Prime Knight is coming in the next one which will be bit more harder
  $endgroup$
  – Uvc
  Jun 15 at 11:40
  

  
  
  
  

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

share|improve this question

edited Jun 14 at 18:37

user44966

asked Jun 14 at 17:00

UvcUvc

2,82466 silver badges3131 bronze badges

$endgroup$

 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

share|improve this question

edited Jun 14 at 18:37

user44966

asked Jun 14 at 17:00

UvcUvc

2,82466 silver badges3131 bronze badges

share|improve this question

edited Jun 14 at 18:37

user44966

asked Jun 14 at 17:00

UvcUvc

2,82466 silver badges3131 bronze badges

asked Jun 14 at 17:00

UvcUvc

2,82466 silver badges3131 bronze badges

asked Jun 14 at 17:00

UvcUvc

2,82466 silver badges3131 bronze badges

3 Answers
3

active

oldest

votes

6

$begingroup$

First to answer :)

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?

share|improve this answer

edited Jun 18 at 9:08

answered Jun 14 at 17:09

Omega KryptonOmega Krypton

15.4k22 gold badges1818 silver badges111111 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Great..how was it done
  $endgroup$
  – Uvc
  Jun 14 at 17:10
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $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
  Jun 14 at 17:11
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Sure....I will wait till at least tomorrow .
  $endgroup$
  – Uvc
  Jun 14 at 17:12
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $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
  Jun 14 at 17:13
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
  $endgroup$
  – Omega Krypton
  Jun 14 at 17:14
  

  
  
  
  

add a comment
 | 

7

$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 a unique path.

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.

share|improve this answer

edited Jun 14 at 18:43

answered Jun 14 at 17:16

Weather VaneWeather Vane

6,68011 gold badge44 silver badges2727 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @Uvc were you expecting two paths to be found?
  $endgroup$
  – Weather Vane
  Jun 14 at 18:05
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
  $endgroup$
  – Uvc
  Jun 14 at 19:10
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @Uvc I find it amazing that the check mark was given to the person who only found one solution, and who did not post the answer in the required chess notation.
  $endgroup$
  – Weather Vane
  Jun 15 at 18:50
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Similar problems I have faced before...after consulting with editors, I have to be fair...if I didn’t ask for full details and didn’t ask for 2nd route, I have to go with one who answered first...regarding chess notation, once line is drawn, all possible move connections, that is good enough..I am as impartial Ivan be sticking to the spirit of the puzzle...I applaud you for finding the alternate route
  $endgroup$
  – Uvc
  Jun 15 at 19:54
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Ah I see, but the check mark can go to the best answer, not necessarily the one who rushes to submit a poor solution first.
  $endgroup$
  – Weather Vane
  Jun 15 at 19:56
  

  
  
  
  

 | 
show 5 more comments

6

$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:

share|improve this answer

answered Jun 14 at 17:12

scatterscatter

44511 silver badge99 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  sorry, ninja'd you by 2 mins 45 seconds... good game! :)
  $endgroup$
  – Omega Krypton
  Jun 14 at 17:12
  
  

  
  
  
  

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/4.0/"u003ecc by-sa 4.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
);



);

draft saved

draft discarded

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

Name

Email

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

Name

Email

Required, but never shown

6

$begingroup$

First to answer :)

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?

share|improve this answer

edited Jun 18 at 9:08

answered Jun 14 at 17:09

Omega KryptonOmega Krypton

15.4k22 gold badges1818 silver badges111111 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Great..how was it done
  $endgroup$
  – Uvc
  Jun 14 at 17:10
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $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
  Jun 14 at 17:11
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Sure....I will wait till at least tomorrow .
  $endgroup$
  – Uvc
  Jun 14 at 17:12
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $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
  Jun 14 at 17:13
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
  $endgroup$
  – Omega Krypton
  Jun 14 at 17:14
  

  
  
  
  

add a comment
 | 

6

$begingroup$

First to answer :)

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?

share|improve this answer

edited Jun 18 at 9:08

answered Jun 14 at 17:09

Omega KryptonOmega Krypton

15.4k22 gold badges1818 silver badges111111 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Great..how was it done
  $endgroup$
  – Uvc
  Jun 14 at 17:10
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $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
  Jun 14 at 17:11
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Sure....I will wait till at least tomorrow .
  $endgroup$
  – Uvc
  Jun 14 at 17:12
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $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
  Jun 14 at 17:13
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @SteveV my method was: always keep the recently active tab open. check every new question. solve them if i can. :)
  $endgroup$
  – Omega Krypton
  Jun 14 at 17:14
  

  
  
  
  

add a comment
 | 

$begingroup$

First to answer :)

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?

share|improve this answer

edited Jun 18 at 9:08

answered Jun 14 at 17:09

Omega KryptonOmega Krypton

15.4k22 gold badges1818 silver badges111111 bronze badges

$endgroup$

share|improve this answer

edited Jun 18 at 9:08

answered Jun 14 at 17:09

Omega KryptonOmega Krypton

15.4k22 gold badges1818 silver badges111111 bronze badges

answered Jun 14 at 17:09

Omega KryptonOmega Krypton

15.4k22 gold badges1818 silver badges111111 bronze badges

answered Jun 14 at 17:09

Omega KryptonOmega Krypton

15.4k22 gold badges1818 silver badges111111 bronze badges

7

$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 a unique path.

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.

share|improve this answer

edited Jun 14 at 18:43

answered Jun 14 at 17:16

Weather VaneWeather Vane

6,68011 gold badge44 silver badges2727 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @Uvc were you expecting two paths to be found?
  $endgroup$
  – Weather Vane
  Jun 14 at 18:05
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
  $endgroup$
  – Uvc
  Jun 14 at 19:10
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @Uvc I find it amazing that the check mark was given to the person who only found one solution, and who did not post the answer in the required chess notation.
  $endgroup$
  – Weather Vane
  Jun 15 at 18:50
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Similar problems I have faced before...after consulting with editors, I have to be fair...if I didn’t ask for full details and didn’t ask for 2nd route, I have to go with one who answered first...regarding chess notation, once line is drawn, all possible move connections, that is good enough..I am as impartial Ivan be sticking to the spirit of the puzzle...I applaud you for finding the alternate route
  $endgroup$
  – Uvc
  Jun 15 at 19:54
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Ah I see, but the check mark can go to the best answer, not necessarily the one who rushes to submit a poor solution first.
  $endgroup$
  – Weather Vane
  Jun 15 at 19:56
  

  
  
  
  

 | 
show 5 more comments

7

$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 a unique path.

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.

share|improve this answer

edited Jun 14 at 18:43

answered Jun 14 at 17:16

Weather VaneWeather Vane

6,68011 gold badge44 silver badges2727 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @Uvc were you expecting two paths to be found?
  $endgroup$
  – Weather Vane
  Jun 14 at 18:05
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  No..when I constructed it, I missed that..by blocking with another letter, I could have made it fully unique.
  $endgroup$
  – Uvc
  Jun 14 at 19:10
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @Uvc I find it amazing that the check mark was given to the person who only found one solution, and who did not post the answer in the required chess notation.
  $endgroup$
  – Weather Vane
  Jun 15 at 18:50
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Similar problems I have faced before...after consulting with editors, I have to be fair...if I didn’t ask for full details and didn’t ask for 2nd route, I have to go with one who answered first...regarding chess notation, once line is drawn, all possible move connections, that is good enough..I am as impartial Ivan be sticking to the spirit of the puzzle...I applaud you for finding the alternate route
  $endgroup$
  – Uvc
  Jun 15 at 19:54
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Ah I see, but the check mark can go to the best answer, not necessarily the one who rushes to submit a poor solution first.
  $endgroup$
  – Weather Vane
  Jun 15 at 19:56
  

  
  
  
  

 | 
show 5 more comments

$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 a unique path.

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.

share|improve this answer

edited Jun 14 at 18:43

answered Jun 14 at 17:16

Weather VaneWeather Vane

6,68011 gold badge44 silver badges2727 bronze badges

$endgroup$

share|improve this answer

edited Jun 14 at 18:43

answered Jun 14 at 17:16

Weather VaneWeather Vane

6,68011 gold badge44 silver badges2727 bronze badges

answered Jun 14 at 17:16

Weather VaneWeather Vane

6,68011 gold badge44 silver badges2727 bronze badges

answered Jun 14 at 17:16

Weather VaneWeather Vane

6,68011 gold badge44 silver badges2727 bronze badges

6

$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:

share|improve this answer

answered Jun 14 at 17:12

scatterscatter

44511 silver badge99 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  sorry, ninja'd you by 2 mins 45 seconds... good game! :)
  $endgroup$
  – Omega Krypton
  Jun 14 at 17:12
  
  

  
  
  
  

add a comment
 | 

6

$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:

share|improve this answer

answered Jun 14 at 17:12

scatterscatter

44511 silver badge99 bronze badges

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  sorry, ninja'd you by 2 mins 45 seconds... good game! :)
  $endgroup$
  – Omega Krypton
  Jun 14 at 17:12
  
  

  
  
  
  

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:

share|improve this answer

answered Jun 14 at 17:12

scatterscatter

44511 silver badge99 bronze badges

$endgroup$

share|improve this answer

answered Jun 14 at 17:12

scatterscatter

44511 silver badge99 bronze badges

answered Jun 14 at 17:12

scatterscatter

44511 silver badge99 bronze badges

answered Jun 14 at 17:12

scatterscatter

44511 silver badge99 bronze badges