public boolean expand() {
        children = new TreeNode[nActions];
        MyList moves = state.findMoves();
        if(moves.size()==0){
        	return false;
        }
        Iterator it = moves.iterator();
        int i=0;
        while(it.hasNext()){
        	Move newmove = (Move) it.next();
        	children[i] = new TreeNode();
        	children[i].state = state.tryMove(newmove);
        	children[i].move = newmove;
        	children[i].me = me;
        	i++;
        }
        return true;
    }