The focus of the project will be an examination of obtaining the highest score in the Axelrod Tournament. The initial design of the highest score in the Axelrod Tournament consisted of looking at the Cooperation rates of the top strategies currently in the Axelrod Library. After creating an initial Finite State Machine strategy that utilized the Cooperation Rates of the top players; our ten-state FSM finished within the top 35 players out of 220 in the short run time strategies in the Axelrod Library. After a quick evolutionary algorithm, 50 generations, our original ten-state FSM was changed into an eight-state FSM, which finished within the top 5 of the short run time strategies in the Axelrod Library. This eight-state FSM was then evolved again using a full evolutionary algortihm process, which lasted 500 generations, where the eight-state FSM evolved into a another eight-state FSM which finishes first in the Axelrod Library among the short run time strategies and the full Axelrod Tournament. From that final FSM, two of the eight states are inaccessible, so the final FSM strategy is a six-state FSM that finishes first in the Full Axelrod Tournament, against the short run time strategies as well as the long run time strategies.
翻译:该项目的重点将是检查阿克塞尔罗德大赛中得分最高得分的最高得分;阿克塞尔罗德大赛中得分最高得分的最初设计包括研究阿克塞尔罗德图书馆目前最高战略中最高战略的合作率;在创建了最初的“最顶级国家机器”战略后,利用了顶级球员的合作率;在阿克塞尔罗德图书馆的短期战略中,我们10个州的得分在220名前35名参赛者中完成了;在快速进化算法(50代)之后,我们最初的10个州的密克罗尼西亚变成了8个州的密克罗尼西亚,在阿克塞尔罗德图书馆短期战略的前5个前期战略中完成了。这8个州的密克罗尼西亚战略在经过500代的全面进化阿尔格奥蒂姆进程后再次演变为另一个8个州的密克罗尼西亚,在阿克塞尔罗德图书馆的短期战略中,首先完成了阿克塞尔克罗德罗德图书馆的220名参赛。从最后一个密克罗尼罗尼西亚州,8个州中有两个州无法进入,因此,最后的密克罗尼罗尼西亚战略是短的6个州的策略,第一个完成整个期间的战略。