[REBOL] Re: A Rebol Challenge. The Monty Hall Puzzle IN 0 BYTES
From: carl:cybercraft at: 18-Dec-2001 22:51
On 18-Dec-01, Reichart wrote:
> Hey Sunanda and Ryan,
> All very cool.
> But the goal is to not keep making the example shown with the C,
> MatLab, and Pearl smaller,
Aw gee... But see below... (:
> I really enjoy reading these examples though. I have learned about
> three new things about Rebol I did not know!
Me too.
>> And, losing the readability as you suggest, this is 8 bytes shorter
>> still:
>> w: 100 loop w[w: w - last random[0 0 1]]
>> 40 bytes, and counting,
>> Sunanda.
w: 100 loop w[w: w - any random[0 0 1]]
39...
--
Carl Read
