This is a simulator for a problem I got on my math homework. Remember, it's not quite accurate. You're going on a solo climb of Mount Everest(don't try this at home!). You're at Base Camp, where you have all the food you need. The summit is three and a half days from Base Camp, but you can only carry three days of food with you at a time. Luckily, camps 1, 2 and 3 are each a day apart, and Camp 1 is a day from base camp. You can spend the night, and store food, at all camps(the summit is only half a day's climb from camp 3). Now here's the big question: What is the smallest number of days it will take to get to the summit and back? This simulator will help you find out.
Sorry, still a bit glitchy. Almost done, though! The glitch is you can't quite get back down from Camp 3 to Camp 2 after reaching the summit.
