Minimax tree search

Minimax.java

    public static void main(String[] args) {
		Tree tree = initialise();
		System.out.println(minimax(tree.getRoot(), 2, true));
	}
	
	private static int minimax(Node node, int depth, boolean isMax) {
		if(depth==0 || node.getChildren()==null || node.getChildren().isEmpty()) {
			return getStateScore(); //evaluation function
		}
		int bestValue = Integer.MIN_VALUE;
		if(isMax) {
			for(Node child:node.getChildren()) {
				int value = minimax(child, depth-1, false);
				bestValue = Math.max(value, bestValue);
			}
		}else {
			bestValue = Integer.MAX_VALUE;
			for(Node child:node.getChildren()) {
				int value = minimax(child, depth-1, true);
				bestValue = Math.min(value, bestValue);
			}
		}
		return bestValue;
	}