At that stage we can merge these, and then take this down, do the division merge and bring them back up.

在那里做一次分解，做到这步时，我们可以把这些进行合并，然后把这个拿下来,做分解合并过程后再把它们拿回去。

麻省理工公开课 - 计算机科学及编程导论课程节选

I have to do twelve against thirty, twelve is smaller, take that out.

然后将其拿出来，17和30进行对比，24和30进行对比，到达这步时。

麻省理工公开课 - 计算机科学及编程导论课程节选

And so it only makes the move where it can sort of look ahead 20 moves, right, and see which branches have the computer winning.

所以只有当它能够预见到,自己接下来20步得以制胜的棋路时,它才会继续往下走

耶鲁公开课 - 死亡课程节选

Once we're there, we have to do the merge.

当我们到达这步时。

麻省理工公开课 - 计算机科学及编程导论课程节选