用图搜索法：广度优先、深度优先和A*算法实现八数码问题 第4页

             move[0].x=4;

             move[0].y=1;

             move[1].x=4;

             move[1].y=3;

             move[2].x=4;

             move[2].y=5;

             move[3].x=4;

             move[3].y=7;

             return 4;

         case 5:

             move[0].x=5;

             move[0].y=2;

             move[1].x=5;

             move[1].y=4;

             move[2].x=5;

             move[2].y=8;

             return 3;

         case 6:

             move[0].x=6;

             move[0].y=3;

             move[1].x=6;

             move[1].y=7;

             return 2;

         case 7:

             move[0].x=7;

             move[0].y=6;

             move[1].x=7;

             move[1].y=4;

             move[2].x=7;

             move[2].y=8;

             return 3;

         case 8:

             move[0].x=8;

             move[0].y=5;

             move[1].x=8;

             move[1].y=7;

             return 2;

     }

     return 0;

}

long mov(EP_NODE *n1, EP_MOVE *mv, EP_NODE *n2)  

上一页  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 下一页