dstefan
Baruch MFE Director
- Joined
- 5/19/06
- Messages
- 1,339
- Points
- 93
All solutions are essentially the same - we gave 3 points to the fastest solution this time.
Three point answer:
Li Zhou
3 different states we could be in. We could be the farthest from the opposite (full diagonal) -> call this A, we could be on same face as the opposite point but not adjacent -> call this B, or we could be on the same face and adjacent -> call this C. I'm going to define E(A) as the expected number of steps from A to the opposite point. E(B) as the expected steps from B to the opposite, etc... So E(A) = 1 + E(B). E(B) = 1 + 1/3 E(A) + 2/3 E(C). E(C) = 1 + 2/3 E(B). 3 equations and 3 unknowns. Solve E(A) = 10
Three point answer:
Li Zhou
3 different states we could be in. We could be the farthest from the opposite (full diagonal) -> call this A, we could be on same face as the opposite point but not adjacent -> call this B, or we could be on the same face and adjacent -> call this C. I'm going to define E(A) as the expected number of steps from A to the opposite point. E(B) as the expected steps from B to the opposite, etc... So E(A) = 1 + E(B). E(B) = 1 + 1/3 E(A) + 2/3 E(C). E(C) = 1 + 2/3 E(B). 3 equations and 3 unknowns. Solve E(A) = 10