Puzzles
February 2017 (Port in a Storm)
December 2016 (Galaxy on Fire)
October 2016 (Shelter in Place)
August 2016 (Matchup)
June 2016 (Elevators)
April 2016 (Cell Towers)
February 2016 (Toy builder)
December 2015 (Crazy Cake)
October 2015 (Racecar design)
August 2015 (Moon Rover)
June 2015 (Campsite)
April 2015 (Desert Island)
February 2015 (Coins)
December 2014 (Electrifying)
October 2014 (Fighters)
August 2014 (Good Burger)
June 2014 (Frog and Fly)
April 2014 (Spy Catcher)
February 2014 (Pizza Delivery)
December 2013 (Golf Queuing)
October 2013 (Chutes and Ladders)
August 2013 (Urban Planning)
June 2013 (Self Driving Cars)
April 2013 (Subs vs. Battleships)
February 2013 (Chandelier Balancing)
December 2012 (Cookie Bake Off)
October 2012 (FarmOR)
August 2012 (Combination Locks)
June 2012 (Lost at Sea)
April 2012 (McEverywhere)
February 2012 (Popsicle Scheduling)
December 2011 (Dice Game)
October 2011 (Movie Stars)
August 2011 (Logical Hospital)
June 2011 (Matchmaker)
April 2011 (Choose Your Crew)
February 2011 (Best Host)
December 2010 (Miniopoly)
October 2010 (Home Improvement)
August 2010 (Relief Mission)
June 2010 (SurvivOR)
April 2010 (Patient 21)
February 2010 (Planet Colonization)
December 2009 (Fish Finder)
October 2009 (Connected & Infected)
August 2009 (Bridges)
June 2009 (Grocery Queuing)
April 2009 (Dance Scheduling)
February 2009 (Supply & Demand)
December 2008 (5x5 Poker)
October 2008 (3DPP)
August 2008 (Markov's Prison)
June 2008 (TSP)
April 2008 (Scheduling)
February 2008 (Decision Trees)
Answers
About the PuzzlOR
Analytics Treasure Hunt 2012
The PuzzlOR
Decision Support Puzzles for Applied Mathematicians
October 2008 - Noah's 3DPP












The three dimensional packing problem (3DPP) is a particularly complex problem in Operations Research.  To explore the subtleties of the 3DPP, letís look at one of the oldest packing problems in history, Noahís ark.

Click on the image below to print out and build the puzzle pieces.









                Two (2) Elephants: 2x2x2 units each
                Two (2) Cows: 3x2x1 units each
                Two (2) Giraffes: 1x1x4 units each
                Two (2) Foxes: 1x1x3 units each
                Two (2) Ladybugs: 1x1x1 units each
                One (1) Noah: 1x1x1 units
                One (1) Ark with the dimensions 3x3x5

Questions:
1.) When attempting to utilize all space within the ark, which algorithm is more efficient?
      A. Fit Decreasing (Add the pieces into the ark in order of largest piece to smallest piece.)
      B. Fit Increasing (Add the pieces into the ark in order of smallest piece to largest piece.)
2.) Is it possible to fill the ark with all of the animals so that no two like animals are touching?
Tweet
© Copyright 2017 - All Rights Reserved