优化A算法搜索连连看图块配对和消除次序

摘要

In view of the dynamic uncertain path searching problem with small loop characteristic, according to the characteristics of the Lianliankan game, through analyzing and comparing several search algorithms, this paper designs and implements a kind of optimized A algorithm, and searches the Lianliankan picture patch matching and the picture patch couple elimination order.The experiment proves that, the proposed algorithm is a kind of high speed and accurate dynamic search algorithm, and effectively avoids the dead lock caused by the non-fitness of the picture patch couple or the picture patch elimination order.%针对连连看游戏这种具有小循环特性的动态不确定路径搜索问题,论文根据游戏特点,通过对几种搜索算法分析比较,设计并实现了一种优化的A算法,对连连看图块配对和图块对消除次序进行搜索.实验证明论文算法是一种高效实用的动态搜索方法,有效减少了因图块组对不合适或图块对消除次序不合适造成的死锁.