Ideas for making code faster?

Question

OK, I'm tryig to make a random move generator for a chess game. I want the move to be legit. It's kind of a first step to making an AI I guess. It works but unfortunately it brings my system to it's knees, and my system is pretty good. Here's the generator, any help would be appreciated.
Basically it makes a very large Vector of objects that contain all of the valid moves, then picks one at random.
import java.util.Vector;
public class MoveGenerator
     int team, currentX, currentY, r;
     int[] randomMove = new int[4];
     Vector TeamMoves = new Vector();
     // Creates a new MoveGenerator which will play for team tm
     public MoveGenerator(int tm){
          team = tm;
     // Gets all the possible moves for a team during at a given time and places
     // each move into Vector TeamMoves
     public Vector getTeamMoves(){          
          for (int row = 0; row < 8; row++){
               for (int col = 0; col < 8; col++){
                    // Gets the valid moves for each piece
                    if (ChessBoard.cbLayout[col][row] != null){                         
                         if (ChessBoard.cbLayout[col][row].getTeam() == team){
                              //set currentX/Y to position of each piece
                              currentX = ChessBoard.cbLayout[col][row].getPosition()[0];
                              currentY = ChessBoard.cbLayout[col][row].getPosition()[1];
                              // Goes through and checks if each square is a valid move
                              // for this piece and if it is adds it to TeamMoves
                              for (int y = 0; y < 8; y++){
                                   for (int x = 0; x < 8; x++){                                   
                                        if (ChessBoard.cbLayout[col][row].getValidMoves()[x][y]){
                                             TeamMoves.addElement(new MoveValues(currentX, currentY, x, y));
          return TeamMoves;
     // Sets new random number
     public int renewSeed()
          r = (int) (Math.random() * getTeamMoves().size());
          return r;
     // Will choose one of the valid moves at random
     public int[] getMove(){          
          System.out.println(r);
          randomMove[0] = ((MoveValues)(getTeamMoves().elementAt(r))).getMoveValues()[0];
          randomMove[1] = ((MoveValues)(getTeamMoves().elementAt(r))).getMoveValues()[1];
          randomMove[2] = ((MoveValues)(getTeamMoves().elementAt(r))).getMoveValues()[2];
          randomMove[3] = ((MoveValues)(getTeamMoves().elementAt(r))).getMoveValues()[3];          
          return randomMove;
     // Used to store movement info, all possible moves are then added to
     // Vector TeamMoves. Of which one will be chosen at random.
     class MoveValues
          int fromX, fromY, toX, toY;
          int[] moveArray = new int[4];
          // Sets up an obfject storing the values for a move
          public MoveValues(int x1, int y1, int x2, int y2){
               fromX = x1;
               fromY = y1;
               toX = x2;
               toY = y2;
          // Retrieves the values of the move in this object
          public int[] getMoveValues(){
               moveArray[0] = fromX;
               moveArray[1] = fromY;
               moveArray[2] = toX;
               moveArray[3] = toY;
               return moveArray;
}

Answer 1

Here's a really quick stab at some really simple optimizations...
public Vector getTeamMoves(){
List     listMoves = new ArrayList();          // OPTIMIZE -- use ArrayList instead of Vector
          for (int row = 0; row < 8; row++){
               for (int col = 0; col < 8; col++){
                    // Gets the valid moves for each piece
               ?ChessBoardLayout? layout = ChessBoard.cbLayout[col][row]; // OPTIMIZE - dereference object once
                    if (layout != null){                         
                         if (layout.getTeam() == team){
                              //set currentX/Y to position of each piece
                              int moves[] = layout.getPosition(); // OPTIMIZE- Call method ONCE
                              currentX = moves[0];
                              currentY = moves[1];
                              // Goes through and checks if each square is a valid move
                              // for this piece and if it is adds it to TeamMoves
                              int validMoves[][] = layout.getValidMoves(); // OPTIMIZE- Move method call outside loops
                              for (int y = 0; y < 8; y++){
                                   for (int x = 0; x < 8; x++){                                   
                                        if (validMoves[x][y]){
                                             listMoves.add(new MoveValues(currentX, currentY, x, y));
          return new Vector(listMoves);
     }