最近做了个连连看游戏，综合网上各种不同的思路，整理出了个人认为大家都比较好理解的一套思路。



游戏规则：很简单,就是点中两个互相匹配并且可以通过不多于两个折点的折线连在一起的方块后,这两个方块就可以消掉。

(说明：下面的行和列按照现实的行和列,并不是按照flash坐标系的坐标，请大家按需转换)



连通算法：

1.直连型

2.一折型

3.两折型

-Lianliankan game recently made a comprehensive line of different ideas, sorting out a personal understanding that we are better set of ideas. Rules of the game: very simple point in the two match each other and can be off by more than two points of the box after the line together, can eliminate the two boxes. (Note: The following rows and columns in accordance with the reality of the rows and columns, not in accordance with the flash coordinate system, let us demand conversion) connected algorithm: 1. Extreme-2. A 3-fold. Two-fold type