THE ULTIMATE PUZZLE (I challenge YOU!)
Michael N Goldshteyn
Here is a puzzle for all you masachistic puzzle solvers out there!
THE OBJECT: You are given a city with 36 locations (a 6x6 grid). You can
start at any location and finish at any location. You can visit locations
more than once and it may at times help to do so! You must visit every location
. Every time you move from one location to the next, you must add the cost
of the trip which is clearly labeled between the two locations. The main
object is to visit every location at least once in the minimum cost. Here is
the map of the city with the cost from each location to the next adjoining one:
O-4-O-4-O-5-O-3-O-6-O
| | | | | |
5 1 2 8 4 5
| | | | | |
O-6-O-5-O-6-O-6-O-6-O
| | | | | |
1 9 1 7 4 2
| | | | | |
O-9-O-3-O-8-O-7-O-8-O
| | | | | |
5 7 8 6 6 9
| | | | | |
O-7-O-7-O-3-O-1-O-2-O
| | | | | |
9 7 9 2 5 7
| | | | | |
O-4-O-4-O-1-O-2-O-7-O
| | | | | |
3 2 7 1 1 1
| | | | | |
O-9-O-5-O-6-O-9-O-2-O
The letters 'O' represent the 36 locations that must be visited. In giving
solutions to this puzzle, please simply write a route. For the sake of
ease we will label the 36 locations in the following manner:
A B C D E F
G H I J K L
M N O P Q R
S T U V W X
Y Z 0 1 2 3
4 5 6 7 8 9
A simple (certainly not least cost route) is the following:
A->B->C->D->E->F->L->K->J->I->H->G->M->N->O->P->Q->R->X->W->V->U->T->S->Y->Z->
0->1->2->3->9->8->7->6->5->4
The cost of this trip is: 180
The best trip I have found so far has a total cost of:
143
I have written a computer program to attempt to solve this puzzle which
found a minimum route of only 148.
Can YOU do any better??? Reply responses!
Please remember that you can only go to an adjoining location from any location.
You must follow the roads!
GOOD LUCK! I will post my 143 solution if nobody beats it!
RING, DAVID WAYNE
>O-4-O-4-O-5-O-3-O-6-O
>5 1 2 8 4 5
>O-6-O-5-O-6-O-6-O-6-O
>1 9 1 7 4 2
>O-9-O-3-O-8-O-7-O-8-O
>5 7 8 6 6 9
>O-7-O-7-O-3-O-1-O-2-O
>9 7 9 2 5 7
>O-4-O-4-O-1-O-2-O-7-O
>3 2 7 1 1 1
>O-9-O-5-O-6-O-9-O-2-O
>A B C D E F
>G H I J K L
>M N O P Q R
>S T U V W X
>Y Z 0 1 2 3
>4 5 6 7 8 9
4YZ5601712893XWVUTSMGABHNOICDEKJPQRLF = 135
Dave Ring
dwr...@zeus.tamu.edu
Remco Bouckaert
--Remco--
Takayuki Nakao
re...@cs.ruu.nl (Remco Bouckaert) writes:
> 4yz5671012893xwvutnoijpqklrlfedcbhbagms = 134
How about this route ?
4yz5671012893xwvutsmgabhnoicdeflrlkqpj = 134
Its cost is same as the above, but its length is shorter.
--
Takayuki Nakao
Dept. of Information Science, Faculty of Science, Univ. of Tokyo
e-mail: na...@is.s.u-tokyo.ac.jp
David Arsenault
mcnei...@gmail.com
The reason for this note is to introduce myself to you, and to make you aware of a role we have to fill. Our client is a technology company that has been successfully applying their disciplined, process-driven investment trading strategies for 15 years. These strategies are based on statistical models developed using rigorous mathematical analysis. They are recruiting for a quantitative researcher (trader) to build algorithmic strategies used to detect anomalies in massive datasets, and manage PnL. Candidates will have a Bachelors Degree or higher (Physics, Computer Science, Electrical Engineering, Mathematics etc.), and a successful track-record in trading.
Would you like to learn more about this opportunity? Kindly let me know your thoughts.
Brian McNeill
bmcn...@alphaadvisorsllc.com
914-584-9471
FromTheRafters
[...]
> Michael, please contact me..........
>
> The reason for this note is to introduce myself to you, and to make you aware
> of a role we have to fill. Our client is a technology company that has been
> successfully applying their disciplined, process-driven investment trading
> strategies for 15 years. These strategies are based on statistical models
> developed using rigorous mathematical analysis. They are recruiting for a
> quantitative researcher (trader) to build algorithmic strategies used to
> detect anomalies in massive datasets, and manage PnL. Candidates will have a
> Bachelors Degree or higher (Physics, Computer Science, Electrical
> Engineering, Mathematics etc.), and a successful track-record in trading.
>
> Would you like to learn more about this opportunity? Kindly let me know your
> thoughts.
>
> Brian McNeill
> bmcn...@alphaadvisorsllc.com
> 914-584-9471
