Introduction - If you have any usage issues, please Google them yourself
A* algorithm is a heuristic search, which extended the order of nodes is similar to breadth-first search, but the difference is that each node generates a subset of calculated cost function F, to estimate the initial bound node through the node to reach the target node the best path when the cost of the expansion of nodes, the intention is to be extended in all nodes in the selection of the smallest F value for the expansion of the target node in order to make the search as far as possible along the most promising direction . A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient
Packet : 43680520eightpuzzle.rar filelist
Eight Puzzle\9Gird.aps
Eight Puzzle\9Gird.cpp
Eight Puzzle\9Gird.dsp
Eight Puzzle\9Gird.exe
Eight Puzzle\9Gird.h
Eight Puzzle\9Gird.ICO
Eight Puzzle\9Gird.ncb
Eight Puzzle\9Gird.opt
Eight Puzzle\9Gird.rc
Eight Puzzle\eight puzzle.dsw
Eight Puzzle\eight puzzle.ncb
Eight Puzzle\eight puzzle.opt
Eight Puzzle\NineGird.cpp
Eight Puzzle\NineGird.h
Eight Puzzle\resource.h
Eight Puzzle\SMALL.ICO
Eight Puzzle\StdAfx.cpp
Eight Puzzle\StdAfx.h
Eight Puzzle\Debug
Eight Puzzle