Quantcast

Maximum PC

It is currently Mon Oct 20, 2014 3:42 am

All times are UTC - 8 hours




Post new topic Reply to topic  [ 2 posts ] 
Author Message
 Post subject: ITA Software Puzzle -- Movie Chain
PostPosted: Sun Jul 24, 2011 3:28 pm 
Bitchin' Fast 3D Z8000*
Bitchin' Fast 3D Z8000*
User avatar

Joined: Tue Jun 29, 2004 11:32 pm
Posts: 2555
Location: Somewhere between compilation and linking
For those who haven't heard of ITA Software, they're a software company in the Boston area that employees puzzle billboards in order to find job applicants. They've also recently been acquired by Google (who has also employed puzzle billboards in the past). They're also a major employer of Lisp programmers. Anyways, this looks like a pretty interesting puzzle.
Image
For increased clarity, I would recommend output that capitalizes all of the letters in adjoining words but leaves all other words in lowercase. For example, the example above would be written "live and let DIE another DAY of the DEAD poet's society". It would also help if you're output included the number of movies chained together (ie 4 above).

Is anyone interested in this problem? Let's say that we limit ourselves to IMDB and Netflix movie entries. Go!


Top
  Profile  
 
 Post subject: Re: ITA Software Puzzle -- Movie Chain
PostPosted: Fri Jul 29, 2011 2:06 am 
Bitchin' Fast 3D Z8000*
Bitchin' Fast 3D Z8000*
User avatar

Joined: Tue Jun 29, 2004 11:32 pm
Posts: 2555
Location: Somewhere between compilation and linking
I should have included some hints for making this simpler for beginners...

1) Instead of actually going to the trouble of writing a web crawler or even downloading a list of movies from somewhere, use a much easier but equivalent notation like tuples of letters. For example, our letter database includes the following tuples... {aa ab ac ba bb bc ca cb cc}. Tuples can be chained together via first and last letter like aa-ab-bb-bc-cc-ca.

2) Understanding the problem. Using something like say a GRAPH... how original!!! =) ... we can start to visualize the problem. Every tuple is a vertex (eg aa) and there should be a directed edge from aa to every tuple/vertex that begins with an 'a' (except for 'aa' -- no self loops). Now that we can visualize the state space, what do we need to do to solve this problem?


Top
  Profile  
 
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 2 posts ] 

All times are UTC - 8 hours


Who is online

Users browsing this forum: No registered users and 1 guest


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

Search for:
Jump to:  
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group

© 2014 Future US, Inc. All rights reserved.