POJ 1077 八数码-第一道IDA*

#include <iostream>
#include <stack>
#include <cmath>
#include <cstdio>
using namespace std;

#define DEBUG 0

#define my_abs(x)   ((x)>0?(x):-(x))

int dx[4] = {1, 0, 0, -1}; // d r l u
int dy[4] = {0, 1, -1, 0};

char action[] ={'d','r','l','u'};

char maze[3][3];


typedef struct sdfk
{
    int path[400000];
    int top;
}My_stack;
My_stack my_path;

//目标位置
int goal_pos[9][2]  = {
  {0,0}, {0,1}, {0,2},
        {1,0}, {1,1}, {1,2}, {2,0}, {2,1}, {2,2}};
int ans_flag = 0,mi,pos_x,pos_y;


bool Judge(int x,int y)
{
    if( x>=0 && x<3 && y>=0 && y<3)
    return true;

    return false;
}

//H函数，A*的估计值
//除了X之外，其他的各点到标准位置的网格距离
int H(char board[][3])
{
  int sum = 0;
  for(int i =0;i<3;i++)
  {
      for(int j= 0;j<3;j++)
      {
          if(board[i][j] != 9)
          {