摘要
用一个遗传算法来求解骑士巡游问题。算法将骑士巡游问题转化为求解无向图的汉密尔顿通路问题,通过对无向图的通路问题进行编码、评估、选择、杂交、变异,求解无向图的一条汉密尔顿通路,即骑士巡游问题的一个解。
Uses a genetic algorithm to solve the Knight＇s Tours. The algorithm transforms the Knight＇s Tours into solving graph Hamilton access problems, based on the encoding, assessment, selec- tion, hybridization, variability of the undirected graph, getting the undirected graph of a Hamil- ton path as the solution of the Knight Tour problem.
