Page 2 of 2

Posted: Tue Oct 21, 2014 5:30 pm
by avrrobot
Maybe we should all cooperate and find the absolutely smallest mouse :wink:

Computing power

Posted: Thu Apr 06, 2017 11:57 am
by a.goth
Hippo wrote:Hmmm, I have a feeling the snibril constraint solution does not exist :(.
I have decided to run bruteforce search for it ... looks like several years of machine time would suffice to prove the nonexistence of it ... . (I am not searching for 20 op code, but 21 without > ...)

Hmmm, the estimate time is something between 10^8 to 10^12 years ... the prunnig is probably not powerful enough ;). ... maybe using idle time of all world computers ... but the energy consumption ...

... hvm simulator using graphic cards paralelism ... if something like that would be possible, than maybe ...
Fortunately, human creativity and intelligence still often enough beats computing power:

Code: Select all

Er... you did not see that.
Nevertheless, my actual solution to challenge 'Surely Smallest Mouse' was as follows:

Code: Select all

10^<11^0<1^7?::>1+1cp
However, I still have no idea how to save another instruction to solve challenge 'Surely Smallester Mouse'. Any helpful hints you could give me, without giving too much away?

Posted: Fri Apr 07, 2017 1:01 pm
by Hippo
There are all clues already here. See our previous posts (OK not exactly the last one of me).

Routine-blinded

Posted: Mon Apr 10, 2017 7:59 am
by a.goth
Oh boy! I did not see the forest for the trees. Stupid me.

Re: Routine-blinded

Posted: Mon Apr 10, 2017 1:28 pm
by Hippo
a.goth wrote:Oh boy! I did not see the forest for the trees. Stupid me.
I am happy I was able to help :). ... May be we should remove the hints?

... OK the last piece I had to discover is already replaced in your post by "Er... you did not see that. "