Page 2 of 2
Posted: Tue Nov 18, 2008 10:53 am
by tog
adum wrote:good news: this can be solved in 23 instructions, i just realized (by looking at tog's very clever solution), so a brute force is a degree easier =)
Well, even better news: this can be solved in 21 instructions!
So may I suggest another challenge named "Smaller than the smallestest mouse"? Does this count as submission for "Create a Challenge"?
Posted: Tue Nov 18, 2008 6:55 pm
by adum
21! wow. yes, that will give you creation credit =)
Posted: Wed Nov 19, 2008 5:41 am
by Allosentient
This makes the hello world one look easy, mine was like 110 long.
Posted: Sun Nov 23, 2008 2:27 pm
by m!nus
omg, no more! i guess i'll have to try again on that challenge
Posted: Sat Dec 06, 2008 1:58 pm
by homeas
ok,ok I confess: my small mouse was cheating -- but only a little bit. It mostly finds the right solution and needs only 22 opcodes.
And cheating is a good qualification for hackers, isn't it?
Posted: Sat Dec 06, 2008 2:36 pm
by m!nus
how can you make it not always gets the right solution, do you ignore the last memory cell or something alike?
tog cheating or not?
Posted: Tue Apr 01, 2014 3:12 pm
by Hippo
tog wrote:adum wrote:good news: this can be solved in 23 instructions, i just realized (by looking at tog's very clever solution), so a brute force is a degree easier =)
Well, even better news: this can be solved in 21 instructions!
So may I suggest another challenge named "Smaller than the smallestest mouse"? Does this count as submission for "Create a Challenge"?
Just let me clarify things:
Does this (21) solution work on all possible inputs or is just able to pass the tests?
OH, finally I have rearranged my code and thanks to post solution forum I know 24 solution working for all inputs and 21 solution working with probability 1. (My 21 solution had probability 0.975).
But ... this is not over yet
.