By cbegin
via clintonbegin.com
Published: Jul 16 2008 / 22:15
Dwemthy's Array is an uber-geeky text based adventure game with a specific coding challenge built in, and is particularly suited to implementation with a dynamic language such as Ruby. What caught my attention recently, was Adrian Kuhn's implementation in Java. Despite my love-hate (or like-hate) relationship with Java, I'm always up for a coding challenge. I've taken Adrian's Java implementation and made it "MOAR META!" by using annotations and dynamic proxies.
Comments
akuhn replied ago:
Wow brilliant!
I was not aware of dynamic proxies. They seem to be quite powerful, I am already pondering over moar proxy hacks. Learning is an infinite loop, thanx!
cheers,
AA
NB as a long-year DM myself, I am happy to see that you use a more robust rand() to make dice rolls less prone to cheating :)
cbegin replied ago:
Thanks Adrian. My rand() code is actually horrible. :-) It uses an unseeded PRNG... but I did it because I was hoping for a more even distribution when I was doing the 1000 Rabbits test (I still should have seeded a single instance). I was curious on average how many rabbits it would take to defeat Dwemthy's Array. I meant to remove it or at least implemented it properly. :-)
But I wasn't very focused on the game rules themselves, it was the interfaces that were really interesting to me. This is an excellent programming challenge. Thanks for introducing it to the Java community!
Clinton
Voters For This Link (10)
Voters Against This Link (1)