While working on a mathematical model we have come across a problem that seems easy yet has a bunch of intelligent, mathematically trained people start doubting themselves :).
Riddle us this...
Planet Elian is inhabited by flying elves. There are two islands, Sun and Moon. On island Sun live 250 elves, on island Moon 750. Each month a boat leaves from Sun to Moon and back, with room for 25 elves. The boat is always full and is the only way of transport between the islands (the elves don't fly off the islands). One day a black wizard visits Elian and curses the elves. Until the end of time 200 of the elves will be unable to fly... Luckily the non-flying elves have a 1 in 10 chance each month to be able to fly again. Unfortunately, because of the curse, the same amount of flying elves will have their wings cut.
Knowing that the chance to have your wings cut is twice as high on island Sun than on Moon, we would like to know the following:
- How many of the 200 elves that can't fly live on Moon?
- How many of those elves can fly back every month?
- How many elves have their wings cut on Sun?
- How many flying elves are on the boat from Sun to Moon and how many on the way back?
(Solving this will require non-integer numbers. This is ofcourse no problem.)
Basically we think it comes down to finding the state transition probabilities for the following Markov Model:

The person who can solve this will have our eternal respect and will be mentioned in the credits of the model!
Thanks and good luck!
All changes happen indeed at a given point in time and a single Elf can only move once from one state to the other during this month. Regarding probability, the probability is indeed relative on Sun versus Moon. As an example, if the probability to be cursed would be 8% on Moon, it would be 16% on Sun.