public class

MazeShortestPathExample

extends Object
java.lang.Object
   ↳ es.usc.citius.hipster.examples.MazeShortestPathExample

Class Overview

Example using a bidimensional maze, solved using the A* algorithm.

This example consists in a search problem in a Maze2D. This problem is characterized by:

  • The problem is defined without explicit actions
  • It uses a transition function implemented in the class Maze2D, which returns the accessible states from the current.
  • The cost functions is the Euclidean distance between points.
  • Heuristic function is also Euclidean Distance.
This example illustrates how to instantiate a SearchProblem and each one of the components required for search, explaining what they do.

Summary

Public Constructors
MazeShortestPathExample()
Public Methods
static void main(String[] args)
[Expand]
Inherited Methods
From class java.lang.Object

Public Constructors

public MazeShortestPathExample ()

Public Methods

public static void main (String[] args)

Throws
InterruptedException