TurkZeka 2006/2 Puzzle Competition
 
Puzzle No : 3
(? Points)

 

Multiple Optimization

You will draw a way starting from any cell in the diagram by moving right, left, up and down but not diagonally.

You will start by 1-unit and in every step you will increase it by 1 unit.
After 5-unit you will continue by 1-unit again. (eg: 1,2,3,4,5 - 1,2,3,4,5 - 1,2, ...)

You can pass by only one black cell at max and the way you draw can intersect itself only once at max. (See the example please)

You can not use a cell twice (except the intersection cell if used)

The objective is to maximize the length of the way.

Example:



The answering method will include 2 levels:

- The first level will be done through the answer form in the website as usual.

Let's call the steps 1 to 5 as "set". (15 cells = 1+2+3+4+5)

4 sets and 2 steps are performed in the example.
So the way is 63 units as total. 1 black cell is passed by and the way intersected itself once.

For your answer, first put the number of cells you passed by
and then if there is no intersection put "1" otherwise put "0"
and finally if you passed by a black cell put "0" otherwise put "1".

The answer for the example would be 6300.

The first factor for the points will be the length of the way,
then not to intersect itself and finally not to pass by any black cell.
In other words, the objective is to maximize the result for the answer.

Only the top 5 best solvers will receive points. (The points are: 135-120-105-90-75)

Also, daily bonus and first 3-hour bonus will be received only if the answer is in top 5.

- The second level will be to e-mail the solution to turkzeka@turkzeka.com or yilmazekici@gmail.com.
Provide your user name, password and the answer you submit through the website (6300 for the example)
and your solution in a general format such as image, Excel, Word, etc.

The e-mails without any required information above will not be accepted!

Please note that you will have only one chance for your answer!