As soon as the (N + 1)-th day comes, the military will come to rescue the survivors.There are N days of peril, during which they have to make it.The situation presents itself as follows: vim if he’s a real hero) and python3 installed - just enough to quickly run a simulation and find out what to do. Let’s assume, for the sake of argument, that our charismatic hero has a laptop with a text editor (e.g. To illustrate its simplicity, we will implement it in pure python (see: code). Instead, we will use a simple alternative known as the random search. Doesn’t it sound like an optimization problem?Īlthough it certainly can be formulated this way, we will see that it is not always possible to apply the standard gradient descent algorithm (SGD).
The decision has to be made - weighing the risks of losing a team member against running out of ammo. The people try to back them off using anything they can, but as they are getting short on ammo, the hero needs to send somebody to fetch more shells. Hoards of blood craving creatures knock on every door and every window trying to get inside. Imagine a typical Hollywood zombie apocalypse scenario…Ī group of desperate folks, led by a charismatic hero, barricades itself in some building, trying to make it to the end of the movie.
