I have to disagree with your algorithm because, since P1 (youngest) is not getting anything if n = 2, he would vote for other pirates' plan if they offer him even one single coin. For example, in n=3, if P3 offers P1 a coin, P1 prefers P3's 1 coin over P2's 0 coin, and there, P3 would have the...