Anytime you find yourself in this pattern, odds are, what you're doing is a candidate for being factored out, hierarchal decompositions is the buzzword you'd see in the textbooks if you're following along with any of them, but it's really just the idea of taking out common code and putting it into just one place.

任何时候你发现你处于这种模式中，可能，你所做的东西是可以提取改进的，体系分解是一个你在课本中看到的流行词,如果你遵循其中一个,这个实际上是一个把相同的代码,放到一个地方的思想。

哈佛公开课 - 计算机科学课程节选

We're also going to assume, just as we did last time, that voters are going to vote for the closest candidate.

我们还要假设,像上次一样,选民会选择离他最近的候选人

耶鲁公开课 - 博弈论课程节选

If she drops out, Jean wins for sure, So the expected distance away from her of the winning candidate is two away.

如果她退出,吉恩就肯定获胜,预期获胜者与她之间,的距离是两个位置

耶鲁公开课 - 博弈论课程节选

So voters vote for the closest candidate: the candidate whose position is closest to their own.

选民会投给最近的候选人,就是最接近自己的的候选人

耶鲁公开课 - 博弈论课程节选

So just to make that clear, voters vote for the closest running candidate first.

再说清楚一点,首先,选民投票给最近的候选者

耶鲁公开课 - 博弈论课程节选

We're going to assume that voters will eventually vote for the closest candidate.

我们假设,选民会投票给离他们最近的候选人

耶鲁公开课 - 博弈论课程节选

You're always going to end up voting for the candidate who's closest.

你们总是要选择,最近的候选人

耶鲁公开课 - 博弈论课程节选