A play area. But complex enough that I need to version things. Should contain working examples and concepts. Promted from local chaos examples directory of dev boxes.
Explanation of what's in here
From post: squarism.com/2010/12/13/monty-hall-problem-in-ruby/. An exercise in statistics/simple algorithm. Uses basic OO and no gems. Simulates a game show and tracks the results of the Monty Hall problem. More information about the Monty Hall problem on wikipedia and youtube.
From post: squarism.com/2010/12/21/biggest-object_id-value-in-ruby/. Finds the largest object_id value in ruby. Essentially it's a number guessing algorithm. Ruby computes an object_id for a Fixnum up to a certain inflection point. This program finds this inflection point using only true/false feedback. The algorithm is digit based. IE: if it's guessing 525, it'd start with the hundreds digit 0 and use a simple guessing scheme to quickly (but not optimally). This is not efficient or anything mathematically significant, it was a constraint I put on myself in order to solve the problem a certain way. At the end of it, it prints the Fixnum value that produces the largest object_id you can have in ruby. It's an overflow test basically.
An image scraper for the comic site Penny Arcade. It follows the next/back links in a unknown chain and creates a timestamped filename from the post date and post title. Saves all files to ~/Pictures/PA which will work in OSX and Linux. Untested on Windows. Only saves new files so you could continually run this (probably better to cron daily). An exercise in following links and dealing with an unknown chain/linked list. Uses typheous, nokogiri and threads. Scraper thread pushes work to Saver thread. Saver thread saves the comic file while Scraper follows the next/back links on the site to enumerate all the comics. Prints a status bar while it runs and shows how many are in queue. Has some basic throttling.