Optimizing Code for Chess

[Ashish Schottky]

Hi again,
I have coded a chess game and it has the following part:

 
getMove(){....
Move[] total_final_moves = ge.filterMoves(totalMoves, board, turn);
...}

The dynamic memory allocation of the array, makes the program run slowly.
So I tried

 
Move[] total_final_moves=new Move[200];
getMove(){....
total_final_moves = ge.filterMoves(totalMoves, board, turn);
...}

but then it gives me a bug as there are no other moves which are tried. It seems that no other moves are loaded into the array execept for the first one.
Is there some problem due to memory allocation or the way in which I am accessing it?
here is the code from filter moves()

filtereMoves()
{
int no=0;
        Move[] filteredMoves = new Move[120];
if(legalMove)
filteredMoves[no++]=new_Move;
}

How can I allocate all the required memory statically?(There is tremendous slow-down due to dynamic memory allocation).

[fred rosenberger]

You know that "Move[] total_final_moves=new Move[200]" only allocates space for the pointers to the moves. You don't have the 200 Move objects, just pointers/references to them.

You have effectively created an egg carton that can hold 200 eggs, but it is empty.

[Ashish Schottky]

@Fred: Thanks for replying:
But doesnt this line fill up the array with objects of type Move.
Here ge.filterMoves() return an array of type Move.

total_final_moves = ge.filterMoves(totalMoves, board, turn);