A B C D E F G H I K L M N O P Q R S T U V W

E

Environment - class ai.worlds.Environment.
A generic environment.
Environment() - Constructor for class ai.worlds.Environment
 
ExtensionFileFilter - class ai.logic.ExtensionFileFilter.
A convenience implementation of FileFilter that filters out all files except for those type extensions that it knows about.
ExtensionFileFilter() - Constructor for class ai.logic.ExtensionFileFilter
Creates a file filter.
ExtensionFileFilter(String) - Constructor for class ai.logic.ExtensionFileFilter
Creates a file filter that accepts files with the given extension.
ExtensionFileFilter(String, String) - Constructor for class ai.logic.ExtensionFileFilter
Creates a file filter that accepts the given file type.
ExtensionFileFilter(String[]) - Constructor for class ai.logic.ExtensionFileFilter
Creates a file filter from the given string array.
ExtensionFileFilter(String[], String) - Constructor for class ai.logic.ExtensionFileFilter
Creates a file filter from the given string array and description.
edgeCost(Node, Object, Object) - Method in class ai.search.Problem
Return the cost of an edge.
edgeCost(Node, Object, Object) - Method in class ai.search.RouteProblem
Determine the cost of an edge which is the distance between the cities.
equalState(Object, Object) - Method in class ai.search.CannibalProblem
 
equalState(Object, Object) - Method in class ai.search.ChainProblem
 
equalState(Object, Object) - Method in class ai.search.Problem
Determine if two states are equivalent.
equalState(Object, Object) - Method in class ai.search.Puzzle8Problem
 
equalState(Object, Object) - Method in class ai.search.RouteProblem
 
equals(Location) - Method in class ai.worlds.Location
Determine if location equals given location
execute(String) - Method in class ai.search.Search
Execute the search with the given algorithm.
executeAgentActions() - Method in class ai.worlds.Environment
Each agent executes its current action.
expand(Problem) - Method in class ai.search.Node
Generate a list of all the nodes that can be reached from a node.

A B C D E F G H I K L M N O P Q R S T U V W