- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report
That's right boys and girls.
We are bypassing Challenge Nos. 5, 6, 7, 8 ,9 , 10, and 11 in favor of the 12th month of the year because that's when Christmas comes!
Digging back into history, it was in 1997 that the great Dietmar Rudolph challenged us to build a Christmas tree using AutoLisp. Of course he included some rule about it being no more that 47 somethings long, which only his own was that short. And his function created a very artistic tree. I'm ashamed that I never kept a copy. But I have kept a copy of my own entry, to which he gave honorable mention. I have attached the file to inspire you all to do a better job than I.
Unlike Dietmar's rule, there is no limit to the amount of code you may create in your function, but everything must be created within the code. No references to external anythings are allowed. In fact each entry will consist of just one (1) AutoLisp file. The use of Visual Lisp is just fine. There will be no time trials. In fact you might want to throw in some delays to slow down your creation to enjoy it more (I should have done that).
Let's try to have all the entries in by Sunday, Dec. 19, so we can enjoy them all before Christmas day. Maybe you can teach me how to make one of those video thingies that I can send to my children and theirs.
CAUTION: Run my code only in an empty drawing because it erases everything.
John F. Uhden
Solved! Go to Solution.