LOST-Chall
http://lost-chall.wechall.net/forum/

S3PR#Nearest Neighbour
http://lost-chall.wechall.net/forum/viewtopic.php?f=13&t=151
Page 1 of 1
Author:  Nuke [ Mon Jun 16, 2008 9:59 pm ]
Post subject:  S3PR#Nearest Neighbour

Great one!!!! :lol:

i have take an hour or two.. because i'm lazy as a bear and was too tired to code... :roll:
so i have taken pen and paper and do the dirty work at hand...


GOOD one!! thx a lot Criple_ripper :D
Author:  criple_ripper [ Mon Jun 16, 2008 10:54 pm ]
Post subject: 

i'm glad you like it Nuke...thought a programming chall would be good...yes you can do it with pen and paper but it's easier to write a program and do it for you in 2 seconds...anyone who knows what it's about will write a program in 15 minutes...
Author:  Nuke [ Tue Jun 17, 2008 7:46 am ]
Post subject: 

I agreed, the coding a program is a better way to solve the challenge.

but as i said yesterday was reaaaallyyyy lazy... :lol: or i have just time to waste :wink:
Author:  paipai [ Tue Jun 17, 2008 4:02 pm ]
Post subject: 

could anyone explain what must to do here, i dont understand what is "to find out the best route visiting all the vertices/cities to ship the boxes."

thx :)
Author:  criple_ripper [ Tue Jun 17, 2008 4:42 pm ]
Post subject: 

hi paipai...you could start by viewing the source of the page and google one name you 'll find there :)then you'll know what to do...
Author:  Nuke [ Tue Jun 17, 2008 8:02 pm ]
Post subject: 

paipai wrote:could anyone explain what must to do here, i dont understand what is "to find out the best route visiting all the vertices/cities to ship the boxes."

thx :)


another starting point is the name of the challenge, that help a lot :wink:
Author:  Alice [ Sat Jun 21, 2008 9:33 pm ]
Post subject: 

I was a good little programmer and wrote a program to do this. The shortest path I get has length 144 (I hope this number is not much of a spoiler). In fact, I got 4 paths of that length -- two of them are a reversal of the other two -- but none of them work as the answer. Is there an even shorter path that my program somehow missed?
Author:  criple_ripper [ Sat Jun 21, 2008 9:44 pm ]
Post subject: 

hi alice...i think you missed something with your program...the right length is bigger and you get 2 possible of these CIRCLES with the same length...what programming language did you used?if you want send me your code and i'll take a look at it...

EDIT
just changed the weight of one edge...just to make the matrix symetrical... but it has nothing to do with the solution:)
Author:  Alice [ Mon Jun 23, 2008 3:31 pm ]
Post subject: 

I've redone it as a circle, but still didn't get the right answer, because the shortest path my program found is actually 7 shorter than the intended path. I will msg you with with more details.
Author:  criple_ripper [ Mon Jun 23, 2008 5:51 pm ]
Post subject: 

congrats Alice!!I sent you a pm to talk about it a bit more...for those who still don't know what to do...wikipedia can always help...
Author:  vasis [ Fri Mar 16, 2012 10:49 pm ]
Post subject:  Re: S3PR#Nearest Neighbour

What should the solution look like? Is it something like "5O7LI0PNU...", or I should add hyphens/commas/god knows what? And can i assume that "7" is the start and the end?
Author:  Bregi [ Sun Mar 18, 2012 6:34 pm ]
Post subject:  Re: S3PR#Nearest Neighbour

Yes vasis,
but it's not that big what you will have to enter, and it makes sense :)

Bregi
Author:  thefinder [ Fri Dec 15, 2017 6:23 pm ]
Post subject:  Re: S3PR#Nearest Neighbour

Hi, as there are some errors on this chall I add a comment:
At the end we come back to the starting point.
And also, switch 'I' and 'O' on the matrix file.=> It has been fixed!
Page 1 of 1 All times are UTC