Class RationalAI.MoveFinder

java.lang.Object

net.sf.colossus.ai.RationalAI.MoveFinder

Enclosing class:

RationalAI

private class RationalAI.MoveFinder
extends Object

Author:

Bruce Sherrod, David Ripton, Romain Dolbeau, Corwin Joy, extensively rewritten on 02-Oct-2003

Field Summary

Fields

Modifier and Type	Field	Description
private List<RationalAI.LegionBoardMove>	bestMove
private double	bestScore
private static final double	INITIAL_SCORE
private boolean	mustMove
private static final double	NO_MOVE_EXISTS
private long	nodesExplored

Constructor Summary

Constructors

Modifier	Constructor	Description
private	MoveFinder()

Method Summary

Modifier and Type	Method	Description
private void	branchAndBound(List<RationalAI.LegionBoardMove> performedMoves, List<List<RationalAI.LegionBoardMove>> availableMoves, double currentValue)
private boolean	checkNewCycle(MasterHex target, MasterHex from, List<RationalAI.LegionBoardMove> moves)	checkes if there is a path from 'from' to target, using the moves in the list.
List<RationalAI.LegionBoardMove>	findOptimalMove(List<List<RationalAI.LegionBoardMove>> all_legionMoves, boolean mustMove)
private List<RationalAI.LegionBoardMove>	getValidMove(List<RationalAI.LegionBoardMove> performedMoves)	checks if a move is valid, and if so returns the moves in an executeable sequence.
private double	moveValueBound(List<List<RationalAI.LegionBoardMove>> availableMoves)
private List<List<RationalAI.LegionBoardMove>>	removeHeadAndConflicts(List<List<RationalAI.LegionBoardMove>> availableMoves, RationalAI.LegionBoardMove lm)

Methods inherited from class Object

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

Field Details

bestMove

private List<RationalAI.LegionBoardMove> bestMove

bestScore

private double bestScore

mustMove

private boolean mustMove

nodesExplored

private long nodesExplored

INITIAL_SCORE

private static final double INITIAL_SCORE

See Also:

• Constant Field Values

NO_MOVE_EXISTS

private static final double NO_MOVE_EXISTS

See Also:

• Constant Field Values

Constructor Details

MoveFinder

private MoveFinder()

Method Details

findOptimalMove

public List<RationalAI.LegionBoardMove> findOptimalMove(List<List<RationalAI.LegionBoardMove>> all_legionMoves,
 boolean mustMove)

moveValueBound

private double moveValueBound(List<List<RationalAI.LegionBoardMove>> availableMoves)

getValidMove

private List<RationalAI.LegionBoardMove> getValidMove(List<RationalAI.LegionBoardMove> performedMoves)

checks if a move is valid, and if so returns the moves in an executeable sequence. The legios not moving are not part of bestMove. Returns null if the move is not valid.

Parameters:

performedMoves -

Returns:

branchAndBound

private void branchAndBound(List<RationalAI.LegionBoardMove> performedMoves,
 List<List<RationalAI.LegionBoardMove>> availableMoves,
 double currentValue)

checkNewCycle

private boolean checkNewCycle(MasterHex target,
 MasterHex from,
 List<RationalAI.LegionBoardMove> moves)

checkes if there is a path from 'from' to target, using the moves in the list. This is used to see if there are cycles in the moves, when you ad a move from 'target' to 'from'

Parameters:

target -

from -

moves -

Returns:

removeHeadAndConflicts

private List<List<RationalAI.LegionBoardMove>> removeHeadAndConflicts(List<List<RationalAI.LegionBoardMove>> availableMoves,
 RationalAI.LegionBoardMove lm)