[wolfgang]

Draw a circle ,devide it into 12 points,give each point a number (1 to 12) according to your own stratigy.

A robot will fly around this circle in one direction(clockwise ),when he stops on a given point he will dig a hole there!...so the robot will do these steps repeatedly:

1-read the number standing on.

2-dig a hole.

3-fly so many steps according to number from step 1.

4- go to 1

the mission will fail if the robot falls into a hole..

Start the mission by placing the robot on any point of your choice,,,press...GO..!!and the robot will do his job perfectly as written above.

Try to make a strategy which will lead to dig maximal number of holes.

The number standing on will not be counted....for example:

if your numbers where, 8..2..12..5..3.....etc.,

if you decided to put the robot on number 2 as a start point...so

1-read..(2)

2-dig a hole in this place.

3-fly to (5).

4-go to 1

1-read (5)....and so on.....

Edited August 31, 2011 by wolfgang

[superprismatic]

The robot starts on the 1 and the clockwise sequence of

1,2,3,4,5,6,12,7,8,9,10,11 will make the robot dig 12 holes.

[Guest]

superprismatic, did you guess? I got 11 holes on my first try, but then kept trying to logic my way out. Haven't had luck, but I'm interested if there's a way to narrow the choices logically. I keep going back to the odd-even rules.

[kappak1020]

3, 8, 11, 4, 1, 5, 12, 9, 6, 2, 10, 7.

I wrote it out and used trail and error. I think it works. the robot starts on three and will dig twelve holes

Edited August 31, 2011 by kappak1020

[superprismatic]

superprismatic, did you guess? I got 11 holes on my first try, but then kept trying to logic my way out. Haven't had luck, but I'm interested if there's a way to narrow the choices logically. I keep going back to the odd-even rules.

I wrote a little program to find all which dig 12 holes. There are 3856 of them. I picked the one that looked simplest to me.

[Guest]

Interesting to note that in all solutions the label 12 is in the 7th position, no solutions have 6 in the 1st position and no solutions have 1 in the 12th position.....

[wolfgang]

3, 8, 11, 4, 1, 5, 12, 9, 6, 2, 10, 7.

I wrote it out and used trail and error. I think it works. the robot starts on three and will dig twelve holes

Super!!!!

very good!!

[Guest]

12 1 2 3 4 5 6 7 8 9 10 11 - (For a normal clock )

11 9 7 5 3 1 12 10 8 6 4 2 - (The solution) - Maximum 11