解のパッケージ化競合共進化アルゴリズムの詰将棋への適用

概要

論文の詳細を見る
In this paper, we introduce a competitive co-evolution algorithm with a packaging solutions to solve the problem. This algorithm was proposed by us to a problem which doesn't have the optimal solution. In the case to solve such the problem, it needs to decide a set of effective solutions as the best solution. Our algorithm has two characteristics. The one is minimization of the number of individuals in the set by extraction of the complemental solutions. The other is evaluating solutions in some continued generations by setting a life-time to an individual. We apply the proposal method to the Tsume-shogi game in order to investigate its effectiveness. Furthermore, we analyze the process of the set formation. In the simulation results, our method can acquire the complemental strategies and shows a better performance than a conventional method.
琉球大学工学部の論文