|
此文章由 bats 原创或转贴,不代表本站立场和观点,版权归 oursteps.com.au 和作者 bats 所有!转贴必须注明作者、出处和本声明,并保持内容完整
本帖最后由 bats 于 2021-7-22 14:34 编辑
我只是个搬运工。下面的策略可以用于任何数目的洞
原理就是。狐狸一开始可能在奇数洞,或者偶数洞。那么只要把两种情况都筛一次就有一个统一的答案
具体的根据洞数目不同,还有很多其他答案。这个只是通用的
https://math.stackexchange.com/q ... -holes-with-n-holes
There is an easy strategy for any n.
Consider what happens if you inspect the holes (2, 3, 4, ..., n−1) on successive days. Prove that if the fox starts at an even-numbered hole, then it will not be able to get past your sweep, and that you will therefore catch it.
If you did not catch it, then it must have started on an odd-numbered hole. Now number the holes starting from the other end. Prove that the fox now (i.e. after that first sweep) must be in an even-numbered hole using that new numbering.
This means that you can do a second sweep in the opposite direction and must catch it.
Therefore the sequence (2, 3, 4, ..., n−1) followed by (n−1, n−2, ..., 4, 3, 2) will catch the fox. |
|