ai怎么约束每个字的大小_人工智能的约束满意问题

ai怎么约束每个字的大小

Constraint Satisfactory problems, as the name suggests are the problems which have some constraints which need to be satisfied while solving any problem. In simpler words, we can say that while solving any problem or changing any state to reach to the goal state, our Agent cannot violate the constraints which are defined for any problem in prior.

约束令人满意的问题 ，顾名思义就是在解决任何问题时需要满足一些约束的问题。用简单的话来说，我们可以说，在解决任何问题或更改任何状态以达到目标状态时，我们的Agent不会违反先前为任何问题定义的约束。

In solving the constraint satisfactory problems, an Agent has the following parameters to consider: a set of variables, Domain, Set of constraints.

在解决约束令人满意的问题时 ，Agent要考虑以下参数： 一组变量 ，域， 约束集 。

Set of variables:
变量集：

The variables are like empty containers in an agent (system) where the data is to be placed. Any information or data that the agent deals with has to be stored somewhere and this work is done by the variables. The collection of all the variables that the agent uses to solve that particular problem is known as the set of variables for that problem.
变量就像要放置数据的代理(系统)中的空容器一样。代理处理的任何信息或数据都必须存储在某个位置，并且此工作由变量完成。代理用来解决特定问题的所有变量的集合称为该问题的变量集。
Domain:
域：

Domain is the field in which knowledge is to be attained by the agent. Any problem deals with the information or data in any particular field and the domain defines this field. A domain can simply be defined as what data or information is to be collected or placed.
领域是代理商要获取知识的领域。任何问题都与任何特定字段中的信息或数据有关，并且域定义了此字段。域可以简单地定义为要收集或放置的数据或信息。
Set of constraints:
约束集：

It is the collection of all the restrictions and regulations that are imposed on the agent while solving the problem. The Agent cannot violate or avoid these restrictions while performing any action.
它是解决问题时对代理施加的所有限制和法规的集合。代理在执行任何操作时不能违反或避免这些限制。

Any agent (Artificial Intelligence-based) who solves the constraint Satisfactory problems has the above-mentioned parameters embedded in its system.

解决约束令人满意的问题的任何代理(基于人工智能)都将上述参数嵌入其系统中。

There are many games and puzzles which lie under the constraint satisfactory problem. Some commonly known among them are Sudoku, N-queens problem, Map Coloring Problem, Crossword, Crypt-Arithmetic Problem, Latin Square Problem, etc. All these problems have their own set of rules and regulations that should not be violated and these rules and regulations act as constraints for each of them.

在令人满意的约束下有许多游戏和难题。其中常见的是Sudoku，N-queens问题，Map着色问题，填字游戏，Crypt-算术问题，Latin Square问题等。所有这些问题都有自己的一套规则和规定，不应被违反，这些规则和法规对每个法规都有约束。