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

Eight Puzzle
............\9Gird.aps
............\9Gird.cpp
............\9Gird.dsp
............\9Gird.exe
............\9Gird.h

............\9Gird.ncb
............\9Gird.opt
............\9Gird.rc
............\Debug
............\eight puzzle.dsw
............\eight puzzle.ncb
............\eight puzzle.opt
............\NineGird.cpp
............\NineGird.h
............\resource.h
............\SMALL.ICO
............\StdAfx.cpp
............\StdAfx.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．