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

I

I1 - b2p.state.bitboard.bitset.BitSetPosition

I2 - b2p.state.bitboard.bitset.BitSetPosition

I3 - b2p.state.bitboard.bitset.BitSetPosition

I4 - b2p.state.bitboard.bitset.BitSetPosition

I5 - b2p.state.bitboard.bitset.BitSetPosition

I6 - b2p.state.bitboard.bitset.BitSetPosition

I7 - b2p.state.bitboard.bitset.BitSetPosition

I8 - b2p.state.bitboard.bitset.BitSetPosition

I9 - b2p.state.bitboard.bitset.BitSetPosition

IAction - Interface in b2p.model

This Interface represents an action that can be performed during the game

IAdversarialSearch - Interface in b2p.search.aima

This interface defines the functions needed to perform an Adversarial Search

IGame - Interface in b2p.search.aima

Defines a standard interface for a game.

IState - Interface in b2p.model

Interface defining the state of the game

isTerminal(IState) - Method in interface b2p.search.aima.IGame

Returns a boolean whether the current state is a terminal one

isTerminal(IState) - Method in class b2p.search.aima.TablutGame

Returns a boolean whether the current state is a terminal one

isWinningState() - Method in interface b2p.model.IState

Checks if the current state is a winning state

isWinningState() - Method in class b2p.state.bitboard.bitset.BitSetState

Checks if the current state is a winning state

IterativeDeepening - Class in b2p.search.aima.minmax

This class implements IAdversarialSearch and defines the Iterative Deepening Minimax algorithm with alpha-beta pruning.

IterativeDeepening(TablutGame, int, int, int) - Constructor for class b2p.search.aima.minmax.IterativeDeepening

Creates an IterativeDeepening instance for a TablutGame with a given timeout and utility values.

IterativeDeepening.Timer - Class in b2p.search.aima.minmax

Utility class representing an in-game timer

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