Maybe Smallest Mouse

[tog]

Hi folks,

I finally got my solution down to 24 instructions. It's actually a hack that will break in the following situations:

- mem[1] is maximum and mem[0]==mem[2] (e.g., 2,1000,2,3,4,...)
- if there is a zero in the array (so I do not count up to 20 but stop at the first zero)

Nevertheless it passes all tests
So is there a "correct" solution to this one?

[adum]

wow, nice solution! very cool.

as a special prize, i have made another puzzle in the series =)

[the_impaler]

Yeh, my solution breaks too when mem[2] or mem[1] has max, but it does not break on zeros.
Oh, well. this bothered me way too much - could not do any other HVM problems.

[ogi]

Oh. I'm not soo bad ! My solution only sucks if mem[1] is max.
seriously: DOES there exist any CORRECT solution with 24 or less??

[Hippo]

Oh. I'm not soo bad ! My solution only sucks if mem[1] is max.
seriously: DOES there exist any CORRECT solution with 24 or less??

Yep, just te last step took me 2 years ... as there is just a probabilistic solution with rather small probability of success.

(If I remember well )

[AMindForeverVoyaging]

Yep, just te last step took me 2 years ... as there is just a probabilistic solution with rather small probability of success.

Well then it is not a correct solution. Correct means: You give the answer, it is accepted, finished.

[Hippo]

Yep, just te last step took me 2 years ... as there is just a probabilistic solution with rather small probability of success.

Well then it is not a correct solution. Correct means: You give the answer, it is accepted, finished.

Well then it is not a correct puzzle

[AMindForeverVoyaging]

Well then it is not a correct puzzle

Well, it isn't when you think about it.

[ogi]

Hey (as stated by some one else before):
This is a HACKERs challenge. Not a mathematicians one.
So be smart an hack the rules!