Java-Gaming.org Hi !
Featured games (90)
games approved by the League of Dukes
Games in Showcase (777)
Games in Android Showcase (231)
games submitted by our members
Games in WIP (856)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
 
    Home     Help   Search   Login   Register   
  JavaGaming.org - Pastebin



Author: Porlus (posted 2014-04-14 15:48:38, viewed 404 times)

1   2   3   4   5   6   7   8   9   10   11   12   13   14   15   16   17   18   19   20   21   22   23   24   25   26   27   28   29   30   31   32   33   34   35   36   37   38   39   40   41   42   43   44   45   46   47   48   49   50   51   52   53   54   55   56   57   58   59   60   61   62   63   64   65   66   67   68   69   70   71   72   73   74   75   76   77   78   79   80   81   82   83   84   85   86   87   88   89   90   91   92   93   94   95   96   97   98   99   100   101   102   103   104   105   106   107   108   109   110   111   112   113   114   115   116   117   118   119   120   121   122   123   124   125  
package com.paul.astar;

import java.util.ArrayList;
import java.util.List;

public class AStar {
   private List<Node> open = new ArrayList<Node>();
   private List<Node> closed = new ArrayList<Node>();
   private Node start = null;
   private Node goal = null;
   private Node last = null;
   
   public AStar(Node start, Node goal) {
      this.start = start;
      this.goal = goal;
      
      createPath();
   }
   
   private void createPath() {
      open.add(start);
      
      Node q = null;
      while(open.size() > 0) {
         for(Node node : open) {
            if(q == null || (q != null && node.f < q.f)) {
               q = node;
            }
         }
         open.remove(q);
         
         Node[] successors = new Node[] {
               new Node(q, q.x, q.y + 1), 
               new Node(q, q.x, q.y - 1), 
               new Node(q, q.x + 1, q.y), 
               new Node(q, q.x - 1, q.y)
         };
         
         for(Node node : successors) {
            if(node.equals(goal)) {
               last = node;
               break;
            }
            
            node.g = q.g + manhattanDistance(node, q);
            node.h = manhattanDistance(node, goal);
            node.f = node.g + node.h;
            
            /*
             * If successor exists in OPEN list with lower f
             * Skip this successor
             */
            
            boolean found1 = false;
            for(Node n : open) {
               if(n.equals(node) && n.f < node.f) {
                  found1 = true;
                  break;
               }
            }
            if(found1 == true) {
               continue;
            }
            
            /*
             * If successor exists in CLOSED list with lower f
             * Skip this successor
             */
            
            boolean found2 = false;
            for(Node n : closed) {
               if(n.equals(node) && n.f < node.f) {
                  found2 = true;
                  break;
               }
            }
            if(found2 == true) {
               continue;
            }
            
            /*
             * If not found in either list with smaller f
             * Add node to open list
             */
            
            if(!found1 && !found2) {
               open.add(node);
            }
         }
         closed.add(q);
      }
   }
   
   private int manhattanDistance(Node start, Node end) {
      return Math.abs(end.x - start.x) + Math.abs(end.y - start.y);
   }
   
   public void listNodes() {
      while(last.parent != null) {
         System.out.println(last.x + " : " + last.y);
         last = last.parent;
      }
   }
}

class Node {
   public Node parent;
   public int x, y;
   public float f, g, h;
   
   public Node(int x, int y) {
      this.x = x;
      this.y = y;
   }
   
   public Node(Node parent, int x, int y) {
      this.parent = parent;
      this.x = x;
      this.y = y;
   }
   
   public boolean equals(Node other) {
      return x == other.x && y == other.y;
   }
}





Dump your java code here :



Special syntax:
  • To highlight a line (yellow background), prefix it with '@@'
  • To indicate that a line should be removed (red background), prefix it with '-'
  • To indicate that a line should be added (green background), prefix it with '+'
  • To post multiple snippets, seperate them by '~~~~'
  EOF
 
hadezbladez (288 views)
2018-11-16 13:46:03

hadezbladez (157 views)
2018-11-16 13:41:33

hadezbladez (289 views)
2018-11-16 13:35:35

hadezbladez (71 views)
2018-11-16 13:32:03

EgonOlsen (2133 views)
2018-06-10 19:43:48

EgonOlsen (2152 views)
2018-06-10 19:43:44

EgonOlsen (1364 views)
2018-06-10 19:43:20

DesertCoockie (1966 views)
2018-05-13 18:23:11

nelsongames (1599 views)
2018-04-24 18:15:36

nelsongames (2247 views)
2018-04-24 18:14:32
Deployment and Packaging
by mudlee
2018-08-22 18:09:50

Java Gaming Resources
by gouessej
2018-08-22 08:19:41

Deployment and Packaging
by gouessej
2018-08-22 08:04:08

Deployment and Packaging
by gouessej
2018-08-22 08:03:45

Deployment and Packaging
by philfrei
2018-08-20 02:33:38

Deployment and Packaging
by philfrei
2018-08-20 02:29:55

Deployment and Packaging
by philfrei
2018-08-19 23:56:20

Deployment and Packaging
by philfrei
2018-08-19 23:54:46
java-gaming.org is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑gaming.org
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!