Class AI

java.lang.Object

AI

public class AI
extends java.lang.Object

This class comprises of the main AI Engine for Chess game It uses min-max algorithm with alpha beta pruning to evaluate the best move. Contains main method. Change the value of MAXDEPTH to increase or decrease computing time ***************************************** MAXDEPTH || Speed || Move Quality * ***************************************** 1 || Very fast || Bad * 2 || Fast || Bad * 3 || Acceptable || Acceptable * 4 || Slow || Good * 5 || Very Slow || Very Good * *****************************************

Version:

2.0

Author:

Nakul Dureja

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	AI.Move This subclass represents a Move

Constructor Summary

Constructors

Constructor and Description
AI()

Method Summary

Methods

Modifier and Type	Method and Description
static AI.Move	alphabeta(int depth, int alpha, int beta, AI.Move curMove, int player) Implements MinMax algorithm with alpha beta pruning
static boolean	compMove() Generates move for computer.
static boolean	kingSafe(int kingColor) Determine if the King is safe
static void	main(java.lang.String[] args) Main function to start the game
static boolean	makeMove(int iniPos, int finPos, int captured) Making the move on the board
static int	movePiece(int iniPos, int finPos, int captured) Move a piece on board
static java.util.ArrayList<AI.Move>	posMovesBishop(int pos, boolean moved)
static java.util.ArrayList<AI.Move>	posMovesKing(int pos, boolean moved) Possible moves for king
static java.util.ArrayList<AI.Move>	posMovesKnight(int pos, boolean moved)
static java.util.ArrayList<AI.Move>	posMovesPawn(int pos, boolean moved)
static java.util.ArrayList<AI.Move>	posMovesQueen(int pos, boolean moved)
static java.util.ArrayList<AI.Move>	posMovesRook(int pos, boolean moved)
static java.util.List<AI.Move>	possibleMoves(int index) Generates all possible moves for current board.

Methods inherited from class java.lang.Object

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

Constructor Detail

AI

public AI()

Method Detail

main

public static void main(java.lang.String[] args)

Main function to start the game

Parameters:

args -

movePiece

public static int movePiece(int iniPos,
            int finPos,
            int captured)

Move a piece on board

Parameters:

iniPos -

finPos -

captured -

Returns:

makeMove

public static boolean makeMove(int iniPos,
               int finPos,
               int captured)

Making the move on the board

Parameters:

iniPos -

finPos -

captured -

Returns:

success boolean

possibleMoves

public static java.util.List<AI.Move> possibleMoves(int index)

Generates all possible moves for current board.

Parameters:

index - - 0 if for the whole board, else index of piece)

Returns:

List of possible moves

posMovesKing

public static java.util.ArrayList<AI.Move> posMovesKing(int pos,
                                        boolean moved)

Possible moves for king

Parameters:

pos -

moved -

Returns:

posMovesQueen

public static java.util.ArrayList<AI.Move> posMovesQueen(int pos,
                                         boolean moved)

posMovesRook

public static java.util.ArrayList<AI.Move> posMovesRook(int pos,
                                        boolean moved)

posMovesBishop

public static java.util.ArrayList<AI.Move> posMovesBishop(int pos,
                                          boolean moved)

posMovesKnight

public static java.util.ArrayList<AI.Move> posMovesKnight(int pos,
                                          boolean moved)

posMovesPawn

public static java.util.ArrayList<AI.Move> posMovesPawn(int pos,
                                        boolean moved)

kingSafe

public static boolean kingSafe(int kingColor)

Determine if the King is safe

Parameters:

kingColor- - color of the king in reference

Returns:

safe boolean

compMove

public static boolean compMove()

Generates move for computer.

Returns:

boolean for success

alphabeta

public static AI.Move alphabeta(int depth,
                int alpha,
                int beta,
                AI.Move curMove,
                int player)

Implements MinMax algorithm with alpha beta pruning

Parameters:

depth - - depth of tree

alpha - - value Default: INTEGER_MIN

beta - - value Default: INTEGER_MAX

curMove - - the current move

player - - the current player

Returns:

Move