算法目的
找到从起点到终点间的最短(最优)路径。
找到从起点到终点间的最短(最优)路径。
关键问题是如何利用知识,尽可能有效地找到问题的解或最优解。
精髓在于尝试和递归回溯。
八皇后问题就是说在棋盘上摆8个皇后让她们互相不处于对方的控制域内。本例中为了演示方便把搜索空间减小为一个的棋盘,变成四皇后问题。。
设是论域上的一个集合,对于任意,令
则称为集合的特征函数,集合与其特征函数可以认为是等价的:
i
不考,暂时跳过。
在证据理论中,分别用概率分配函数、信任函数、似然函数和类概率来描述和处理知识的不确定性。
不确定性推理是建立在非经典逻辑基础上的一种推理,它是对不确定性知识的运用与处理。
严格地说,所谓不确定性推理就是从不确定性的初始证据出发,通过运用不确定性的知识,最终推出具有一定程度的不确定性但却是合理或者近乎合理的结论的思维过程。
从全称判断推导出单称判断的过程,由一般知识推理细化出适合某一情况的结论。从一般到个别。
把有关信息关联在一起所形成的信息结构称为知识。把有关信息关联在一起所形成的信息结构称为知识。
Given the equivalence relation on A set , we can divide into several equivalence classes by . These equivalence classes form a partition of a set.
Conversely, given a partition of a set, we can define an equivalence relation: if two elements belong to the same subset, then they are equivalent. This gives us an equivalence relation.
Let be a group, any subgroup of , then the number of left (right) cosets of in is called the index of in , denoted as .
Lagrange's Theorem:
is a finite group, any subgroup of , then .
Proof: Let , then there are distinct left cosets of , denote , then is a partition of (Partition is not covering, cosets in are not overlapped), at this time we have
Let be a subgroup of (i.e., ). If for all , , then is called a normal subgroup of (or an invariant subgroup), denoted as .
In this case, the left and right cosets are simply called cosets.
The two trivial subgroups of , and itself, are normal subgroups.
Review the definition of symmetry group:
Let be an arbitrary set. . The group formed by the composition of such permutations is called the symmetric group on . -
Why is it called a symmetric group? This is because such groups describe the symmetry of objects. - In nature and real life, many objects have symmetry, such as isosceles triangles, squares, and regular polyhedra in geometric shapes. The symmetry of these shapes can be described as a transformation in the plane or space where the image of the shape coincides with itself.