title: Optimizing a Parking Lot Problem. What algorithms should I use to fit the most amount of cars in the lot?
body: <p>What algorithms (brute force or not) would I use to put in as many cars (assume all cars are the same size) in a parking lot so that there is at least one exit (from the container) and a car cannot be blocked. Or can someone show me an example of this problem solved programmatically.</p>
  
  <p>The parking lot varies in shape would be nice but if you want to assume it's some invariant shape that is fine.</p>
  
  <p>Another Edit:
  Assume that driving distance in the parking lot is not a factor (although it would be totally awesome if it was weighted factor to number of cars in lot).</p>
  
  <p>Another Edit:
  Assume 2 Dimensional (no cranes or driving over cars).</p>
  
  <p>Another Edit:
  You cannot move cars around once they are parked (it's not a valet parking lot).</p>