Jump to content


Welcome to BrainDen.com - Brain Teasers Forum

Welcome to BrainDen.com - Brain Teasers Forum. Like most online communities you must register to post in our community, but don't worry this is a simple free process. To be a part of BrainDen Forums you may create a new account or sign in if you already have an account.
As a member you could start new topics, reply to others, subscribe to topics/forums to get automatic updates, get your own profile and make new friends.

Of course, you can also enjoy our collection of amazing optical illusions and cool math games.

If you like our site, you may support us by simply clicking Google "+1" or Facebook "Like" buttons at the top.
If you have a website, we would appreciate a little link to BrainDen.

Thanks and enjoy the Den :-)
Guest Message by DevFuse
 

Photo
- - - - -

Driving man's delight - 2 a harder puzzle


Best Answer superprismatic, 16 May 2013 - 04:14 PM

Spoiler for I get

Go to the full post


  • Please log in to reply
6 replies to this topic

#1 bonanova

bonanova

    bonanova

  • Moderator
  • PipPipPipPip
  • 5530 posts
  • Gender:Male
  • Location:New York

Posted 15 May 2013 - 08:16 PM

I owe it to the Den to post at least one of these without error.
Possibly this one does that.

Give the longest route (sequence of city numbers) that visits all the cities
(a) not returning to starting city (sum of 7 distances - starting point matters)
(b) returning to starting city (sum of 8 distances - starting point does not matter)

This puzzle has more choices than the first one.

Cities lie clockwise on the perimeter of a 6x6 square:


6--O------O-------+--------O
   |3     4               5|
   |                       |
   |                       |
4--+                       +
   |                       |
   |                       |
   |                       |
2--O2                     6O
   |                       |
   |                       |
   |1              8      7|
0--O-------+-------O-------O
   |       |       |       |
   0       2       4       6



+----+---+---+
|City| x | y |   Distances:
+----+---+---+   8.485  1-5 3-7
| 1  | 0 | 0 |   7.211  2-5 3-6 3-8 4-7
| 2  | 0 | 2 |   6.325  1-4 1-6 2-7 4-8 5-8
| 3  | 0 | 6 |   6.000  1-3 1-7 2-6 3-5 5-7
| 4  | 2 | 6 |   5.656  4-6
| 5  | 6 | 6 |   4.472  2-4 2-8
| 6  | 6 | 2 |   4.000  1-8 2-3 4-5 5-6
| 7  | 6 | 0 |   2.828  6-8
| 8  | 4 | 0 |   2.000  1-2 3-4 6-7 7-8
+----+---+---+


  • 0
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell

#2 BobbyGo

BobbyGo

    Advanced Member

  • Members
  • PipPipPip
  • 128 posts
  • Gender:Male

Posted 15 May 2013 - 09:23 PM

Spoiler for First Guess

  • -1

#3 bonanova

bonanova

    bonanova

  • Moderator
  • PipPipPipPip
  • 5530 posts
  • Gender:Male
  • Location:New York

Posted 15 May 2013 - 09:37 PM

Spoiler for First Guess

 

Spoiler for Good start!


  • 0
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell

#4 tylerbrooksmusic

tylerbrooksmusic

    Newbie

  • Members
  • Pip
  • 6 posts
  • Gender:Male

Posted 16 May 2013 - 03:50 PM

Spoiler for closed answer
closed

 


  • 0

#5 superprismatic

superprismatic

    Not just Prismatic

  • Moderator
  • PipPipPipPip
  • 1281 posts
  • Gender:Male

Posted 16 May 2013 - 04:14 PM   Best Answer

Spoiler for I get


  • 1

#6 tylerbrooksmusic

tylerbrooksmusic

    Newbie

  • Members
  • Pip
  • 6 posts
  • Gender:Male

Posted 16 May 2013 - 07:44 PM

Here's another question to tag onto the end . . . How many correct answers are there for A and B?


Edited by tylerbrooksmusic, 16 May 2013 - 07:49 PM.

  • 0

#7 bonanova

bonanova

    bonanova

  • Moderator
  • PipPipPipPip
  • 5530 posts
  • Gender:Male
  • Location:New York

Posted 16 May 2013 - 08:27 PM

SP is first with both solutions.

Tylerbrooksmusic was first with the closed course solution

 

Good job both.

 

Spoiler for in response to tyler question


  • 0
The greatest challenge to any thinker is stating the problem in a way that will allow a solution.
- Bertrand Russell




0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users