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, but to make a more verbose accurate portrayal of the original puzzle in Rebol. I'm then going to go see if they can do the same in Pearl, or language of choice. In agreement Sunanda, making us count Rebol[] should mean they count #includes, etc. But those parts of the arguments hold little meaning to me over all. One simply offers them up and states the facts. 145 with, 138 without for example. I really enjoy reading these examples though. I have learned about three new things about Rebol I did not know! Reichart... [EMAIL PROTECTED] "Be useful." -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] Sent: Monday, December 17, 2001 11:46 PM To: [EMAIL PROTECTED] Subject: [REBOL] Re: A Rebol Challenge. The Monty Hall Puzzle IN 0 BYTES Hi Ryan, > Incedently, > This is 3 bytes shorter: > > w: 100 print loop w [w: w - last random [0 0 1]] > > Of course more could be shave off, at the loss of readablility, but would > better > match the examples from other languages given. > 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. -- To unsubscribe from this list, please send an email to [EMAIL PROTECTED] with "unsubscribe" in the subject, without the quotes. -- To unsubscribe from this list, please send an email to [EMAIL PROTECTED] with "unsubscribe" in the subject, without the quotes.
