All Classes and Interfaces
Class
Description
A game state that represents a game being abandoned.
The reason that a game was abandoned before it was finished.
A game state that is included in the middle of a game to record an action that
was taken, but that is not a valid state to be in.
An agent that can autonomously play the Royal Game of Ur.
The shape of the board used for the game Aseb:
xxxx
xxxxxxxxxxxx
xxxx
The standard paths that are used for Aseb.
An agent that prioritises moving the least advanced piece, and avoids
introducing pieces, moving on to rosettes, or capturing.
An agent that can autonomously play the Royal Game of Ur.
The paths proposed by Bell for the Royal Game of Ur.
An agent that prioritises capturing, followed by moving on to rosettes,
and that prioritises moving the most advanced piece.
Rolls a number of binary die and counts the result.
A set of binary dice where a roll of zero actually represents
the highest roll possible, rather than the lowest.
Stores the placement of pieces on the tiles of a Royal Game of Ur board.
A type of board shape available for the Royal Game of Ur.
A factory that creates a board shape.
The type of board to use in a game.
A game state that records a control action that was made.
Provides an interface to write binary data.
Provides an interface to write binary data to a file.
Provides an interface to read binary data.
Provides an interface to write binary data to a file.
Produces game states from previous game states using the actions
that were taken in a game.
An agent that makes deterministic move choices for testing.
A generator of dice rolls, that is _not_ necessarily thread-safe.
A factory that creates dice.
The type of dice to be used in a game.
A game state where a player has won the game.
The board of a simple game that is optimised for speed.
Flags about the tiles on the board that can be accessed efficiently.
A simple game that is optimised for speed.
A list of moves that may be reused without allocating memory.
A variant of LutAgent that tries to make the worst moves possible.
Stores binary values and provides efficient methods to manipulate it.
Produces game states from scratch.
A game of the Royal Game of Ur.
A builder to help in the creation of custom games of the Royal Game of Ur.
Stores the metadata of games, such as the date the game was played,
the players of the game, and the game rules.
Settings for running games of the Royal Game of Ur.
A game state represents a single point within a game.
Encodes the state of a game to a small binary key.
Statistics about a game of the Royal Game of Ur.
Combined set of statistics from many games.
A target for the accumulation of statistics for games of the Royal Game of Ur.
An agent that prioritises capturing, followed by moving on to rosettes,
and that prioritises moving the most advanced piece.
Stores binary values and provides efficient methods to manipulate it.
Contains type checking helper methods for retrieving JSON values,
as Jackson doesn't support that for some reason.
A notation that can be used to encode games of the Royal
Game of Ur into JSON for serialisation.
An agent that prioritises capturing, followed by moving on to rosettes,
and that prioritises moving the least advanced piece.
An agent that makes deterministic move choices for testing.
Uses a lookup-table to decide the move to make.
A big map of compact keys and values for a Lut.
Holds the metadata stored for a LUT.
A lookup table based upon game states.
Work to visualise lut.
The paths proposed by Masters for the Royal Game of Ur.
A move that can be made on a board.
A game state that represents a move of a piece on the board.
The paths proposed by Murray for the Royal Game of Ur.
A notation can be used as a shared format for distributing
games of the Royal Game of Ur.
A game state from within a game where a winner has not yet been determined.
A sorted buffer of uint32 values.
Manages a set of ordered uint32 buffers, and uses merge sort to combine
them as needed.
Represents a pair of paths for the light and dark players to
move their pieces along in a game of the Royal Game of Ur.
A factory that creates a pair of paths.
The type of path to use in a game.
A piece on a board.
An interface that provides instances of pieces.
Scores game states based upon how far pieces have been advanced
by each player.
A game state where we are waiting for interactions from a player.
A player state represents the state of a single player at a point in the game.
An interface that provides the manipulation of PlayerStates as a game progresses.
Represents the players of a game.
An agent that makes random moves in games.
A game state that represents a player resigning from a game.
RGN (Royal Game Notation) is a textual format to encode games
of the Royal Game of Ur.
This file intends to hold tests that can be performed
to different sets of game rules and paths to compare them.
A roll of a dice.
A game state that represents a roll that was made in a game.
A set of rules that govern the play of a game of the Royal Game of Ur.
Creates rule sets to match game settings.
Encoding for simple rule-sets.
Provides new instances of, and manipulations to, simple pieces.
Provides new instances of, and manipulations to, simple player states.
A roll of dice that contains just a value.
The most common, simple, rules of the Royal Game of Ur.
A provider that creates simple rule sets.
The paths proposed by Skiriuk for the Royal Game of Ur.
The standard shape of board used for The Royal Game of Ur that
follows the game boards that were excavated by Sir Leonard Woolley.
Produces game states from serialised information.
A statistic that can be used to summarise a set of measurements.
A tile represents location on a Royal Game of Ur board.
Provides timing information for recording the history of a game.
A function that is used to score game states.
Stores binary values and provides efficient methods to manipulate it.
A game state where the game is waiting for a player to make a move.
A game state where the game is waiting for a player to roll the dice.