文件名称:A星算法
介绍说明－－下载内容均来自于网络，请自行研究使用
八数码问题的A*算法.本实验的A*算法的h(n)=p(n),p(n)定义为每个将牌与其目标位置之间的距离(不考虑夹在其间的将牌)的总和,显然有p(n)=<h*(n),g(n)仍就为节点深度.-the A* algorithm. The experiment of the A* algorithm h (n) = p (n), p (n) is defined for each license its goal the distance between the location (not consider caught in the crossfire of the license) and the aggregate obviously p (n) =
(系统自动生成,下载前可以参看下载内容)
下载文件列表
A星算法.cpp