Java的连连看代码，规则



选择两个点，如果两点的图片完全一样，并且两点之间可以用不超过3直线条线连接起来，则该两点可以消除。



计分

1、限定时间为地图中方块数 * 4，比如说有120个方块，就应该在480秒内完成，超过480秒没有时间奖励分

2、时间奖励分为剩余时间 * 2，即每提前一秒钟奖励2分

3、当已经选择点后，如果选择的第二个点与第一个点之间无法消除，扣1分，如果有解，则增加24分

4、使用刷新功能，系统会自动判断当前地图有无解，如果有解，扣8分，无解则加8分，慎用:)

5、使用提示功能，如果提示成功，扣10分

6、使用炸弹功能，如果炸弹功能有效，扣12分-Lianliankan Java, code, rules



Select two points, the same as if the two images, and between two points can be no more than 3 straight lines to connect, then the two can be eliminated.



Scoring

1, limit the time for the map box number* 4, for example, 120 boxes, it should be completed in 480 seconds, more than 480 seconds no time to award points

2, time is divided into the remaining time* 2 award, that award every 2 minutes ahead of a second

3, when has chosen point, if you select the second point can not be removed between the first point, subtract 1 point, if a solution, an increase of 24 points

4, using the refresh function, the system will automatically determine whether the solutions of the current map, if solvable, deducted eight points, no solution is added 8 points, with caution:)

5, using the prompt function, if prompted to success, 10 points

6, the use of bombs function, function effectively if the bombs, 12 points deduction