Class LineCol

java.lang.Object

LineCol

public class LineCol
extends java.lang.Object

LineCol is my linear variant of the game Col. A board state is represented as an integer array. At the beginning of the game, all positions (that is, indices) are uncolored (0). The first player "colors" positions with BLUE (1). The second player "colors" positions with RED (2). Player's alternate coloring uncolored positions with their color under the constraint that a player may never color adjacent to an array position they have colored. For example, the first player may never color an UNCOLORED (0) position BLUE (1) if either adjacent positions before or after are already colored BLUE (1). The first player unable to make a legal play loses.

Field Summary

Fields

Modifier and Type	Field and Description
static int	BLUE
static int	NO_WINNING_MOVE
static int	RED
static int	UNCOLORED

Constructor Summary

Constructors

Constructor and Description
LineCol()

Method Summary

Modifier and Type	Method and Description
static int	getWinningMove(int[] state, int player) Given the LineCol game state and the current player, return the minimum index winning move for the current player, or NO_WINNING_MOVE (-1) if no such move exists.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

NO_WINNING_MOVE

public static final int NO_WINNING_MOVE

See Also:

Constant Field Values

UNCOLORED

public static final int UNCOLORED

See Also:

Constant Field Values

BLUE

public static final int BLUE

See Also:

Constant Field Values

RED

public static final int RED

See Also:

Constant Field Values

Constructor Detail

LineCol

public LineCol()

Method Detail

getWinningMove

public static int getWinningMove(int[] state,
                                 int player)

Given the LineCol game state and the current player, return the minimum index winning move for the current player, or NO_WINNING_MOVE (-1) if no such move exists. This should be computed recursively. (This can be done in 10 lines of code but that isn't a requirement.) No dynamic programming is required for this assignment.

Parameters:

state - an array representing the linear board coloring state with values UNCOLORED (0), BLUE (1), or RED (2).

player - current player BLUE (1) or RED (2)

Returns:

the minimum index winning move for the current player, or NO_WINNING_MOVE (-1) if no such move exists.