Package edu.ucsb.cs56.projects.games.pacman

Class Node

java.lang.Object

java.awt.geom.Point2D

java.awt.Point

edu.ucsb.cs56.projects.games.pacman.Node

All Implemented Interfaces:

java.lang.Comparable<Node>

public class Node
extends java.awt.Point
implements java.lang.Comparable<Node>

Class representing a node (tile) in map used for AI pathfinding Algorithm used: A* Read more: http://en.wikipedia.org/wiki/A*_search_algorithm Currently, the hCost is NOT admissable for going through tunnels since it will evaluate the cartesian distance and overestimate. In order for ghosts to consider tunnels, you need to modify hCost heuristic to be admissable.

Version:

CS56, F17

Author:

Kelvin Yang, Nicholas Duncan, Wei Tung Chen

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class java.awt.geom.Point2D

java.awt.geom.Point2D.Double, java.awt.geom.Point2D.Float

Field Summary

Fields

Modifier and Type	Field	Description
int	dir
edu.ucsb.cs56.projects.games.pacman.Node.MutableInt	distance
int	fCost
int	gCost
int	hCost
Node	parent
static int	tx
static int	ty

Fields inherited from class java.awt.Point

x, y

Constructor Summary

Constructors

Constructor	Description
Node(int x, int y, int gCost)	Constructor for node

Method Summary

Modifier and Type	Method	Description
int	compareTo(Node n)	Compares two nodes and determines which is better Used for sorting in priority queue
Node	getChild(int dx, int dy)	Creates a child node which represents movement from parent node
void	init()	Initializes distance for a path.
void	setDir(int dx, int dy)	Sets the direction of movement into node Prevents abrupt movements (left to right and up to down)

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from class java.awt.Point

equals, getLocation, getX, getY, move, setLocation, setLocation, setLocation, toString, translate

Methods inherited from class java.awt.geom.Point2D

clone, distance, distance, distance, distanceSq, distanceSq, distanceSq, hashCode, setLocation

Field Detail

tx

public static int tx

ty

public static int ty

gCost

public int gCost

hCost

public int hCost

fCost

public int fCost

dir

public int dir

parent

public Node parent

distance

public edu.ucsb.cs56.projects.games.pacman.Node.MutableInt distance

Constructor Detail

Node

public Node(int x,
            int y,
            int gCost)

Constructor for node

Parameters:

x - x grid coordinate of initial node

y - y grid coordinate of initial node

gCost - path cost to reach this node

Method Detail

init

public void init()

Initializes distance for a path. Only do it once

getChild

public Node getChild(int dx,
                     int dy)

Creates a child node which represents movement from parent node

Parameters:

dx - change in x

dy - change in y

Returns:

new child node with set values

setDir

public void setDir(int dx,
                   int dy)

Sets the direction of movement into node Prevents abrupt movements (left to right and up to down)

Parameters:

dx - change in x

dy - change in y

compareTo

public int compareTo(Node n)

Compares two nodes and determines which is better Used for sorting in priority queue

Specified by:

compareTo in interface java.lang.Comparable<Node>

Parameters:

n - node being compared to

Returns:

int signifying order