Android source code download: Five-piece elimination game

Functional classification: Leisure and puzzle

Supported platforms: Android

Operating environment: Android

Development language: Java

Development tools: Ecppse

Source code size: 5.43MB

Source code download address: http://down..com/data/1975239

Source code introduction

The source code of a popular five-piece elimination game in the past. I have studied it in the early days, and I hope that friends who are interested can study and discuss it together.

Source code running screenshot

Game Splash interface

The game starts with two teams facing each other

When the game succeeds, the score is tallied and the controls disappear

Source code snippet:

 //Some algorithm fragments involved in the game  
 /**
 * Breadth-first search method
 * @param from starting point
 * @param to end point
 * @param beads beads two-dimensional array
 * @return
 */  
 private   boolean isLink(Point from, final Point to, Bead[][] beads) {
 // Step 1: Record the points you have walked through  
        invalidPoints.add(from);
 // Step 2: Get the top, right, left and bottom points.  
 Point[] points = {
 new Point(from.x, from.y - 1 ),
 new Point(from.x, from.y + 1 ),
 new Point(from.x - 1 , from.y),
 new Point(from.x + 1 , from.y)
 };
 // Step 3: Determine whether the four points are valid or the destination points.  
        List<point> temp = new ArrayList<point>();
 for (Point p : points){
 // Have we reached the destination?  
 if (p.equals(to)){
                pathPoints.add(p);
 return   true ;
 }
 if (isCheck(p, beads)){
 temp.add(p);
 }
 }
 // Step 4: Determine whether all valid points are occupied.  
 if (temp.isEmpty()) return   false ; 
          
 // Step 5: Sort the valid points by the shortest path.  
        Collections.sort(temp, new Comparator<point>() {
 @Override  
 public   int compare(Point p1, Point p2) {
 double r1 = Math.sqrt((p1.x - to.x) * (p1.x - to.x) + (p1.y - to.y) * (p1.y - to.y));
 double r2 = Math.sqrt((p2.x - to.x) * (p2.x - to.x) + (p2.y - to.y) * (p2.y - to.y));
 return r1 < r2 ? - 1 : 0 ;
 }
 });
 // Step 6: Recursively find valid points and search until the destination point is reached or all valid points are searched.  
 for (Point p : temp){
 boolean flag = isLink(p, to, beads);
 if (flag){
                pathPoints.add(p);
 return   true ;
 }
 }
 return   false ;
 }</point></point></point>

Source code download address: http://down..com/data/1975239