All Classes and Interfaces

Class
Description
The abstract parent class of all chess playing agents.
A more convenient representation of command line argument based on keys and values.
An object that allows an array to be treated as Iterable.
Iterates through all the elements in an array.
A short text banner that appears above the chess board.
Represents the bishop chess piece.
A graphical representation of a chess board.
Represents a chess board and the pieces on it.
A high-level container representing the game's current state, which can displayed either on the console as text or on the screen as a GUI.
An instance of ChessDisplay that shows the game in a JFrame.
A simple text console to display a transcript of the game.
A directed acyclic graph (or DAG) whose nodes are of a given type.
Represents a single directed egde in a DirectedAcyclicGraph.
An implementation of OutputStream that does nothing.
An implementation of Writer that does nothing.
A format exception is thrown when the input to a Parser is improperly formatted.
Represents a single chess game between two Agents.
An array whose values cannot be modified.
A list of objects which cannot be modified.
Represents the king chess piece.
Represents the knight chess piece.
A list is a collection of 0 to many nodes.
The entry point for the chess application.
A min priority queue which, instead of using a Comparator, allows the user to specify a numeric key that should be associated with the item being added to the queue.
The abstract parent class of List and Symbol.
An object parser provides a means of translating a node into an object of a specific kind.
Indicates that an algorithm has performed more than the maximum allowed number of operations.
Represents the three possible outcomes of a Chess game.
Converts text into various kinds of objects based on customizable rules.
Represents the pawn chess piece.
Provides methods for generating Portable Game Notation from a sequence of chess states.
Represents an individual chess piece as a GUI element.
Represents an individual piece of one color at a given location.
Represents the two players of a chess game: white and black.
Represents the queen chess piece.
Represents the rook chess piece.
Represents the limitations placed on an algorithm in terms of how many operations it may perform and how long it make take to solve a problem.
Indicates that an algorithm has used more than the maximum allowed resources.
Various settings that control the appearance and computational constraints of the game.
Settings for all projects.
Represents the current state (between moves) of a game of chess.
A symbol is a string of characters.
Logic for displaying simple 2-dimensional tables of data.
An individual unit of data in the table.
A vertical sequence of cells.
A horizontal sequence of cells.
The abstract parent of Table.Row and Table.Column.
Indicates that an algorithm has taken more than the allowed amount of time.
A tuple is simply an array of Objects implemented such that two tuples are the same (i.e.
Assorted helpful methods.