Class Robot.RobotUtility

java.lang.Object

Robot.RobotUtility

Enclosing interface:

Robot

public static class Robot.RobotUtility
extends java.lang.Object

RobotUtility class
Provides utilities for students to use in Robot implementations.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	Robot.RobotUtility.FSPPredicate FSPPredicate class: used internally in nearest path methods

Constructor Summary

Constructors

Constructor and Description
Robot.RobotUtility()

Method Summary

Methods

Modifier and Type	Method and Description
static Robot.GridCell	findNearestAlly(Robot.GridCell origin, Robot.GridCell[][] grid) Find nearest neighbor: Finds the nearest ally to cell, approximately as the crow flies.
static Robot.GridCell[]	findShortestPath(Robot.GridCell origin, Robot.GridCell target, Robot.GridCell[][] grid) Shortest path calculator: Finds the shortest path from one grid cell to another. This uses Dijkstra's algorithm to attempt to find the shortest path from one grid cell to another.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Robot.RobotUtility

public Robot.RobotUtility()

Method Detail

findNearestAlly

public static Robot.GridCell findNearestAlly(Robot.GridCell origin,
                             Robot.GridCell[][] grid)

Find nearest neighbor:
Finds the nearest ally to cell, approximately as the crow flies.

Parameters:

origin - cell to find

grid - grid to analyze

Returns:

nearest ally, or null if we have no allies in grid

findShortestPath

public static Robot.GridCell[] findShortestPath(Robot.GridCell origin,
                                Robot.GridCell target,
                                Robot.GridCell[][] grid)

Shortest path calculator:
Finds the shortest path from one grid cell to another.

This uses Dijkstra's algorithm to attempt to find the shortest path from one grid cell to another. Cells are adjacent if they are up, down, left, or right of each other. Cells are not adjacent if they are diagonal to one another.

Parameters:

origin - starting grid cell

target - ending grid cell

grid - grid to analyze

Returns:

a path guaranteed to be the shortest path from the origin to the target. Will return null if no path could be found in the given grid.