优化括号内为比赛 [英] Optimizing brackets for a tournament

问题描述

我要建一个系统，该系统会根据竞争者的名单上创建的比赛。

I'm building a system that will create a tournament based on a list of contenders.

竞争者有属性，可能使它们不能够被放置在括号海誓山盟，如性别，体重，技能水平，等等。

Contenders have properties that might make them not able to be placed in brackets with eachother, such as gender, weight, skill level, etc.

在某些情况下，这得到pretty的复杂的：

In some cases this gets pretty complex:

• 的竞争者可能会转到上一级的重量级别，但从来没有下来
• 在性别，可以在一定的年龄混合。

什么将是一个很好的办法让这些人进入最佳括号（例如，4，8，16尺寸）？是否存在已知的算法，这一点没有尝试所有排列？

What would be a good way to get these people into optimal brackets (for instance, sizes of 4, 8, 16)? Is there a known algorithm for this without trying all permutations?

推荐答案

这就是所谓的约束满足问题（CSP ）。其中一个最简单，而且在许多情况下，最有效的解决它的方法是通过强力搜索与回溯。

This is called a constraint satisfaction problem (CSP). One of the simplest and in many cases most effective way of solving it is by brute-force search with backtracking.

有一些很好的启发指导赋值时要遵循虽然。

There are some good heuristic guidelines to follow though when assigning values.

在最小剩余价值（MRV）启发说，在决定下一次分配这点在支架上时，挑一个与也可能会被分配给它的最少的人。

The minimum remaining value (MRV) heuristic says that when deciding which spot in the bracket to assign next, pick the one with the fewest people that could possibly be assigned to it.

在至少限制值（LCV）启发说，分配一个人到一个景点的时候，你应该选择将排除选择最少的人。

The least constraining value (LCV) heuristic says that when assigning a person to a spot, you should pick the person that would rule out the fewest choices.

AIMA拥有一支优秀的一章电信运营商： http://aima.cs.berkeley.edu/newchap05.pdf

AIMA has an excellent chapter on CSPs: http://aima.cs.berkeley.edu/newchap05.pdf

这篇关于优化括号内为比赛的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！