I need some tricks to make my A* path-finding program faster.

At the moment the only trick I use is a Binary heap to find the point with the lowest F score ( F = G + H ).


I was thinking of using a textbox in place of a 2D array because I can only make a 1000x1000 with out getting an error, but there might be a better way?