Website Logo. Upload to /source/logo.png ; disable in /source/_includes/logo.html

Mocking Eye

'Tis all in vain?

Moviesneak -- Stretch Your Movie Ticket Dollar

| Comments

Ever sneak from one movie to another at the movie theatre, after only paying for one ticket? Well, I have. And I like it. This can often be done by looking at the showtimes ahead of time and finding movies that are times relatively near each other. Although this is sometimes thwarted by placing the temporally adjacent movies in different sections of the theatre, there are often opportunities for this type of sneaking. But instead of bothering to study movie showtime tables and such, I've written a little python script to do it for me. It's rather rudimentary. Here's how to use it:
  1. Get moviesneak.py
  2. Get showtimes for a theatre in your area.
    1. The format moviesneak accepts is Google Showtimes, which can be accessed by googling showtimes <zipcode>, or using this url: http://www.google.com/movies?near=<zipcode>.
    2. Then select all the showtimes in a particular movie theatre, starting from the review stars, not including the theatre's address.
    3. Copy these into a file somewhere.
  3. Run moviesneak: moviesneak.py showtimes-file [optional time threshold in seconds].
    • By default, the threshold is 15 minutes (900 seconds). The threshold is how long before or after the end of one movie the following one should be. So a 15 minutes threshold means the following movie can start 15 mins before the current one ends, or 15 after (remember that even though it starts 15 mins before the current ends, you won't have to leave early, you'll only miss the previews)
The code is under a BSD license, so just about anything can be done with it. If you have time to muck with BeautifulSoup or just plain regex, it would be nice if moviesneak could query google showtimes (or any other source) directly. The algorithm is very simple, and pretty ugly, but it can be plugged into pretty surroundings easily (such as a web interface). Edit: I haven't bothered writing a chaining algorithm (i.e. find the longest sequence of contiguous movies) mostly because I really can't watch more than 2 movies in a row at a movie theatre. However, one shouldn't be hard to write, since the corpus size is small enough even horrible algorithms will chug through quickly. Maybe when I'm bored enough/free enough I'll write one to extend moviesneak.