viergewinnt

Class Strategy

java.lang.Object

viergewinnt.Strategy

public class Strategy
extends java.lang.Object

A strategy implementing alpha,beta pruning, iterative deepening and storing of computed evaluations in a hash-table. It still lacks dynamic move-ordering based on previous evaluations.

Constructor Summary

Constructors

Constructor and Description
Strategy(AbstractField f)

Method Summary

Methods

Modifier and Type	Method and Description
double	alphaBetaPruning(int maxDepth, boolean first, double alpha, double beta) It sets the instance variable bestPosition, containing the best move Note: The evaluation is only stored, when the situation is completely evaluated.
void	makeMove(int timeLimit) The time limit is exceeded.

Methods inherited from class java.lang.Object

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

Constructor Detail

Strategy

public Strategy(AbstractField f)

Method Detail

makeMove

public void makeMove(int timeLimit)

The time limit is exceeded. The computation stops once an evaluation has taken more time than timeLimit.

Parameters:

timeLimit -

alphaBetaPruning

public double alphaBetaPruning(int maxDepth,
                      boolean first,
                      double alpha,
                      double beta)

It sets the instance variable bestPosition, containing the best move Note: The evaluation is only stored, when the situation is completely evaluated. If the evaluation is stoped because alpha>=beta, the evaluation is not stored (it might actually be highter)