- Welcome to newLISP Fan Club.
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
#406
Anything else we might add? /
February 05, 2008, 01:55:40 PM #407
Anything else we might add? / newLISP Cocoa Bridge
February 05, 2008, 01:51:28 PM #408
newLISP newS /
February 05, 2008, 01:43:34 PMGood story, itistoday!Quote from: "m i c h a e l"
I wonder if he recognized it as a newLISP shirt or if he just admired its design? Too bad he ran off before you could ask him.
m i c h a e l
Yeah, it's too bad he ran off, but I think that based on how long he looked at it initially he was reading what it said, so there's a good chance he might have recognized it as a newLISP shirt! The word is spreading! :p
#409
newLISP newS /
February 04, 2008, 12:36:44 PM #410
newLISP newS /
January 18, 2008, 01:59:02 PM #411
newLISP newS /
January 18, 2008, 01:52:16 PM:-D->-<
^-- Me ecstatic about receiving my new shirt.
#412
newLISP newS /
January 15, 2008, 10:24:55 PMKeynote 4.0.1. I tried to do FOOP 3 in After Effects (fantastic program), but it was much more difficult. I'm basically happy with Keynote's results.Quote from: "m i c h a e l"
Ah, that's pretty nifty actually, for some reason I forgot that Keynote could do that, it's a fantastic program.
If you're still looking for someone to give the shirt to I'd be very happy to get one! Is it possible to get in size medium?Quote from: "itistoday"
Yes, great! I believe you can contact Lutz directly with your mailing address and size (I hope this is right, Lutz).
Awesome! I sent him an email with that information, thank you so much for donating your shirt! I just finished watching the Macworld Keynote, may the gods bless you with a MacBook Air in the near future! :-p
#413
newLISP newS /
January 15, 2008, 06:04:23 PMI won?! Wow, thank you, everyone! The last time I won something was for a diorama I built of aQuote from: "m i c h a e l"Star WarsLambda-class T-4a shuttle for a model competition back in 1983 :-)
I've already begun to design a special, hermetically sealed container/vault for the manual so it can be ready when the precious article arrives ;-)
Inspired by Norman's generosity (and because I already have one), I, too, would like to offer the first place t-shirt to any poor soul denied the joy of already possessing one. Any takers?
m i c h a e l
Congrats on winning, you definitely deserved it, those videos are awesome! What do you use to make them btw? (I'm curious because I used to do a lot of video editing).
If you're still looking for someone to give the shirt to I'd be very happy to get one! Is it possible to get in size medium?
#415
newLISP newS /
January 15, 2008, 01:42:06 PM #416
newLISP newS /
December 13, 2007, 06:57:21 AMnice one Lutz!Quote from: "cormullion"newLISP v.9.2.9 on OSX UTF-8, execute 'newlisp -h' for more info.Code Select
> (set 'a (array 2 2 (randomize (sequence 1 10))))
((8 7) (2 10))
> (sort a)
((2 10) (8 7))
Awesome! Thanks Lutz! :D
#417
newLISP newS /
December 08, 2007, 12:05:11 AMEssentially I wrote a program in newLISP that tried its best to eliminate as many pieces as possible from a ChainShot game.Quote from: "itistoday"
Nice project. Perhaps you could add a GUI to it one day..!
Yeah, I think I might actually, once I finish all my finals for school. Then if there's time I might enter it into the '07 newLISP competition. :-D
#418
newLISP newS /
December 08, 2007, 12:03:26 AMI implemented a simple memory allocation hack:Quote from: "Fanda"
Wow, that's pretty neat. It's still doing a context-like trick by using named symbols for the pointers, and evaluating a pointer takes log(n) time (b/c of the red-black tree), but that's still a really cool trick. Thanks for sharing!
Using this approach, code readability goes down to... lets say... C/C++ ;-)))Quote from: "Fanda"
Well, almost, it's kinda difficult to make newLISP
#419
newLISP newS /
December 07, 2007, 09:44:18 AMPerhaps you are looking for is some sort of associative data access. A way to access a piece of information via a key pointing to a data-value. This is what binary-trees are used for in 99% of the cases.Quote from: "Lutz"
Well actually the binary tree was just an example, the original tree that I had in mind was like the one I gave in the first post, where it could have an arbitrary number of children. The main thing I wanted to be able to do was to quickly add/remove children from it.
newLISP has bult-in very fast associative data access by usage of contexts/namespaces, which internally are binary trees (the red-black kind of optiized binary tree.Quote
Here is short chapter in the manual with examples, which might help you:http://newlisp.org/downloads/newlisp_manual.html#hash">http://newlisp.org/downloads/newlisp_manual.html#hash
Lutz
Yeah I've read that, those are cool, but not exactly what I needed for this project. I still think you should consider adding the 'unsafe-ref' function (or something like it). :-D
#420
newLISP newS /
December 07, 2007, 09:13:08 AMAre you thinking about speed? The need for speed...?! :)Quote from: "cormullion"
Oh... why yes, most definitely. :)
I wonder how big your lists are going to be... What's the application, out of interest?Quote from: "cormullion"
It's for my artificial intelligence final class project. I was originally planning on using a tree, but since I ran out of time I decided to go with a simpler method... Essentially I wrote a program in newLISP that tried its best to eliminate as many pieces as possible from a ChainShot game.
If you haven't heard of ChainShot, and you have a Mac, you can download a free version of it here:
The game works like this: the player clicks on blocks, and if the block that they click on has any pieces around it (above, below, left or right) that are of the same color, then all of the pieces that are adjacent to those and are the same color will be eliminated (including the block that was clicked on). Then any pieces above those will fall down, and if an entire column is eliminated then any columns to the right of that will be slid over to the left to eliminate all gaps. The game ends when there are no possible moves left.
As you can imagine (if I had time to go with the tree version of the algorithm) the tree would get really big for a 20x20 board. As it turned out I wasn't able to do that because I didn't know how to do that quickly in newLISP, and because I came up with an alternate algorithm that was faster to implement and worked pretty well to boot. I also made it multi-"threaded" using newLISP's 'fork' function. :)
Usually it did a pretty darn good job of solving them in a reasonable amount of time (under a minute), especially if the boards were less than size 20x20.