Manhattan distance Greedy search

Question

Hi all,
I am developing a program to solve the 8 puzzle using the greedy search.
I have two 2D arrays(sorry about the code) -
public static          int [][] Start ={
                         { 5,4,0 },
{ 6,1,8 },
          { 7,3,2 }};
public static          int [][] Goal = {
                         { 1,2,3 },
               { 8,0,4 },
                    { 7,6,5 }};
I have found where the 0 is and using the outline of the Greedy search, I am moving the tiles in such a vay that It brings the tiles nearer to its goal state. I am moving the Zero and saving the two new Temporary arrays. I now need to run the two arrays through the Manhatten Distance function to find out which is the best to use and then I am going to save the best choice as my new Start array and keep looping through again and again until I have found my goal state!!
I no its long winded but its the only way I understand!!
My problem is that I can not figure out how to enter the temporary arrays into the Manhattan Function to figure out which is best??
I would greatly appreciate any help!!
Here is my source code --
import java.io.*;
public class Puzzle
               public static          int [][] tempStart1 = new int[3][3];
               public static          int [][] tempStart2 = new int[3][3];
               public static          int [][] Start ={
                                                  { 5,4,0 },
                                                  { 6,1,8 },
                    { 7,3,2 }};
               public static          int [][] Goal = {
                                                  { 1,2,3 },
                              { 8,0,4 },
                                   { 7,6,5 }};
          public static int i,j,x,y;
               public Puzzle()
          public static void main(String [] args)
                    printArray();
                    findBlank();
     public static void printArray(){
               System.out.println("Start State");
               for( int i =0; i< 3; i++){
               for( int j =0; j< 3; j++){
          System.out.print(Start[i][j]);
                    System.out.println("");
               System.out.println("\n");
               System.out.println("Goal State");
               for( int x =0; x< 3; x++){
               for( int y =0; y< 3; y++){
          System.out.print(Goal[x][y]);
                    System.out.println("");
     public static void findBlank(){
               for( int i =0; i< 3; i++){
               for( int j =0; j< 3; j++){
               if ( Start[i][j] == 0){
                         System.out.println("\n");
                         System.out.println("Blank Tile Found at : - ");
                         if (Start[i][j] == Start[0][0])
                         System.out.println("0,0");
                         if (Start[i][j] == Start[0][1])
                         System.out.println("0,1");
                         if (Start[i][j] == Start[0][2])
                         System.out.println("0,2");
                         swap(Start, 0, 2, 0, 1, 1, 2);
                         if (Start[i][j] == Start[1][0])
                         System.out.println("1,0");
                         if (Start[i][j] == Start[1][1])
                         System.out.println("1,1");
                         if (Start[i][j] == Start[1][2])
                         System.out.println("1,2");
                         if (Start[i][j] == Start[2][0])
                         System.out.println("2,0");
                         if (Start[i][j] == Start[2][1])
                         System.out.println("2,1");
                         if (Start[i][j] == Start[2][2])
                         System.out.println("2,2");
          public static void swap( int array[][], int currentPos1, int currentPos2, int FirstMove1, int FirstMove2, int secMove1, int secMove2){
                    int hold;
                    int tempCurrNumber1a = currentPos1;
                    int tempCurrNumber2a = currentPos2;
                    int tempCurrNumber1b = currentPos1;
                    int tempCurrNumber2b = currentPos2;
                    for( int x =0; x< 3; x++){
                    for( int y =0; y< 3; y++){
                              tempStart1[x][y] = array[x][y];
                              tempStart2[x][y] = array[x][y];
                    hold = tempStart1[tempCurrNumber1a][tempCurrNumber2a];
                    tempStart1[tempCurrNumber1a][tempCurrNumber2a] = tempStart1[FirstMove1][FirstMove2];
                    tempStart1[FirstMove1][FirstMove2] = hold;
                    System.out.print("\n");
                    for( int x =0; x< 3; x++){
                              for( int y =0; y< 3; y++){
                              System.out.print(tempStart1[x][y]);
                                   System.out.println("");
                    hold = tempStart2[tempCurrNumber1b][tempCurrNumber2b];
                                        tempStart2[tempCurrNumber1b][tempCurrNumber2b] = array[secMove1][secMove2];
                                        tempStart2[secMove1][secMove2] = hold;
                                        System.out.print("\n");
                                        for( int x =0; x< 3; x++){
                                                  for( int y =0; y< 3; y++){
                                                  System.out.print(tempStart2[x][y]);
                                                       System.out.println("");
                                   // Manhatten (|X - X'| + |Y - Y'|).

Answer 1

Cross-post:
http://forum.java.sun.com/thread.jsp?forum=54&thread=459075&tstart=0&trange=15