|Elevator Saga - An Addictive Programming Challenge|
|Written by Mike James|
|Monday, 26 January 2015|
Elevators are simple - right? They just go up and down and move people. But if you are a programmer, waiting for one can prompt the thought.could this be done better? The Elevator Saga is a game where you get to schedule their movements. It isn't easy and it is addictive.
You supply two functions init, which is called just once at the start; and update, which is called repeatedly. This simple algorithm just sends the elevator to each floor in turn collecting and dropping off passengers.
This algorithm is flawed, as mentioned in the comments, because there are thee floors not just two. The algorithm fails as the elevator slowly clogs up with people needing to get off at the second floor.
You are challenged to improve the algorithm to transport the requisite number of people in the given time and when you succeed you can move on to the next challenge. There are no prizes but the intrinsic reward is in showing that you can invent an algorithm that works. It would also be a possible way of introducing someone to programming but only with some additional help.
Notice that the passengers don't indicate to the elevator the floor they want to get to just up or down. In real life entering an elevator without floor buttons is worrying to passengers so it tends not to be used but it is efficient.
The question is how efficient?
Later on you get to work with multiple elevators as well and then it gets really interesting.
You can discover the full API that you can use in constructing an algorithm on the challenge web site, but if you are interested in some theory Sharpen your Coding Skills - Elevator Puzzle to find out about Karp's Algorithm.
To be informed about new articles on I Programmer, install the I Programmer Toolbar, subscribe to the RSS feed, follow us on, Twitter, Facebook, Google+ or Linkedin, or sign up for our weekly newsletter.
or email your comment to: email@example.com
|Last Updated ( Monday, 26 January 2015 )|