Return to Question

Note: This problem remains unsolved, as of 19 April 2020, so do try it out. 400 rep bounty guaranteed for a correct answer

This a variation of this question by @Gamow

Suppose there are $100$ lions and $100$ zebras. The lions function together as a team, and so do the zebras. The lions place themselves first on an infinite plane, and the zebras place themselves next. Game proceeds turn-wise, one turn for the lion team, one for the zebra team. On each turn, a single zebra or lion (depending on which team's turn it is) moves by up to $100$ metres. Team decides which of their members moves, no restrictions on the pick. All positions and movements are public knowledge.

Lions win if a single zebra is eaten. Zebras will try to ensure this doesn't happen. Do the lions' have a strategy that works irrespective of the zebras' one?

P.S. @Veedrac's result is definitely helpful (whether or not you understand the math) if you are attempting to solve this.

P.p.s. Since this question is still attracting poor answers, let me simplify Veedrac's result. If x lions start in a circular formation and move radially outwards, no more than x zebras can forever escape this circle. x lions can always enclose 100-x zebras in their circle, where x is the lion team's choice. The question now becomes how this circle can be tightened without letting the zebras escape.

Note: This problem remains unsolved, as of 19 April 2020, so do try it out. 400 rep bounty guaranteed for a correct answer

This a variation of this question by @Gamow

Suppose there are $100$ lions and $100$ zebras. The lions function together as a team (perfect communication and united decision making), and so do the zebras. The lions place themselves first on an infinite plane, and the zebras place themselves next. Game proceeds turn-wise, one turn for the lion team, one for the zebra team. On each turn, a single zebra or lion (depending on which team's turn it is) moves by up to $100$ metres. Team decides which of their members moves, no restrictions on the pick. All positions and movements are public knowledge.

Lions win if a single zebra is eaten. Zebras will try to ensure this doesn't happen. Do the lions' have a strategy that works irrespective of the zebras' one?

P.p.s. Since this question is still attracting poor answers, let me simplify Veedrac's result. If x lions start in a circular formation and move radially outwards, no more than x zebras can forever escape this circle. x lions can always enclose 100-x zebras in their circle, where x is the lion team's choice. The question now becomes how this circle can be tightened without letting the zebras escape.

Note: This problem remains unsolved, as of 19 April 2020, so do try it out. 400 rep bounty guaranteed for a correct answer

This a variation of this question by @Gamow

Suppose there are $100$ lions and $100$ zebras. The lions function together as a team, and so do the zebras. The lions place themselves first on an infinite plane, and the zebras place themselves next. Game proceeds turn-wise, one turn for the lion team, one for the zebra team. On each turn, a single zebra or lion (depending on which team's turn it is) moves by up to $100$ metres. Lions win if a single zebra is eaten.

  Zebras will try to ensure this doesn't happen. Do the lions' have a strategy that works irrespective of the zebras' one?

P.S. @Veedrac's result is definitely helpful (whether or not you understand the math) if you are attempting to solve this.

P.p.s. Since this question is still attracting poor answers, let me simplify Veedrac's result. If x lions start in a circular formation and move radially outwards, no more than x zebras can forever escape this circle. x lions can always enclose 100-x zebras in their circle, where x is the lion team's choice. The question now becomes how this circle can be tightened without letting the zebras escape.

Note: This problem remains unsolved, as of 19 April 2020, so do try it out. 400 rep bounty guaranteed for a correct answer

This a variation of this question by @Gamow

Suppose there are $100$ lions and $100$ zebras. The lions function together as a team, and so do the zebras. The lions place themselves first on an infinite plane, and the zebras place themselves next. Game proceeds turn-wise, one turn for the lion team, one for the zebra team. On each turn, a single zebra or lion (depending on which team's turn it is) moves by up to $100$ metres. Team decides which of their members moves, no restrictions on the pick. All positions and movements are public knowledge.

Lions win if a single zebra is eaten. Zebras will try to ensure this doesn't happen. Do the lions' have a strategy that works irrespective of the zebras' one?

P.S. @Veedrac's result is definitely helpful (whether or not you understand the math) if you are attempting to solve this.

P.p.s. Since this question is still attracting poor answers, let me simplify Veedrac's result. If x lions start in a circular formation and move radially outwards, no more than x zebras can forever escape this circle. x lions can always enclose 100-x zebras in their circle, where x is the lion team's choice. The question now becomes how this circle can be tightened without letting the zebras escape.

Note: This problem remains unsolved, as of 19 April 2020, so do try it out. 400 rep bounty guaranteed for a correct answer

This a variation of this question by @Gamow

Suppose there are $100$ lions and $100$ zebras. The lions function together as a team, and so do the zebras. The lions place themselves first on an infinite plane, and the zebras place themselves next. Game proceeds turn-wise, one turn for the lion team, one for the zebra team. On each turn, a single zebra or lion (depending on which team's turn it is) moves by up to $100$ metres. Lions win if a single zebra is eaten.

Zebras will try to ensure this doesn't happen. Do the lions' have a strategy that works irrespective of the zebras' one?

P.S. @Veedrac's result is definitely helpful (whether or not you understand the math) if you are attempting to solve this.

Note: This problem remains unsolved, as of 19 April 2020, so do try it out. 400 rep bounty guaranteed for a correct answer

This a variation of this question by @Gamow

Suppose there are $100$ lions and $100$ zebras. The lions function together as a team, and so do the zebras. The lions place themselves first on an infinite plane, and the zebras place themselves next. Game proceeds turn-wise, one turn for the lion team, one for the zebra team. On each turn, a single zebra or lion (depending on which team's turn it is) moves by up to $100$ metres. Lions win if a single zebra is eaten.

Zebras will try to ensure this doesn't happen. Do the lions' have a strategy that works irrespective of the zebras' one?

P.S. @Veedrac's result is definitely helpful (whether or not you understand the math) if you are attempting to solve this.

P.p.s. Since this question is still attracting poor answers, let me simplify Veedrac's result. If x lions start in a circular formation and move radially outwards, no more than x zebras can forever escape this circle. x lions can always enclose 100-x zebras in their circle, where x is the lion team's choice. The question now becomes how this circle can be tightened without letting the zebras escape.