I went through the rules and looked at some example games. I find the game quite interesting. Simple in its rules, but still very complex.
So after giving it some thought, I found out that there are 'only' 12.309.119.670 *) possible positions that can arise. So I ask now, has it ever been tried to solve this game? Probably the result would be that the starting side would win > 50% of the games, but still I would be interested in the result.
Has it ever been attempted to solve a game (using retrograd analysis) where luck and probabilites are involved?
*)
Code: Select all
int sum=0;
for (a = 1; a <= 6; a++) {
for (b = 1; b <= 6; b++) {
sum += (25! / (a! * (25-a)!) * ((25-a)! / (b! * (25-a-b)!));
}
}