There is a subtlety in this puzzle. While it is possible to find min and max in the given number of operations, it can be done with one operation less, with a chance of about 0.163. In the other cases this causes on more operation. Compared to a lottery, there is a very high chance of winning the game :-)
This makes a proof more difficult IMHO.
Greetings,
🐻
In reply to Re: 1. Go compare! Guardian's algortithm riddle and mathematical proof
by jo37
in thread 1. Go compare! Guardian's algortithm riddle and mathematical proof
by LanX
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |